An efficient implementation for SSOR and incomplete factorization preconditionings

DOI10.1016/0168-9274(85)90033-9zbMath0619.65020OpenAlexW2021453599MaRDI QIDQ1089727

Craig C. Douglas, Randolph E. Bank

Publication date: 1985

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(85)90033-9

zbMATH Keywords

successive overrelaxationSSORsymmetric Gauss-Seidelincomplete factorization preconditionersnonsymmetric matricesDupont-Kendall-RachfordICCG(0)MICG(0)

Mathematics Subject Classification ID

Factorization of matrices (15A23) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Cites Work

• Unnamed Item
• Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
• Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• A class of first order factorization methods
• An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
• A generalized SSOR method

This page was built for publication: An efficient implementation for SSOR and incomplete factorization preconditionings