scientific article; zbMATH DE number 4100481

MaRDI QIDQ3825995zbMATH OpenFDO

Authors Owe Axelsson, Ben Polman

Publication date 1989

zbMATH Keywords

algebraic substructuringblock matrix incomplete factorizationcomputational complexitycorrectordomain decompositionGauss-Seidel methodJacobi methodNumerical resultsparallel computerspreconditionerred-black blockstiffness matrix

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Recommendations

• The Construction of Preconditioners for Elliptic Problems by Substructuring. II
• Block preconditioning and domain decomposition methods. II
• The Construction of Preconditioners for Elliptic Problems by Substructuring. I
• Two-level algebraic domain decomposition preconditioners using Jacobi-Schwarz smoother and adaptive coarse grid corrections
• An Additive Matrix Preconditioning Method with Application for Domain Decomposition and Two-Level Matrix Partitionings

Cited in

(9)

• Block preconditioning and domain decomposition methods. II
• Multilevel preconditioners for elliptic problems by substructuring
• Graph coarsening: from scientific computing to machine learning
• Two-level algebraic domain decomposition preconditioners using Jacobi-Schwarz smoother and adaptive coarse grid corrections
• A Framework for Block ILU Factorizations Using Block-Size Reduction
• scientific article; zbMATH DE number 839243 (Why is no real title available?)
• A robust algebraic multilevel domain decomposition preconditioner for sparse symmetric positive definite matrices
• Smoothing and regularization with modified sparse approximate inverses
• A hybrid domain decomposition method based on aggregation

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 Q3825995)