Algorithm 740: Fortran subroutines to compute improved incomplete Cholesky factorizations

DOI10.1145/200979.200986zbMath0886.65023OpenAlexW2066284316WikidataQ113310442 ScholiaQ113310442MaRDI QIDQ4371589

Mark T. Jones, Paul E. Plassmann

Publication date: 26 January 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1995-21/

zbMATH Keywords

conjugate gradient algorithmincomplete Cholesky factorization

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Related Items (4)

ITERATIVE SOLUTION OF SHIFTED POSITIVE-DEFINITE LINEAR SYSTEMS ARISING IN A NUMERICAL METHOD FOR THE HEAT EQUATION BASED ON LAPLACE TRANSFORMATION AND QUADRATURE ⋮ HSL_MI28 ⋮ Algorithm 740 ⋮ Preconditioning techniques for large linear systems: A survey

This page was built for publication: Algorithm 740: Fortran subroutines to compute improved incomplete Cholesky factorizations