Incomplete block matrix factorization preconditioning methods. The ultimate answer?

DOI10.1016/0377-0427(85)90004-4zbMath0576.65020OpenAlexW1989220483MaRDI QIDQ1064733

Owe Axelsson

Publication date: 1985

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(85)90004-4

zbMATH Keywords

surveycomparisonparallel computingmultilevel methodslarge sparse linear systemspreconditioning methodsincomplete block matrix factorizations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (15)

On the robustness of ILU smoothers on triangular grids ⋮ Analysis of incomplete matrix factorizations as multigrid smoothers for vector and parallel computers ⋮ Approximate inverses of multidiagonal matrices and application to the block PCG method ⋮ Vectorizable preconditioners for elliptic difference equations in three space dimensions ⋮ A Matrix-Free ILU Realization Based on Surrogates ⋮ Accuracy of preconditioned CG-type methods for least squares problems. ⋮ On incomplete block factorization methods of generalized SSOR type for \(H\)-matrices ⋮ Incomplete block factorization methods for complex-structure matrices ⋮ Incomplete block-matrix factorization iterative methods for convection- diffusion problems ⋮ Krylov methods for solving models with forward-looking variables ⋮ An algorithm for solving sparse nonlinear least squares problems ⋮ Revisiting the BE SBS algorithm and applying it to solve torsion problems in composite bars: robustness and efficiency study ⋮ Algorithmic bombardment for the iterative solution of linear systems: A poly-iterative approach ⋮ Block incomplete factorization preconditioners for a symmetric block-tridiagonal \(M\)-matrix ⋮ A survey of preconditioned iterative methods for linear systems of algebraic equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The block preconditioned conjugate gradient method on vector computers
• On some versions of incomplete block-matrix factorization iterative methods
• On the eigenvalue distribution of a class of preconditioning methods
• Hierarchical bases of finite-element spaces in the discretization of nonsymmetric elliptic boundary value problems
• A general incomplete block-matrix factorization method
• Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
• Block Preconditioning for the Conjugate Gradient Method
• Decay Rates for Inverses of Band Matrices
• Vector Computations for Sparse Linear Systems
• On Sparse Block Factorization Iterative Methods
• On computing certain elements of the inverse of a sparse matrix
• 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: Incomplete block matrix factorization preconditioning methods. The ultimate answer?