Miroslav Tůma

Miroslav Tůma

Auto-generated profile, based on publicly available information

Miroslav Tůma

Department of Numerical Mathematics Faculty of Mathematics and Physics Charles University Czech Republic

Research Focus & Metrics

Academic Career Length

42Years (1985-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 1996 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
MBMichele Benzi
Michele Benzi
CMCarl D. Meyer
Carl D. Meyer
MTMiroslav Tůma
Miroslav Tůma
A method for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix A is developed, and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient calculations. It is proved that in exact arithmetic the preconditioner is well defined if A is an H-matrix. The results of numerical experiments are presented.

1 May 1998 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
MBMichele Benzi
Michele Benzi
MTMiroslav Tuma
Miroslav Tuma
This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A procedure for computing an incomplete factorization of the inverse of a nonsymmetric matrix is developed, and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient--type methods. Some theoretical properties of the preconditioner are discussed, and numerical experiments on test matrices from the Harwell--Boeing collection and from Tim Davis's collection are presented. Our results indicate that the new preconditioner is cheaper to construct than other approximate inverse preconditioners. Furthermore, the new technique insures convergence rates of the preconditioned iteration which are comparable with those obtained with standard implicit preconditioners.

1 June 1999 in Applied Numerical Mathematics
Verified
Journal Article
Closed access
MBMichele Benzi
Michele Benzi
MTMiroslav Tûma
Miroslav Tûma

1 January 2000 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
MBMichele Benzi
Michele Benzi
JCJane K. Cullum
Jane K. Cullum
MTMiroslav Tuma
Miroslav Tuma
We present a variant of the AINV factorized sparse approximate inverse algorithm which is applicable to any symmetric positive definite matrix. The new preconditioner is breakdown-free and, when used in conjunction with the conjugate gradient method, results in a reliable solver for highly ill-conditioned linear systems. We also investigate an alternative approach to a stable approximate inverse algorithm, based on the idea of diagonally compensated reduction of matrix entries. The results of numerical tests on challenging linear systems arising from finite element modeling of elasticity and diffusion problems are presented.

1 January 2000 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
MBMichele Benzi
Michele Benzi
JHJohn C. Haws
John C. Haws
MTMiroslav Tuma
Miroslav Tuma
Standard preconditioners, like incomplete factorizations, perform well when the coefficient matrix is diagonally dominant, but often fail on general sparse matrices. We experiment with nonsymmetric permutations and scalings aimed at placing large entries on the diagonal in the context of preconditioning for general sparse matrices. The permutations and scalings are those developed by Olschowka and Neumaier [Linear Algebra Appl., 240 (1996), pp. 131--151] and by Duff and Koster [SIAM J. Matrix Anal. Appl., 20 (1999), pp. 889--901; Tech. report Ral-Tr-99-030, Rutherford Appleton Laboratory, Chilton, UK, 1999]. We target highly indefinite, nonsymmetric problems that cause difficulties for preconditioned iterative solvers. Our numerical experiments indicate that the reliability and performance of preconditioned iterative solvers are greatly enhanced by such preprocessing.

7 May 2003 in Numerical Linear Algebra with Applications
Verified
Journal Article
Closed access
PDF file
MBMichele Benzi
Michele Benzi
MTMiroslav Tůma
Miroslav Tůma