Efficient Variants of the Vertex Space Domain Decomposition Algorithm

DOI10.1137/0915082MaRDI QIDQ4316310zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Tony F. Chan, Tarek P. Mathew, Jianping Shao

Publication date 19 May 1997

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

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

zbMATH Keywords

block Jacobi-type preconditionerconvergencedomain decompositioninterface probenumerical examplesperformanceSchur complementvertex spacevertex space algorithm

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) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• scientific article; zbMATH DE number 218064
• scientific article; zbMATH DE number 218269
• Preconditioned domain decomposition methods for non-self-adjoint elliptic problems

Cited in

(5)

• Preconditioned domain decomposition methods for non-self-adjoint elliptic problems
• scientific article; zbMATH DE number 736346 (Why is no real title available?)
• scientific article; zbMATH DE number 218064 (Why is no real title available?)
• scientific article; zbMATH DE number 218269 (Why is no real title available?)
• Preconditioned spectral multi-domain discretization of the incompressible Navier-Stokes equations

This page was built for publication: Efficient Variants of the Vertex Space Domain Decomposition Algorithm

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