The construction of preconditioners for elliptic problems by substructuring. I
Mathematics of Computation
Efficient preconditioning for the p-version finite element method in two dimensions
SIAM Journal on Numerical Analysis
Domain decomposition algorithms with small overlap
SIAM Journal on Scientific Computing
Schwarz analysis of iterative substructuring algorithms for elliptic problems in three dimensions
SIAM Journal on Numerical Analysis - Special issue: the articles in this issue are dedicated to Seymour V. Parter
SIAM Journal on Numerical Analysis
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
SIAM Journal on Scientific Computing
Additive Schwarz Methods for the h-p Version of the Finite Element Method in Two Dimensions
SIAM Journal on Scientific Computing
An Additive Schwarz Method for the h-b Version of the Finite Element Method in Three Dimensions
SIAM Journal on Numerical Analysis
Multilevel additive Schwarz method for the h-p version of the Galerkin boundary element method
Mathematics of Computation
Iterative Substructuring for Hypersingular Integral Equations in $\Bbb R^3$
SIAM Journal on Scientific Computing
SIAM Journal on Numerical Analysis
Multiplicative Schwarz Algorithms for the Galerkin Boundary Element Method
SIAM Journal on Numerical Analysis
International Journal of Computer Mathematics
Hi-index | 0.00 |
We study two-level additive Schwarz preconditioners for the h-p version of the Galerkin boundary element method when used to solve hypersingular integral equations of the first kind, which arise from the Neumann problems for the Laplacian in two dimensions. Overlapping and non-overlapping methods are considered. We prove that the non-overlapping preconditioner yields a system of equations having a condition number bounded by c(1 + log p)2 maxi + logHi/hi) where Hi is the length of the i-th subdomain, hi is the maximum length of the elements in this subdomain, and p is the maximum polynomial degree used. For the overlapping method, we prove that the condition number is bounded by c(l + log H/z (I + logp)2 where z is the size of the overlap and H = maxi Hi. We also discuss the use of the non-overlapping method when the mesh is geometrically graded. The condition number in that case is bounded by c log2 M, where M is the degrees of freedom.