26 June 2014 in Numerische Mathematik
In this paper we present a finite element analysis for a Dirichlet boundary control problem where the Dirichlet control is considered in a convex closed subspace of the energy space \(H^{1/2}(\Gamma )\) . As an equivalent norm in \(H^{1/2}(\Gamma )\) we use the energy norm induced by the so-called Steklov–Poincaré operator which realizes the Dirichlet to Neumann map, and which can be implemented by using standard finite element methods. The presented stability and error analysis of the discretization of the resulting variational inequality is based on the mapping properties of the solution operators related to the primal and adjoint boundary value problems, and their finite element approximations. Some numerical results are given, which confirm on one hand the theoretical estimates, but on the other hand indicate the differences when modelling the control in \(L_2(\Gamma )\) .
1 April 2006 in IMA Journal of Numerical Analysis
A symmetric Galerkin boundary-element method is used for the solution of boundary-value problems with mixed boundary conditions of Dirichlet and Neumann type. As a model problem we consider the Laplace equation. When an iterative scheme is employed for solving the resulting linear system, the discrete boundary integral operators are realized by the fast multipole method. While the single-layer potential can be implemented straightforwardly as in the original algorithm for particle simulation, the double-layer potential and its adjoint operator are approximated by the application of normal derivatives to the multipole series for the kernel of the single-layer potential. The Galerkin discretization of the hypersingular integral operator is reduced to the single-layer potential via integration by parts. We finally present a corresponding stability and error analysis for these approximations by the fast multipole method of the boundary integral operators. It is shown that the use of the fast multipole method does not harm the optimal asymptotic convergence. The resulting linear system is solved by a GMRES scheme which is preconditioned by the use of hierarchical strategies as already employed in the fast multipole method. Our numerical examples are in agreement with the theoretical results.
1 September 2015 in Journal of Computational Physics
This is the final version of the article. It first appeared from Elsevier via http://dx.doi.org/10.1016/j.jcp.2015.05.01
24 November 2005 in Computing and Visualization in Science
1 January 2007 in SIAM Journal on Scientific Computing
The boundary element tearing and interconnecting (BETI) methods have recently been introduced as boundary element counterparts of the well‐established finite element tearing and interconnecting (FETI) methods. In this paper we present inexact data‐sparse versions of the BETI methods which avoid the elimination of the primal unknowns and dense matrices. However, instead of symmetric and positive definite systems, we finally have to solve twofold saddle point problems. The proposed iterative solvers and preconditioners result in almost optimal solvers whose complexity is proportional to the number of unknowns on the skeleton up to some polylogarithmical factor. Moreover, the solvers are robust with respect to large coefficient jumps.
6 July 2009 in International Journal for Numerical Methods in Engineering