Efficient Variants of the Vertex Space Domain Decomposition Algorithm

DOI10.1137/0915082zbMath0861.65106DBLPjournals/siamsc/ChanMS94OpenAlexW2016448996WikidataQ57397411 ScholiaQ57397411MaRDI QIDQ4316310

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

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

performanceconvergencenumerical examplesSchur complementdomain decompositionvertex spaceblock Jacobi-type preconditionerinterface probevertex space algorithm

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

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