default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOldrich Vlach
Person information
- affiliation: University of Ostrava, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Petr Vodstrcil
, Dalibor Lukás, Zdenek Dostál, Marie Sadowská, David Horák, Oldrich Vlach, Jirí Bouchala, Jakub Kruzík:
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)- 2022
- [j9]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) - [j8]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) - 2021
- [j7]Zdenek Dostál, Oldrich Vlach:
An accelerated augmented Lagrangian algorithm with adaptive orthogonalization strategy for bound and equality constrained quadratic programming and its application to large-scale contact problems of elasticity. J. Comput. Appl. Math. 394: 113565 (2021) - [j6]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)
2010 – 2019
- 2017
- [c1]Zdenek Dostál, Gerardo Toraldo, Marco Viola, Oldrich Vlach:
Proportionality-Based Gradient Methods with Applications in Contact Mechanics. HPCSE 2017: 47-58 - 2015
- [j5]Oldrich Vlach, Zdenek Dostál, Tomás Kozubek:
On Conditioning of Constraints Arising from Variationally Consistent Discretization of Contact Problems and Duality Based Solvers. Comput. Methods Appl. Math. 15(2): 221-231 (2015) - [j4]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) - 2013
- [p1]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 - 2012
- [j3]Jaroslav Haslinger, Radek Kucera, Oldrich Vlach, C. C. Baniotopoulos:
Approximation and numerical realization of 3D quasistatic contact problems with Coulomb friction. Math. Comput. Simul. 82(10): 1936-1951 (2012) - 2010
- [j2]J. Drápala, P. Kubícek, Oldrich Vlach:
Computer simulation of diffusion processes with moving interface boundary. Math. Comput. Simul. 80(7): 1520-1535 (2010)
2000 – 2009
- 2007
- [j1]Zdenek Dostál, David Horák, Oldrich Vlach:
FETI-based algorithms for modelling of fibrous composite materials with debonding. Math. Comput. Simul. 76(1-3): 57-64 (2007)
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 21:17 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:
