default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Cermák
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Jaroslav Rojícek
, Martin Cermák, Radim Halama, Zbynek Paska, Milan Vasko:
Material model identification from set of experiments and validation by DIC. Math. Comput. Simul. 189: 339-367 (2021)- 2020
- [j13]Jakub Kruzík, David Horák, Martin Cermák, Lukás Pospísil, Marek Pecha:
Active set expansion strategies in MPRGP algorithm. Adv. Eng. Softw. 149: 102895 (2020) - [j12]Jakub Kruzik, David Horák, Vaclav Hapla, Martin Cermák:
Comparison of selected FETI coarse space projector implementation strategies. Parallel Comput. 93: 102608 (2020) - [i2]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
- [j11]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) - [j10]Martin Cermák, Stanislav Sysala, Jan Valdman:
Efficient and flexible MATLAB implementation of 2D and 3D elastoplastic problems. Appl. Math. Comput. 355: 595-614 (2019) - 2018
- [j9]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) - [j8]Martin Cermák, Frédéric Hecht, Zuqi Tang, Martin Vohralík:
Adaptive inexact iterative algorithms based on polynomial-degree-robust a posteriori estimates for the Stokes problem. Numerische Mathematik 138(4): 1027-1065 (2018) - [e2]Tomás Kozubek, Martin Cermák, Petr Tichý, Radim Blaheta, Jakub Sístek, Dalibor Lukás, Jirí Jaros:
High Performance Computing in Science and Engineering - Third International Conference, HPCSE 2017, Karolinka, Czech Republic, May 22-25, 2017, Revised Selected Papers. Lecture Notes in Computer Science 11087, Springer 2018, ISBN 978-3-319-97135-3 [contents] - 2017
- [j7]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) - [c9]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
- [e1]Tomás Kozubek, Radim Blaheta, Jakub Sístek, Miroslav Rozlozník, Martin Cermák:
High Performance Computing in Science and Engineering - Second International Conference, HPCSE 2015, Soláň, Czech Republic, May 25-28, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9611, Springer 2016, ISBN 978-3-319-40360-1 [contents] - 2015
- [j6]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) - [j5]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) - [c8]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 - [c7]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 - [i1]Martin Cermák, Jaroslav Kruis, Tomás Koudelka, Stanislav Sysala, Jan Zeman:
Simplified numerical realization of elastoplastic constitutive problems: PART I - criteria given by Haigh-Westergaard coordinates. CoRR abs/1503.03605 (2015) - 2014
- [j4]Martin Cermák, Tomás Kozubek, Stanislav Sysala, Jan Valdman:
A TFETI domain decomposition solver for elastoplastic problems. Appl. Math. Comput. 231: 634-653 (2014) - [c6]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
- [j3]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
- [b1]Martin Cermák:
Formální systémy automatů a gramatik ; Formal Systems Based on Automata and Grammars. Brno University of Technology, Czech Republic, 2012 - 2011
- [c5]Martin Cermák, Alexander Meduna:
n-Accepting Restricted Pushdown Automata Systems. AFL 2011: 168-183 - [c4]Michal Kopecky, Martin Cermák:
Precis Index Implementation for Efficient Fulltext Data Mining. DATESO 2011: 173-180
2000 – 2009
- 2007
- [j2]Martin Cermák, Václav Skala:
Polygonisation of disjoint implicit surfaces by the adaptive edge spinning algorithm of implicit objects. Int. J. Comput. Sci. Eng. 3(1): 45-52 (2007) - 2005
- [j1]Martin Cermák, Václav Skala:
Polygonization of implicit surfaces with sharp features by edge-spinning. Vis. Comput. 21(4): 252-264 (2005) - 2004
- [c3]Martin Cermák, Václav Skala:
Adaptive Edge Spinning Algorithm for Poligonization of Implicit Surfaces. Computer Graphics International 2004: 36-43 - [c2]Martin Cermák, Václav Skala:
Surface Curvature Estimation for Edge Spinning Algorithm. International Conference on Computational Science 2004: 412-418 - [c1]Martin Cermák, Václav Skala:
Curvature Dependent Polygonization by the Edge Spinning. ICCSA (3) 2004: 325-334
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-11 19:24 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:
