Approximate Schur Complement Preconditioners on Serial and Parallel Computers

DOI10.1137/0910037zbMath0678.65018OpenAlexW2029033269MaRDI QIDQ3834949

Howard C. Elman

Publication date: 1989

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0910037

zbMATH Keywords

hypercubecomputational complexitypreconditioningparallel algorithmsNumerical experimentsSchur complement methodnine-point operatorOperational countsparallel multiprocessor implementation

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (4)

Domain decomposition preconditioners for the conjugate gradient method ⋮ A multiscale Darcy-Brinkman model for fluid flow in fractured porous media ⋮ A grid-based multilevel incomplete LU factorization preconditioning technique for general sparse matrices ⋮ Multigrid treatment and robustness enhancement for factored sparse approximate inverse preconditioning

This page was built for publication: Approximate Schur Complement Preconditioners on Serial and Parallel Computers