An iterative solution method for Schur complement systems with inexact inner solver

MaRDI QIDQ2751290zbMATH OpenFDO

Authors Owe Axelsson, M. Neytcheva

Publication date 21 October 2001

zbMATH Keywords

algorithmcomputational complexitydomain decompositionelimination strategyelliptic equationsfinite elementiterative solution methodparallel computationpreconditioningSchur complement systems

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to partial differential equations (35-04) Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• scientific article; zbMATH DE number 1766811
• On the Conjugate Gradient Solution of the Schur Complement System Obtained from Domain Decomposition
• scientific article; zbMATH DE number 4104319
• An Optimal Parallel Nonoverlapping Domain Decomposition Iterative Procedure
• scientific article; zbMATH DE number 2247848

Cited in

(5)

• Equivalent operator preconditioning for elliptic problems
• scientific article; zbMATH DE number 1556143 (Why is no real title available?)
• scientific article; zbMATH DE number 2152735 (Why is no real title available?)
• Preconditioning methods for linear systems arising in constrained optimization problems
• Dirichlet degrees of freedom need not be eliminated

This page was built for publication: An iterative solution method for Schur complement systems with inexact inner solver

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