Threshold ordering for preconditioning nonsymmetric problems

MaRDI QIDQ4251288zbMATH OpenFDO

Authors Michele Benzi, Hwajeong Choi, Daniel B. Szyld

Publication date 17 June 1999

zbMATH Keywords

elliptic equationsfinite difference methodincomplete factorizationsKrylov-based iterative methodsperformancepreconditioningssparse nonsymmetric linear systemsthreshold ordering

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Finite difference methods for boundary value problems involving PDEs (65N06)

Recommendations

• Extensions of Certain Graph-based Algorithms for Preconditioning
• The effect of orderings on sparse approximate inverse preconditioners for non-symmetric problems
• Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
• Preconditioning highly indefinite and nonsymmetric matrices

Cited in

(3)

• A class of asynchronous multisplitting two-stage iterations for large sparse block systems of weakly nonlinear equations
• Extensions of Certain Graph-based Algorithms for Preconditioning
• Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems

This page was built for publication: Threshold ordering for preconditioning nonsymmetric problems

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