Adaptive BEM with inexact PCG solver yields almost optimal computational costs
arXiv:1806.00313 · doi:10.1007/s00211-018-1011-1
Abstract
We consider the preconditioned conjugate gradient method (PCG) with optimal preconditioner in the frame of the boundary element method (BEM) for elliptic first-kind integral equations. Our adaptive algorithm steers the termination of PCG as well as the local mesh-refinement. Besides convergence with optimal algebraic rates, we also prove almost optimal computational complexity. In particular, we provide an additive Schwarz preconditioner which can be computed in linear complexity and which is optimal in the sense that the condition numbers of the preconditioned systems are uniformly bounded. As model problem serves the 2D or 3D Laplace operator and the associated weakly-singular integral equation with energy space . The main results also hold for the hyper-singular integral equation with energy space .
References in corpus (9)
- Axioms of Adaptivity
- Adaptive FEM with optimal convergence rates for a certain class of non-symmetric and possibly non-linear problems
- On 2D Newest Vertex Bisection: Optimality of Mesh-Closure and H1-Stability of L2-Projection
- Adaptive FEM with coarse initial mesh guarantees optimal convergence rates for compactly perturbed elliptic problems
- Rate optimal adaptive FEM with inexact solver for nonlinear operators
- Local inverse estimates for non-local boundary integral operators
- Optimal preconditioning for the symmetric and non-symmetric coupling of adaptive finite elements and boundary elements
- Efficient additive Schwarz preconditioning for hypersingular integral equations on locally refined triangulations
- Optimal additive Schwarz methods for the -BEM: the hypersingular integral operator in 3D on locally refined meshes
Cited by in corpus (11)
- Mathematical foundations of adaptive isogeometric analysis
- Dörfler marking with minimal cardinality is a linear complexity problem
- Rate optimality of adaptive finite element methods with respect to the overall computational costs
- Adaptive BEM with optimal convergence rates for the Helmholtz equation
- A short note on plain convergence of adaptive least-squares finite element methods
- Adaptive IGAFEM with optimal convergence rates: T-splines
- Adaptive boundary element methods for the computation of the electrostatic capacity on complex polyhedra
- Uniform preconditioners of linear complexity for problems of negative order
- Optimal additive Schwarz preconditioning for adaptive 2D IGA boundary element methods
- Adaptive Uzawa algorithm for the Stokes equation
- Optimal quasi-diagonal preconditioners for pseudodifferential operators of order minus two