The convergence of Glowinski's algorithm for elliptic problems
condition numberconvergencenon-overlapping domain decomposition algorithmnumerical experimentsparallel computationpreconditioned conjugate gradient methodtrace average operator
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) Parallel numerical computation (65Y05)
A theoretical analysis of a non-overlapping domain decomposition algorithm proposed by \textit{J. F. Bourgat, R. Glowinski, P. le Tallec} and \textit{M. Vidrascu} [Proc. 2nd Int. Symp. on Domain Decomposition Methods, Los Angeles/Calif. 1988, 3-16 (1989; Zbl 0684.65094)] is presented. The algorithm can be implemented in parallel, and many numerical experiments have illustrated its efficiency. A proof for the algorithm's convergence and an estimation of the condition number of the preconditioned system can be found in this paper. The authors stop sequentially on the continuous and the discrete case in the two subdomains approach and on the discrete case, in many subdomains approach, and make an analysis of the convergence properties of the algorithm. In the last section an estimation of the condition number of the preconditioned system in the preconditioned conjugate gradient method is given. The theoretical results coincide with the numerical experiments known in advance.
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)
