An incomplete inverse as a preconditioner for the conjugate gradient method

DOI10.1016/0898-1221(93)90224-JzbMath0765.65041MaRDI QIDQ1203714

Jenn-Ching Luo

Publication date: 22 February 1993

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

conjugate gradient methodsuperconvergencepreconditionerincomplete decomposition

Mathematics Subject Classification ID

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

Related Items (4)

ILU preconditioning based on the FAPINV algorithm ⋮ Factored approximate inverse preconditioners with dynamic sparsity patterns ⋮ On the relation between the AINV and the FAPINV algorithms ⋮ A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices

Cites Work

• Unnamed Item
• Solution algorithms for nonlinear transient heat conduction analysis employing element-by-element iterative strategies
• A general approach to nonlinear FE compuations on shared-memory multiprocessors
• A note on parallel processing
• A new class of decomposition for symmetric systems
• Block Preconditioning for the Conjugate Gradient Method
• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
• Fictitious array techniques for storing and accessing a symmetric matrix
• A gradient computational procedure for the solution of large problems arising from the finite element discretization method

This page was built for publication: An incomplete inverse as a preconditioner for the conjugate gradient method