Vaidya's preconditioners: Implementation and experimental study

MaRDI QIDQ1407720zbMATH OpenFDO

Authors Doron Chen, Sivan Toledo

Publication date 8 March 2004

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/123266, http://etna.mcs.kent.edu/vol.16.2003/pp30-49.dir/pp30-49.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

diagonally-dominant symmetric matricesexperimental studyincomplete-Cholesky preconditionersiterative solverslinear-equation solversmaximum-spanning treesnumerical examplespreconditioningsupport preconditioningsupport theory

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50)

Recommendations

• Support-Graph Preconditioners
• Maximum‐weight‐basis preconditioners
• An improved incomplete Cholesky factorization
• The Construction of Preconditioners for Elliptic Problems by Substructuring, III
• A comparative study of sparse approximate inverse preconditioners

Cited in

(6)

• TAUCS
• Preconditioning techniques for large linear systems: A survey
• A comparison of preconditioning strategies
• Support graph preconditioners for off-lattice cell-based models
• AC(k): robust solution of Laplacian equations by randomized approximate Cholesky factorization
• Modification of Karmarkar's projective scaling algorithm

This page was built for publication: Vaidya's preconditioners: Implementation and experimental study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407720)