default search action
David Horák
Person information
- affiliation: VSB-TU Ostrava and Institue of Geonics ASCR, Ostrava, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Petr Vodstrcil
, Dalibor Lukás, Zdenek Dostál, Marie Sadowská, David Horák, Oldrich Vlach
On favorable bounds on the spectrum of discretized Steklov-Poincaré operator and applications to domain decomposition methods in 2D. Comput. Math. Appl. 167: 12-20 (2024) - 2023
- [i2]Jan Stebel, Jakub Kruzík, David Horák, Jan Brezina, Michal Béres:
On the parallel solution of hydro-mechanical problems with fracture networks and contact conditions. CoRR abs/2311.13310 (2023) - 2022
- [j20]Zdenek Dostál
Highly scalable hybrid domain decomposition method for the solution of huge scalar variational inequalities. Numer. Algorithms 91(2): 773-801 (2022) - 2021
- [j19]Owe Axelsson, Zhao-Zheng Liang, Jakub Kruzik
Inner product free iterative solution and elimination methods for linear systems of a three-by-three block matrix form. J. Comput. Appl. Math. 383: 113117 (2021) - [j18]Zdenek Dostál
Bounds on the spectra of Schur complements of large H-TFETI-DP clusters for 2D Laplacian. Numer. Linear Algebra Appl. 28(2) (2021) - 2020
- [j17]Jakub Kruzík
Active set expansion strategies in MPRGP algorithm. Adv. Eng. Softw. 149: 102895 (2020) - [j16]Jakub Kruzik
Comparison of selected FETI coarse space projector implementation strategies. Parallel Comput. 93: 102608 (2020) - [j15]Serena Crisci
Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming. Soft Comput. 24(23): 17761-17770 (2020) - [i1]Jakub Kruzik, David Horák, Martin Cermák, Lukás Pospísil, Marek Pecha:
Active set expansion strategies in MPRGP algorithm. CoRR abs/2002.06077 (2020)
2010 – 2019
- 2019
- [j14]Jirí Tomcala
Steps to increase practical applicability of PragTic software. Adv. Eng. Softw. 129: 57-68 (2019) - 2018
- [j13]Radim Sojka, David Horák
The impact of enabling multiple subdomains per MPI process in the TFETI domain decomposition method. Appl. Math. Comput. 319: 586-597 (2018) - 2017
- [j12]Joseph Schuchart
The READEX formalism for automatic tuning for energy efficiency. Computing 99(8): 727-745 (2017) - [c6]Jakub Kruzík
Investigating Convergence of Linear SVM Implemented in PermonSVM Employing MPRGP Algorithm. HPCSE 2017: 115-129 - 2016
- [j11]Lubomír Ríha
Implementation of the efficient communication layer for the highly parallel total FETI and hybrid total FETI solvers. Parallel Comput. 57: 154-166 (2016) - [c5]David Horák
Energy consumption optimization of the Total-FETI solver and BLAS routines by changing the CPU frequency. HPCS 2016: 1031-1032 - 2015
- [j10]Martin Cermák
Total-FETI domain decomposition method for solution of elasto-plastic problems. Adv. Eng. Softw. 84: 48-54 (2015) - [c4]Vaclav Hapla
Solving Contact Mechanics Problems with PERMON. HPCSE 2015: 101-115 - 2014
- [j9]Zdenek Dostál
On R-linear convergence of semi-monotonic inexact augmented Lagrangians for bound and equality constrained quadratic programming problems with application. Comput. Math. Appl. 67(3): 515-526 (2014) - [j8]Zdenek Dostál
On R-linear convergence of semi-monotonic inexact augmented Lagrangians for saddle point problems. Comput. Optim. Appl. 58(1): 87-103 (2014) - [c3]Vaclav Hapla
FLLOP: A Massively Parallel Solver Combining FETI Domain Decomposition Method and Quadratic Programming. HPCC/CSS/ICESS 2014: 320-327 - 2013
- [j7]Tomás Kozubek
Total FETI domain decomposition method and its massively parallel implementation. Adv. Eng. Softw. 60: 14-22 (2013) - 2012
- [c2]Vaclav Hapla
Use of Direct Solvers in TFETI Massively Parallel Implementation. PARA 2012: 192-205 - 2011
- [c1]Vaclav Hapla
TFETI Coarse Space Projectors Parallelization Strategies. PPAM (1) 2011: 152-162
2000 – 2009
- 2009
- [j6]Zdenek Dostál
A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface. J. Comput. Appl. Math. 231(2): 577-591 (2009) - 2007
- [j5]Zdenek Dostál
FETI-based algorithms for modelling of fibrous composite materials with debonding. Math. Comput. Simul. 76(1-3): 57-64 (2007) - [j4]Zdenek Dostál
Theoretically Supported Scalable FETI for Numerical Solution of Variational Inequalities. SIAM J. Numer. Anal. 45(2): 500-513 (2007) - 2006
- [j3]Nina Castová, David Horák
Description of Seismic Events Using Wavelet Transform. Int. J. Wavelets Multiresolution Inf. Process. 4(3): 405-414 (2006) - 2004
- [j2]Zdenek Dostál
Scalable FETI with optimal dual penalty for a variational inequality. Numer. Linear Algebra Appl. 11(5-6): 455-472 (2004) - 2003
- [j1]Zdenek Dostál
Scalability and FETI based algorithm for large discretized variational inequalities. Math. Comput. Simul. 61(3-6): 347-357 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: