Adaptive BEM with inexact PCG solver yields almost optimal computational costs
From MaRDI portal
Publication:670306
DOI10.1007/S00211-018-1011-1zbMATH Open1412.65233arXiv1806.00313OpenAlexW2806443178MaRDI QIDQ670306FDOQ670306
Authors: Thomas Führer, Alexander Haberl, Dirk Praetorius, Stefan Schimanko 
Publication date: 18 March 2019
Published in: Numerische Mathematik (Search for Journal in Brave)
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 .
Full work available at URL: https://arxiv.org/abs/1806.00313
Recommendations
- Optimal additive Schwarz preconditioning for adaptive 2D IGA boundary element methods
- Quasi-optimal convergence rate for an adaptive boundary element method
- Optimal additive Schwarz methods for the \(hp\)-BEM: the hypersingular integral operator in 3D on locally refined meshes
- Adaptive BEM with optimal convergence rates for the Helmholtz equation
- Adaptive BEM for elliptic PDE systems. I: Abstract framework, for weakly-singular integral equations
Laplace operatorboundary element methodcondition numberspreconditioned conjugate gradient methodweakly singular integral equationadditive Schwarz preconditioner
Complexity and performance of numerical algorithms (65Y20) Preconditioners for iterative methods (65F08) Numerical methods for integral equations (65R20) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Boundary element methods for boundary value problems involving PDEs (65N38) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Rate of convergence, degree of approximation (41A25) Integral equations with kernels of Cauchy type (45E05)
Cites Work
- HILBERT -- a MATLAB implementation of adaptive 2D-BEM. \(\underline {\text H}\)ilbert \(\underline {\text I}\)s a \(\underline {\text L}\)ovely \(\underline {\text B}\)oundary \(\underline {\text E}\)lement \(\underline {\text R}\)esearch \(\underline {\text T}\)ool
- Title not available (Why is that?)
- Data Oscillation and Convergence of Adaptive FEM
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Conditioning of Boundary Element Equations on Locally Refined Meshes and Preconditioning by Diagonal Scaling
- Hierarchical matrices: algorithms and analysis
- A Convergent Adaptive Algorithm for Poisson’s Equation
- Adaptive finite element methods with convergence rates
- Optimality of a standard adaptive finite element method
- An adaptive finite element eigenvalue solver of asymptotic quasi-optimal computational complexity
- Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
- The completion of locally refined simplicial partitions created by bisection
- Local multigrid in \(\boldsymbol{H} (\mathbf{curl})\)
- Title not available (Why is that?)
- Residual-based a posteriori error estimate for hypersingular equation on surfaces
- Adaptive boundary element methods with convergence rates
- Quasi-optimal convergence rate for an adaptive boundary element method
- Axioms of adaptivity
- On 2D newest vertex bisection: optimality of mesh-closure and \(H ^{1}\)-stability of \(L _{2}\)-projection
- A Posteriori Error Estimates for Boundary Element Methods
- An a posteriori error estimate for a first-kind integral equation
- A posteriori error estimate and h-adaptive algorithm on surfaces from Symm's integral equation
- Quasi-optimal convergence rates for adaptive boundary element methods with data approximation. I: Weakly-singular integral equation
- Efficiency and Optimality of Some Weighted-Residual Error Estimator for Adaptive 2D Boundary Element Methods
- Averaging Techniques for the Effective Numerical Solution of Symm's Integral Equation of the First Kind
- Adaptive FEM with optimal convergence rates for a certain class of nonsymmetric and possibly nonlinear problems
- Local inverse estimates for non-local boundary integral operators
- Solving Boundary Integral Problems with BEM++
- Interplay between discretization and algebraic computation in adaptive numerical solution of elliptic PDE problems
- Stopping criteria for adaptive finite element solvers
- Discrete extension operators for mixed finite element spaces on locally refined meshes
- Quasi-optimal convergence rates for adaptive boundary element methods with data approximation. II: Hyper-singular integral equation
- Optimal multilevel methods for \(H\)(grad), \(H\)(curl), and \(H\)(div) systems on graded and unstructured grids
- Stable multilevel splittings of boundary edge element spaces
- Optimal additive Schwarz methods for the \(hp\)-BEM: the hypersingular integral operator in 3D on locally refined meshes
- Adaptive FEM with coarse initial mesh guarantees optimal convergence rates for compactly perturbed elliptic problems
- Optimal additive Schwarz preconditioning for hypersingular integral equations on locally refined triangulations
- Rate optimal adaptive FEM with inexact solver for nonlinear operators
- Uniform Convergence of Adaptive Multigrid Methods for Elliptic Problems and Maxwell's Equations
- Uniform preconditioners for problems of negative order
- Optimal preconditioning for the symmetric and nonsymmetric coupling of adaptive finite elements and boundary elements
- Extension by zero in discrete trace spaces: inverse estimates
Cited In (12)
- Dörfler marking with minimal cardinality is a linear complexity problem
- Adaptive boundary element methods for the computation of the electrostatic capacity on complex polyhedra
- Adaptive Uzawa algorithm for the Stokes equation
- Adaptive BEM with optimal convergence rates for the Helmholtz equation
- Uniform preconditioners of linear complexity for problems of negative order
- Multilevel decompositions and norms for negative order Sobolev spaces
- A short note on plain convergence of adaptive least-squares finite element methods
- Optimal quasi-diagonal preconditioners for pseudodifferential operators of order minus two
- Optimal additive Schwarz preconditioning for adaptive 2D IGA boundary element methods
- An optimal adaptive Fictitious Domain Method
- Adaptive IGAFEM with optimal convergence rates: T-splines
- Rate optimality of adaptive finite element methods with respect to overall computational costs
Uses Software
This page was built for publication: Adaptive BEM with inexact PCG solver yields almost optimal computational costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670306)
