default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomás Brzobohatý
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j18]Markéta Faltýnková, Ondrej Meca, Tomás Brzobohatý, Lubomír Ríha, Milan Jaros, Petr Strakos:
Workflow for high-quality visualisation of large-scale CFD simulations by volume rendering. Adv. Eng. Softw. 200: 103822 (2025)- 2024
- [j17]Tomás Panoc
, Ondrej Meca, Lukas Tomaszek, Tomás Brzobohatý, Lubomír Ríha, Ivan Zelinka, Tomás Kozubek:
Automated search of an optimal configuration of FETI-based algorithms with the swarm and evolutionary algorithms. Appl. Soft Comput. 167: 112437 (2024) - [j16]Kristian Kadlubiak, Ondrej Meca, Lubomír Ríha, Tomás Brzobohatý:
An approach for dynamically adaptable SIMD vectorization of FEM kernels. Comput. Phys. Commun. 304: 109319 (2024) - 2023
- [j15]Marek Gebauer, Tomás Blejchar, Tomás Brzobohatý, Miroslav Nevrela:
Conjugate Heat Transfer Model for an Induction Motor and Its Adequate FEM Model. Symmetry 15(7): 1294 (2023) - 2022
- [j14]Ondrej Meca, Lubomír Ríha, Branislav Jansik, Tomás Brzobohatý:
Toward highly parallel loading of unstructured meshes. Adv. Eng. Softw. 166: 103100 (2022) - [j13]Zdenek Dostál, David Horák, Jakub Kruzík, Tomás Brzobohatý, Oldrich Vlach:
Highly scalable hybrid domain decomposition method for the solution of huge scalar variational inequalities. Numer. Algorithms 91(2): 773-801 (2022) - [j12]Zdenek Dostál, Tomás Brzobohatý, Oldrich Vlach, Lubomír Ríha:
On the spectrum of Schur complements of 2D elastic clusters joined by rigid edge modes and hybrid domain decomposition. Numerische Mathematik 152(1): 41-66 (2022) - [j11]Marek Gebauer, Tomás Blejchar, Tomás Brzobohatý, Tomás Karásek, Miroslav Nevrela:
Determination of Aerodynamic Losses of Electric Motors. Symmetry 14(11): 2399 (2022) - 2021
- [j10]Zdenek Dostál, Tomás Brzobohatý, Oldrich Vlach:
Schur complement spectral bounds for large hybrid FETI-DP clusters and huge three-dimensional scalar problems. J. Num. Math. 29(4): 289-306 (2021) - [j9]Zdenek Dostál, David Horák, Tomás Brzobohatý, Petr Vodstrcil:
Bounds on the spectra of Schur complements of large H-TFETI-DP clusters for 2D Laplacian. Numer. Linear Algebra Appl. 28(2) (2021)
2010 – 2019
- 2019
- [j8]Tomás Brzobohatý, Marta Jarosová, Radek Kucera, Václav Sátek:
Path-following interior point method: Theory and applications for the Stokes flow with a stick-slip boundary condition. Adv. Eng. Softw. 129: 35-43 (2019) - [j7]Lubomir Riha, Michal Merta, Radim Vavrík, Tomás Brzobohatý, Alexandros Markopoulos, Ondrej Meca, Ondrej Vysocky, Tomás Kozubek, Vít Vondrák:
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) - [c5]Ondrej Meca, Lubomír Ríha, Tomás Brzobohatý:
An Approach for Parallel Loading and Pre-Processing of Unstructured Meshes Stored in Spatially Scattered Fashion. IPDPS 2019: 749-760 - 2017
- [j6]Lubomír Ríha, Tomás Brzobohatý, Alexandros Markopoulos:
Hybrid parallelization of the total FETI solver. Adv. Eng. Softw. 103: 29-37 (2017) - [j5]Michal Merta, Lubomir Riha, Ondrej Meca, Alexandros Markopoulos, Tomás Brzobohatý, Tomás Kozubek, Vít Vondrák:
Intel Xeon Phi acceleration of Hybrid Total FETI solver. Adv. Eng. Softw. 112: 124-135 (2017) - [c4]Ondrej Meca, Lubomír Ríha, Alexandros Markopoulos, Tomás Brzobohatý, Tomás Kozubek:
Using ESPRESO as Linear Solver Library for Third Party FEM Tools for Solving Large Scale Problems. HPCSE 2017: 130-143 - 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) - [c3]Lubomír Ríha, Tomás Brzobohatý, Alexandros Markopoulos, Ondrej Meca, Tomás Kozubek:
Massively Parallel Hybrid Total FETI (HTFETI) Solver. PASC 2016: 7 - 2015
- [j3]Zdenek Dostál, Tomás Kozubek, Oldrich Vlach, Tomás Brzobohatý:
Reorthogonalization-based stiffness preconditioning in FETI algorithms with applications to variational inequalities. Numer. Linear Algebra Appl. 22(6): 987-998 (2015) - [c2]Lubomír Ríha, Tomás Brzobohatý, Alexandros Markopoulos, Tomás Kozubek, Ondrej Meca, Olaf Schenk, Wim Vanroose:
Efficient Implementation of Total FETI Solver for Graphic Processing Units Using Schur Complement. HPCSE 2015: 85-100 - 2014
- [j2]Zdenek Dostál, Tomás Brzobohatý, David Horák, Tomás Kozubek, Petr Vodstrcil:
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) - 2013
- [p3]Zdenek Dostál, Tomás Kozubek, Tomás Brzobohatý, Alexandros Markopoulos, Marie Sadowská, Vít Vondrák:
Scalable Domain Decomposition Algorithms for Contact Problems: Theory, Numerical Experiments, and Real World Problems. Domain Decomposition Methods in Science and Engineering XX 2013: 39-49 - [p2]Tomás Kozubek, Zdenek Dostál, Tomás Brzobohatý, Alexandros Markopoulos, Oldrich Vlach:
TFETI Scalable Solvers for Transient Contact Problems. Domain Decomposition Methods in Science and Engineering XX 2013: 329-336 - [p1]Dalibor Lukás, Marie Sadowská, Tomás Kozubek, Alexandros Markopoulos, Tomás Brzobohatý:
A Comparison of TFETI and TBETI for Numerical Solution of Engineering Problems of Contact Mechanics. Domain Decomposition Methods in Science and Engineering XX 2013: 345-352 - 2010
- [j1]Zdenek Dostál, Tomás Kozubek, P. Horyl, Tomás Brzobohatý, Alexandros Markopoulos:
A scalable TFETI algorithm for two-dimensional multibody contact problems with friction. J. Comput. Appl. Math. 235(2): 403-418 (2010)
2000 – 2009
- 2009
- [c1]Zdenek Dostál, Tomás Brzobohatý, Tomás Kozubek, Alexandros Markopoulos, Vít Vondrák:
A Scalable TFETI Based Algorithm for 2D and 3D Frictionless Contact Problems. LSSC 2009: 92-99
Coauthor Index
aka: Lubomír Ríha
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 2025-01-21 00:01 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:
