default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiroslav Tuma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Jennifer A. Scott
, Miroslav Tuma:
Avoiding Breakdown in Incomplete Factorizations in Low Precision Arithmetic. ACM Trans. Math. Softw. 50(2): 9:1-9:25 (2024)- [i3]Jennifer A. Scott, Miroslav Tuma:
Avoiding breakdown in incomplete factorizations in low precision arithmetic. CoRR abs/2401.17957 (2024) - [i2]Jennifer A. Scott, Miroslav Tuma:
A note on incomplete Cholesky factorizations in half precision arithmetic. CoRR abs/2403.13123 (2024) - 2023
- [c7]Martin Spisák, Radek Bartyzal, Antonín Hoskovec, Ladislav Peska, Miroslav Tuma:
Scalable Approximate NonSymmetric Autoencoder for Collaborative Filtering. RecSys 2023: 763-770 - 2022
- [j36]Jennifer A. Scott, Miroslav Tuma:
A null-space approach for large-scale symmetric saddle point systems with a small and non zero (2, 2) block. Numer. Algorithms 90(4): 1639-1667 (2022) - [j35]Jennifer A. Scott, Miroslav Tuma:
A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems. ACM Trans. Math. Softw. 48(1): 5:1-5:24 (2022) - 2021
- [j34]Jennifer A. Scott, Miroslav Tuma:
Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows. ACM Trans. Math. Softw. 47(1): 1:1-1:25 (2021) - [i1]Jennifer A. Scott, Miroslav Tuma:
Solving large linear least squares with linear equality constraints. CoRR abs/2106.13142 (2021)
2010 – 2019
- 2019
- [j33]Jennifer A. Scott, Miroslav Tuma:
Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems. SIAM J. Sci. Comput. 41(3): A1604-A1625 (2019) - 2018
- [j32]Robert Cimrman, Matyás Novák, Radek Kolman, Miroslav Tuma, Jirí Plesek, Jirí Vackár:
Convergence study of isogeometric analysis based on Bézier extraction in electronic structure calculations. Appl. Math. Comput. 319: 138-152 (2018) - [j31]Robert Cimrman, Matyás Novák, Radek Kolman, Miroslav Tuma, Jirí Vackár:
Isogeometric analysis in electronic structure calculations. Math. Comput. Simul. 145: 125-135 (2018) - [j30]Jennifer A. Scott, Miroslav Tuma:
A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows. Numer. Algorithms 79(4): 1147-1168 (2018) - [j29]Erin C. Carson, Miroslav Rozlozník, Zdenek Strakos, Petr Tichý, Miroslav Tuma:
The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology. SIAM J. Sci. Comput. 40(5): A3549-A3580 (2018) - 2017
- [j28]Jirí Kopal, Miroslav Rozlozník, Miroslav Tuma:
An adaptive multilevel factorized sparse approximate inverse preconditioning. Adv. Eng. Softw. 113: 19-24 (2017) - [j27]Jennifer A. Scott, Miroslav Tuma:
Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners. Numer. Linear Algebra Appl. 24(5) (2017) - [j26]Jennifer A. Scott, Miroslav Tuma:
Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods. SIAM J. Sci. Comput. 39(6) (2017) - 2016
- [j25]Jirí Kopal, Miroslav Rozlozník, Miroslav Tuma:
Factorized Approximate Inverses with Adaptive Dropping. SIAM J. Sci. Comput. 38(3) (2016) - [j24]Jennifer A. Scott, Miroslav Tuma:
Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations. SIAM J. Sci. Comput. 38(6) (2016) - 2015
- [j23]Jirí Kopal, Miroslav Rozlozník, Miroslav Tuma:
Approximate inverse preconditioners with adaptive dropping. Adv. Eng. Softw. 84: 13-20 (2015) - 2014
- [j22]Jurjen Duintjer Tebbens, Miroslav Tuma:
On Incremental Condition Estimators in the 2-Norm. SIAM J. Matrix Anal. Appl. 35(1): 174-197 (2014) - [j21]Jennifer A. Scott, Miroslav Tuma:
On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization. SIAM J. Sci. Comput. 36(2) (2014) - [j20]Rafael Bru, José Marín, José Mas, Miroslav Tuma:
Preconditioned Iterative Methods for Solving Linear Least Squares Problems. SIAM J. Sci. Comput. 36(4) (2014) - [j19]Jennifer A. Scott, Miroslav Tuma:
On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems. SIAM J. Sci. Comput. 36(6) (2014) - [j18]Jennifer A. Scott, Miroslav Tuma:
HSL_MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code. ACM Trans. Math. Softw. 40(4): 24:1-24:19 (2014) - 2010
- [j17]Jurjen Duintjer Tebbens, Miroslav Tuma:
Preconditioner updates for solving sequences of linear systems in matrix-free environment. Numer. Linear Algebra Appl. 17(6): 997-1019 (2010) - [j16]Rafael Bru, José Marín, José Mas, Miroslav Tuma:
Improved Balanced Incomplete Factorization. SIAM J. Matrix Anal. Appl. 31(5): 2431-2452 (2010)
2000 – 2009
- 2009
- [c6]Katerina Jurková, Miroslav Tuma:
Factorization-Based Graph Repartitionings. LSSC 2009: 771-778 - 2008
- [j15]Rafael Bru, José Marín, José Mas, Miroslav Tuma:
Balanced Incomplete Factorization. SIAM J. Sci. Comput. 30(5): 2302-2318 (2008) - 2007
- [j14]Jurjen Duintjer Tebbens, Miroslav Tuma:
Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems. SIAM J. Sci. Comput. 29(5): 1918-1941 (2007) - [c5]Jurjen Duintjer Tebbens, Miroslav Tuma:
Improving Triangular Preconditioner Updates for Nonsymmetric Linear Systems. LSSC 2007: 737-744 - 2003
- [j13]Michele Benzi, Miroslav Tuma:
A robust incomplete factorization preconditioner for positive definite matrices. Numer. Linear Algebra Appl. 10(5-6): 385-400 (2003) - [j12]Jane K. Cullum, Keith Johnson, Miroslav Tuma:
Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms. Numer. Linear Algebra Appl. 10(5-6): 445-465 (2003) - [j11]Michele Benzi, Miroslav Tuma:
A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems. SIAM J. Sci. Comput. 25(2): 499-512 (2003) - 2002
- [j10]Miroslav Tuma:
A Note on the LDLT Decomposition of Matrices from Saddle-Point Problems. SIAM J. Matrix Anal. Appl. 23(4): 903-915 (2002) - 2001
- [c4]Jirí Maryska, Miroslav Rozlozník, Miroslav Tuma:
Primal vs. Dual Variable Approach for Mixed-Hybrid Finite Element Approximation of the Potential Fluid Flow Problem in Porous Media. LSSC 2001: 417-424 - 2000
- [j9]Michele Benzi, Miroslav Tuma:
Orderings for Factorized Sparse Approximate Inverse Preconditioners. SIAM J. Sci. Comput. 21(5): 1851-1868 (2000) - [j8]Jirí Maryska, Miroslav Rozlozník, Miroslav Tuma:
Schur Complement Systems in the Mixed-Hybrid Finite Element Approximation of the Potential Fluid Flow Problem. SIAM J. Sci. Comput. 22(2): 704-723 (2000) - [j7]Michele Benzi, Jane Cullum, Miroslav Tuma:
Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method. SIAM J. Sci. Comput. 22(4): 1318-1332 (2000) - [j6]Michele Benzi, John C. Haws, Miroslav Tuma:
Preconditioning Highly Indefinite and Nonsymmetric Matrices. SIAM J. Sci. Comput. 22(4): 1333-1353 (2000)
1990 – 1999
- 1999
- [c3]Michele Benzi, José Marín, Miroslav Tuma:
Parallel Preconditioning with Factorized Sparse Approximate Inverses. PP 1999 - 1998
- [j5]Michele Benzi, Miroslav Tuma:
A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems. SIAM J. Sci. Comput. 19(3): 968-994 (1998) - 1996
- [j4]Jirí Maryska, Miroslav Rozlozník, Miroslav Tuma:
The Potential Fluid Flow Problem and the Convergence Rate of the Minimal Residual Method. Numer. Linear Algebra Appl. 3(6): 525-542 (1996) - [j3]Michele Benzi, Carl Dean Meyer, Miroslav Tuma:
A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method. SIAM J. Sci. Comput. 17(5): 1135-1149 (1996) - [c2]Miroslav Rozlozník, Zdenek Strakos, Miroslav Tuma:
On the Role of Orthogonality in the GMRES Method. SOFSEM 1996: 409-416 - 1995
- [c1]Miroslav Tuma, Miroslav Rozlozník:
On the Efficiency of Superscalar and Vector Computer for some Problems in Scientif Computing. SOFSEM 1995: 481-486 - 1991
- [j2]Miroslav Tuma:
A quadratic programming algorithm for large and sparse problems. Kybernetika 27(2): 155-167 (1991)
1980 – 1989
- 1985
- [j1]Jan Reiterman, Vojtech Rödl, Edita Sinajová, Miroslav Tuma:
Threshold hypergraphs. Discret. Math. 54(2): 193-200 (1985)
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-10-04 20:59 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:
