The convergence of Glowinski's algorithm for elliptic problems

DOI10.1007/BF02012619MaRDI QIDQ1898890zbMATH OpenOpenAlexFDO

Authors Delin Chu, Xiancheng Hu

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 experimentscondition numberparallel computationpreconditioned conjugate gradient methodnon-overlapping domain decomposition algorithmtrace average operator

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 871299
• Analysis of a nonoverlapping domain decomposition method for elliptic partial differential equations
• scientific article; zbMATH DE number 1156752
• scientific article; zbMATH DE number 270063

Cites work

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

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

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