The convergence of Glowinski's algorithm for elliptic problems

DOI10.1007/BF02012619zbMath0834.65113OpenAlexW2083765699MaRDI QIDQ1898890

Xiancheng Hu, Delin Chu

Publication date: 16 November 1995

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02012619

zbMATH Keywords

convergencenumerical experimentsparallel computationcondition numberpreconditioned conjugate gradient methodnon-overlapping domain decomposition algorithmtrace average operator

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) Parallel numerical computation (65Y05)

Cites Work

• To Overlap or Not to Overlap: A Note on a Domain Decomposition Method for Elliptic Problems
• The Construction of Preconditioners for Elliptic Problems by Substructuring. I

This page was built for publication: The convergence of Glowinski's algorithm for elliptic problems