A domain decomposition method using efficient interface-acting preconditioners

From MaRDI portal





This article is concerned with a domain decomposition method for symmetric elliptic problems on domains proposed by \textit{S. Blazy, W. Borchers}, and \textit{U. Dralle} [Notes Numer. Fluid Mech. 52, 305--321 (1996; Zbl 0877.76050)] under the name conjugate gradient boundary iteration (CGBI). This method is based on a decomposition of the computational into nonoverlapping subdomains. The author gives the theoretical background of this method for elliptic problems on domains with large aspect ratio. The question of how to discretize the subdomain preconditioner is studied. Methods based on the fast Fourier transform and on sparse band matrices are proposed. In order to get an impression of CGBI, the author gets a comparison of the condition number of CGBI to the preconditioned the finite element tearing and interconnecting method. Numerical results for CGBI applied to the Poisson equation on 2-128 subdomains are presented. The performance of the preconditioners, both for linear finite element solvers and for Chebyshev spectral solvers, is demonstrated.











This page was built for publication: A domain decomposition method using efficient interface-acting preconditioners

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