default search action
Michal Merta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Jakub Homola
, Michal Merta, Jan Zapletal:
Acceleration of the space-time boundary element method using GPUs. Adv. Eng. Softw. 184: 103497 (2023) - 2022
- [j13]Raphael Watschinger, Michal Merta
A Parallel Fast Multipole Method for a Space-Time Boundary Element Method for the Heat Equation. SIAM J. Sci. Comput. 44(4): 320- (2022) - 2021
- [j12]Jan Zapletal
Semi-analytic integration for a parallel space-time boundary element method modelling the heat equation. Comput. Math. Appl. 103: 156-170 (2021) - [j11]Michal Kravcenko
Distributed solution of the Helmholtz transmission problems via relaxed local multi-trace formulation and adaptive cross approximation. J. Comput. Appl. Math. 398: 113644 (2021) - [i2]Jan Zapletal, Raphael Watschinger, Günther Of, Michal Merta:
Semi-analytic integration for a parallel space-time boundary element method modeling the heat equation. CoRR abs/2102.09811 (2021) - [i1]Raphael Watschinger, Michal Merta, Günther Of, Jan Zapletal:
A parallel fast multipole method for a space-time boundary element method for the heat equation. CoRR abs/2106.15911 (2021)
2010 – 2019
- 2019
- [j10]Michal Kravcenko, Michal Merta
Distributed fast boundary element methods for Helmholtz problems. Appl. Math. Comput. 362 (2019) - [j9]Stefan Dohr, Jan Zapletal
A parallel space-time boundary element method for the heat equation. Comput. Math. Appl. 78(9): 2852-2866 (2019) - [j8]Lubomir Riha
A massively parallel and memory-efficient FEM toolbox with a hybrid total FETI solver with accelerator support. Int. J. High Perform. Comput. Appl. 33(4) (2019) - [c4]Michal Kravcenko
Parallel Adaptive Cross Approximation for the Multi-trace Formulation of Scattering Problems. PPAM (1) 2019: 141-150 - 2018
- [j7]Lukás Malý, Jan Zapletal
Evaluation of the Intel Xeon Phi offload runtimes for domain decomposition solvers. Adv. Eng. Softw. 125: 146-154 (2018) - [j6]Michal Merta
A parallel library for boundary element discretization of engineering problems. Math. Comput. Simul. 145: 106-113 (2018) - 2017
- [j5]Michal Merta, Lubomir Riha
Intel Xeon Phi acceleration of Hybrid Total FETI solver. Adv. Eng. Softw. 112: 124-135 (2017) - [j4]Jan Zapletal
Boundary element quadrature schemes for multi- and many-core architectures. Comput. Math. Appl. 74(1): 157-173 (2017) - [c3]Michal Kravcenko, Lukás Malý, Michal Merta, Jan Zapletal
Parallel Assembly of ACA BEM Matrices on Xeon Phi Clusters. PPAM (1) 2017: 101-110 - 2015
- [j3]Martin Cermák
Total-FETI domain decomposition method for solution of elasto-plastic problems. Adv. Eng. Softw. 84: 48-54 (2015) - [j2]Michal Merta
Acceleration of boundary element method by explicit vectorization. Adv. Eng. Softw. 86: 70-79 (2015) - [j1]Dalibor Lukás
A parallel fast boundary element method using cyclic graph decompositions. Numer. Algorithms 70(4): 807-824 (2015) - [c2]Michal Merta
Many Core Acceleration of the Boundary Element Method. HPCSE 2015: 116-125 - 2012
- [c1]Vaclav Hapla
Use of Direct Solvers in TFETI Massively Parallel Implementation. PARA 2012: 192-205
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-04-25 05:56 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: