default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVaclav Hapla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]David A. Ham
, Vaclav Hapla, Matthew G. Knepley, Lawrence Mitchell, Koki Sagiyama:
Efficient N-to-M Checkpointing Algorithm for Finite Element Simulations. SIAM J. Sci. Comput. 46(6): 830- (2024)- [i2]David A. Ham, Vaclav Hapla, Matthew G. Knepley, Lawrence Mitchell, Koki Sagiyama:
Efficient N-to-M Checkpointing Algorithm for Finite Element Simulations. CoRR abs/2401.05868 (2024) - 2021
- [j9]Vaclav Hapla, Matthew G. Knepley, Michael Afanasiev, Christian Boehm, Martin van Driel, Lion Krischer, Andreas Fichtner:
Fully Parallel Mesh I/O Using PETSc DMPlex with an Application to Waveform Modeling. SIAM J. Sci. Comput. 43(2): C127-C153 (2021) - 2020
- [j8]Jakub Kruzik, David Horák, Vaclav Hapla, Martin Cermák:
Comparison of selected FETI coarse space projector implementation strategies. Parallel Comput. 93: 102608 (2020) - [i1]Vaclav Hapla, Matthew G. Knepley, Michael Afanasiev, Christian Boehm, Martin van Driel, Lion Krischer, Andreas Fichtner:
Fully Parallel Mesh I/O using PETSc DMPlex with an Application to Waveform Modeling. CoRR abs/2004.08729 (2020)
2010 – 2019
- 2019
- [j7]Jirí Tomcala, Jan Papuga, David Horák, Václav Hapla, Marek Pecha, Martin Cermák:
Steps to increase practical applicability of PragTic software. Adv. Eng. Softw. 129: 57-68 (2019) - 2018
- [j6]Radim Sojka, David Horák, Vaclav Hapla, Martin Cermák:
The impact of enabling multiple subdomains per MPI process in the TFETI domain decomposition method. Appl. Math. Comput. 319: 586-597 (2018) - 2017
- [j5]Martin Cermák, Vaclav Hapla, Jakub Kruzik, Alexandros Markopoulos, Alena Vasatová:
Comparison of different FETI preconditioners for elastoplasticity. Comput. Math. Appl. 74(1): 96-109 (2017) - [c6]Jakub Kruzík, Marek Pecha, Václav Hapla, David Horák, Martin Cermák:
Investigating Convergence of Linear SVM Implemented in PermonSVM Employing MPRGP Algorithm. HPCSE 2017: 115-129 - 2016
- [j4]Lubomír Ríha, Tomás Brzobohatý, Alexandros Markopoulos, Marta Jarosová, Tomás Kozubek, David Horák, Vaclav Hapla:
Implementation of the efficient communication layer for the highly parallel total FETI and hybrid total FETI solvers. Parallel Comput. 57: 154-166 (2016) - 2015
- [j3]Martin Cermák, Vaclav Hapla, David Horák, Michal Merta, Alexandros Markopoulos:
Total-FETI domain decomposition method for solution of elasto-plastic problems. Adv. Eng. Softw. 84: 48-54 (2015) - [j2]Alexandros Markopoulos, Vaclav Hapla, Martin Cermák, Martin Fusek:
Massively parallel solution of elastoplasticity problems with tens of millions of unknowns using PermonCube and FLLOP packages. Appl. Math. Comput. 267: 698-710 (2015) - [c5]Vaclav Hapla, David Horák, Lukás Pospísil, Martin Cermák, Alena Vasatová, Radim Sojka:
Solving Contact Mechanics Problems with PERMON. HPCSE 2015: 101-115 - [c4]Alena Vasatová, Martin Cermák, Vaclav Hapla:
Parallel Implementation of the FETI DDM Constraint Matrix on Top of PETSc for the PermonFLLOP Package. PPAM (1) 2015: 150-159 - 2014
- [c3]Vaclav Hapla, Martin Cermák, Alexandros Markopoulos, David Horák:
FLLOP: A Massively Parallel Solver Combining FETI Domain Decomposition Method and Quadratic Programming. HPCC/CSS/ICESS 2014: 320-327 - 2013
- [j1]Tomás Kozubek, Vít Vondrák, Martin Mensík, David Horák, Zdenek Dostál, Vaclav Hapla, Pavla Kabelíková, Martin Cermák:
Total FETI domain decomposition method and its massively parallel implementation. Adv. Eng. Softw. 60: 14-22 (2013) - 2012
- [c2]Vaclav Hapla, David Horák, Michal Merta:
Use of Direct Solvers in TFETI Massively Parallel Implementation. PARA 2012: 192-205 - 2011
- [c1]Vaclav Hapla, David Horák:
TFETI Coarse Space Projectors Parallelization Strategies. PPAM (1) 2011: 152-162
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-12-23 19:33 CET 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:
