Vaidya's preconditioners: Implementation and experimental study

zbMATH Open1031.65064MaRDI QIDQ1407720FDOQ1407720

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

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

numerical examplespreconditioningiterative solversexperimental studysupport preconditioningsupport theorydiagonally-dominant symmetric matricesincomplete-Cholesky preconditionerslinear-equation solversmaximum-spanning trees

Mathematics Subject Classification ID

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

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

(4)

• TAUCS
• A comparison of preconditioning strategies
• Modification of Karmarkar's projective scaling algorithm
• Preconditioning techniques for large linear systems: A survey

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)