Stefan Schimanko

2papers

2 Papers

NAJun 1, 2018
Adaptive BEM with inexact PCG solver yields almost optimal computational costs

Thomas Führer, Alexander Haberl, Dirk Praetorius et al.

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 $\widetilde{H}^{-1/2}(Γ)$. The main results also hold for the hyper-singular integral equation with energy space $H^{1/2}(Γ)$.

NAMar 21, 2019
Optimal additive Schwarz preconditioning for adaptive 2D IGA boundary element methods

Thomas Führer, Gregor Gantner, Dirk Praetorius et al.

We define and analyze (local) multilevel diagonal preconditioners for isogeometric boundary elements on locally refined meshes in two dimensions. Hypersingular and weakly-singular integral equations are considered. We prove that the condition number of the preconditioned systems of linear equations is independent of the mesh-size and the refinement level. Therefore, the computational complexity, when using appropriate iterative solvers, is optimal. Our analysis is carried out for closed and open boundaries and numerical examples confirm our theoretical results.