An Empirical Analysis of the Performance of Preconditioners for SPD Systems

DOI10.1145/2331130.2331132zbMATH Open1365.65076OpenAlexW2030439496WikidataQ113310377 ScholiaQ113310377MaRDI QIDQ2989166FDOQ2989166

Author name not available (Why is that?)

Publication date: 19 May 2017

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

Full work available at URL: https://doi.org/10.1145/2331130.2331132

Recommendations

• Numerical performance of preconditioning techniques for the solution of complex sparse linear systems
• A numerical study of optimized sparse preconditioners
• Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
• On SPD-preconditioned iterative methods applied to a stabilized Galerkin method
• scientific article
• Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
• An efficient parallel implementation of the MSPAI preconditioner
• Numerical comparison of preconditionings for large sparse finite element problems
• The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems

zbMATH Keywords

iterative solverspreconditionersnumerical softwaresparse linear systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)

Cited In (3)

• Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition
• HSL_MI28
• Using Performance Profiles to Evaluate Preconditioners for Iterative Methods

This page was built for publication: An Empirical Analysis of the Performance of Preconditioners for SPD Systems

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