default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakub Kruzik
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]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)- 2023
- [i2]Jan Stebel, Jakub Kruzík, David Horák, Jan Brezina, Michal Béres:
On the parallel solution of hydro-mechanical problems with fracture networks and contact conditions. CoRR abs/2311.13310 (2023) - 2022
- [j7]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) - 2021
- [j6]Owe Axelsson, Zhao-Zheng Liang, Jakub Kruzik, David Horák:
Inner product free iterative solution and elimination methods for linear systems of a three-by-three block matrix form. J. Comput. Appl. Math. 383: 113117 (2021) - 2020
- [j5]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) - [j4]Jakub Kruzik, David Horák, Vaclav Hapla, Martin Cermák:
Comparison of selected FETI coarse space projector implementation strategies. Parallel Comput. 93: 102608 (2020) - [j3]Serena Crisci, Jakub Kruzík, Marek Pecha, David Horák:
Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming. Soft Comput. 24(23): 17761-17770 (2020) - [i1]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
- 2017
- [j2]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) - [j1]Joseph Schuchart, Michael Gerndt, Per Gunnar Kjeldsberg, Michael Lysaght, David Horák, Lubomír Ríha, Andreas Gocht, Mohammed Sourouri, Madhura Kumaraswamy, Anamika Chowdhury, Magnus Jahre, Kai Diethelm, Othman Bouizi, Umbreen Sabir Mian, Jakub Kruzík, Radim Sojka, Martin Beseda, Venkatesh Kannan, Zakaria Bendifallah, Daniel Hackenberg, Wolfgang E. Nagel:
The READEX formalism for automatic tuning for energy efficiency. Computing 99(8): 727-745 (2017) - [c3]Radim Blaheta, Tomás Luber, Jakub Kruzík:
Schur Complement-Schwarz DD Preconditioners for Non-stationary Darcy Flow Problems. HPCSE 2017: 59-72 - [c2]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
- [c1]David Horák, Lubomír Ríha, Radim Sojka, Jakub Kruzik, Martin Beseda:
Energy consumption optimization of the Total-FETI solver and BLAS routines by changing the CPU frequency. HPCS 2016: 1031-1032
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 2025-01-09 13:22 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:
