scientific article; zbMATH DE number 440648

MaRDI QIDQ3140807zbMATH OpenFDO

Authors Auke van der Ploeg

Publication date 5 December 1993

zbMATH Keywords

arbitrary sparsity patternsCGSTABconjugate gradients squared methodincomplete factorizationiterative methodspreconditioning

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

• Conjugate gradient methods and ILU preconditioning of non-symmetric matrix systems with arbitrary sparsity patterns
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula
• Efficient Solution of a Sparse Non-symmetric System of Linear Equations
• scientific article; zbMATH DE number 17716

Cited in

(7)

• How fast the Laplace equation was solved in 1995
• Iterative solution of linear systems in the 20th century
• Efficient and reliable iterative methods for linear systems
• Robust preconditioning of large, sparse, symmetric eigenvalue problems
• Nested grids ILU-decomposition (NGILU)
• Conjugate gradient methods and ILU preconditioning of non-symmetric matrix systems with arbitrary sparsity patterns
• Additive multilevel preconditioners based on bilinear interpolation, matrix-dependent geometric coarsening and algebraic multigrid coarsening for second-order elliptic PDEs

This page was built for publication:

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