Miroslav Tuma

Orcid: 0000-0003-2808-6929

According to our database1, Miroslav Tuma authored at least 46 papers between 1985 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A note on incomplete Cholesky factorizations in half precision arithmetic.
CoRR, 2024

Avoiding breakdown in incomplete factorizations in low precision arithmetic.
CoRR, 2024

2023
Scalable Approximate NonSymmetric Autoencoder for Collaborative Filtering.
Proceedings of the 17th ACM Conference on Recommender Systems, 2023

2022
A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems.
ACM Trans. Math. Softw., 2022

A null-space approach for large-scale symmetric saddle point systems with a small and non zero (2, 2) block.
Numer. Algorithms, 2022

2021
Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows.
ACM Trans. Math. Softw., 2021

Solving large linear least squares with linear equality constraints.
CoRR, 2021

2019
Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems.
SIAM J. Sci. Comput., 2019

2018
The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology.
SIAM J. Sci. Comput., 2018

A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows.
Numer. Algorithms, 2018

Isogeometric analysis in electronic structure calculations.
Math. Comput. Simul., 2018

Convergence study of isogeometric analysis based on Bézier extraction in electronic structure calculations.
Appl. Math. Comput., 2018

2017
Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods.
SIAM J. Sci. Comput., 2017

Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners.
Numer. Linear Algebra Appl., 2017

An adaptive multilevel factorized sparse approximate inverse preconditioning.
Adv. Eng. Softw., 2017

2016
Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations.
SIAM J. Sci. Comput., 2016

Factorized Approximate Inverses with Adaptive Dropping.
SIAM J. Sci. Comput., 2016

2015
Approximate inverse preconditioners with adaptive dropping.
Adv. Eng. Softw., 2015

2014
HSL_MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code.
ACM Trans. Math. Softw., 2014

On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems.
SIAM J. Sci. Comput., 2014

On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization.
SIAM J. Sci. Comput., 2014

Preconditioned Iterative Methods for Solving Linear Least Squares Problems.
SIAM J. Sci. Comput., 2014

On Incremental Condition Estimators in the 2-Norm.
SIAM J. Matrix Anal. Appl., 2014

2010
Improved Balanced Incomplete Factorization.
SIAM J. Matrix Anal. Appl., 2010

Preconditioner updates for solving sequences of linear systems in matrix-free environment.
Numer. Linear Algebra Appl., 2010

2009
Factorization-Based Graph Repartitionings.
Proceedings of the Large-Scale Scientific Computing, 7th International Conference, 2009

2008
Balanced Incomplete Factorization.
SIAM J. Sci. Comput., 2008

2007
Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems.
SIAM J. Sci. Comput., 2007

Improving Triangular Preconditioner Updates for Nonsymmetric Linear Systems.
Proceedings of the Large-Scale Scientific Computing, 6th International Conference, 2007

2003
A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems.
SIAM J. Sci. Comput., 2003

Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms.
Numer. Linear Algebra Appl., 2003

A robust incomplete factorization preconditioner for positive definite matrices.
Numer. Linear Algebra Appl., 2003

2002
A Note on the <i>LDL<sup>T</sup></i> Decomposition of Matrices from Saddle-Point Problems.
SIAM J. Matrix Anal. Appl., 2002

2001
Primal vs. Dual Variable Approach for Mixed-Hybrid Finite Element Approximation of the Potential Fluid Flow Problem in Porous Media.
Proceedings of the Large-Scale Scientific Computing, Third International Conference, 2001

2000
Schur Complement Systems in the Mixed-Hybrid Finite Element Approximation of the Potential Fluid Flow Problem.
SIAM J. Sci. Comput., 2000

Orderings for Factorized Sparse Approximate Inverse Preconditioners.
SIAM J. Sci. Comput., 2000

Preconditioning Highly Indefinite and Nonsymmetric Matrices.
SIAM J. Sci. Comput., 2000

Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method.
SIAM J. Sci. Comput., 2000

1999
Parallel Preconditioning with Factorized Sparse Approximate Inverses.
Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999

1998
A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems.
SIAM J. Sci. Comput., 1998

1996
A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method.
SIAM J. Sci. Comput., 1996

The Potential Fluid Flow Problem and the Convergence Rate of the Minimal Residual Method.
Numer. Linear Algebra Appl., 1996

On the Role of Orthogonality in the GMRES Method.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

1995
On the Efficiency of Superscalar and Vector Computer for some Problems in Scientif Computing.
Proceedings of the SOFSEM '95, 22nd Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 23, 1995

1991
A quadratic programming algorithm for large and sparse problems.
Kybernetika, 1991

1985
Threshold hypergraphs.
Discret. Math., 1985


  Loading...