Two-level methods for the single layer potential in ℝ3

We consider weakly singular integral equations of the first kind on open surface pieces Γ in ℝ³. To obtain approximate solutions we use theh-version Galerkin boundary element method. Furthermore we introduce two-level additive Schwarz operators for non-overlapping domain decompositions of Γ and we estimate the conditions numbers of these operators with respect to the mesh size. Based on these operators we derive an a posteriori error estimate for the difference between the exact solution and the Galerkin solution. The estimate also involves the error which comes from an approximate solution of the Galerkin equations. For uniform meshes and under the assumption of a saturation condition we show reliability and efficiency of our estimate. Based on this estimate we introduce an adaptive multilevel algorithm with easily computable local error indicators which allows direction control of the local refinements. The theoretical results are illustrated by numerical examples for plane and curved surfaces. Supported by the German Research Foundation (DFG) under grant Ste 238/25-9.     

hp-adaptive Two-Level Methods for Boundary Integral Equations on Curves

p - and hp-versions of the Galerkin boundary element method for hypersingular and weakly singular integral equations of the first kind on curves. We derive a-posteriori error estimates that are based on stable two-level decompositions of enriched ansatz spaces. The Galerkin errors are estimated by inverting local projection operators that are defined on small subspaces of the second level. A p-adaptive and two hp-adaptive algorithms are defined and numerical experiments confirm their efficiency. Received August 30, 2000; revised April 3, 2001     

A Note on the Energy Norm for a Singularly Perturbed Model Problem

This paper considers a singularly perturbed reaction diffusion problem. It is investigated whether adaptive approaches are successful to design robust solution procedures. A key ingredient is the a posteriori error estimator. Since robust and mathematically analysed error estimation is possible in the energy norm, the focus is on this choice of norm and its implications. The numerical performance for several model problems confirms that the proposed adaptive algorithm (in conjunction with an energy norm error estimator) produces optimal results. Hence the energy norm is suitable for the purpose considered here. The investigations also provide valuable justification for forthcoming research. Received October 25, 2001; revised July 12, 2002 Published online: October 24, 2002     

Galerkin methods and L2-error estimates for hyperbolic integro-differential equations

In this paper we shall study Galerkin approximations to the solution of linear second-order hyperbolic integro-differential equations. The continuous and Crank-Nicolson discrete time Galerkin procedures will be defined and optimal error estimates for these procedures are demonstrated by using a “non-classical” elliptic projection.     

A Numerical Method to Verify the Invertibility of Linear Elliptic Operators with Applications to Nonlinear Problems

In this paper, we propose a numerical method to verify the invertibility of second-order linear elliptic operators. By using the projection and the constructive a priori error estimates, the invertibility condition is formulated as a numerical inequality based upon the existing verification method originally developed by one of the authors. As a useful application of the result, we present a new verification method of solutions for nonlinear elliptic problems, which enables us to simplify the verification process. Several numerical examples that confirm the actual effectiveness of the method are presented.     

Superconvergence of a Mixed Covolume Method for Elliptic Problems

We consider a mixed covolume method for a system of first order partial differential equations resulting from the mixed formulation of a general self-adjoint elliptic problem with a variable full diffusion tensor. The system can be used to model the transport of a contaminant carried by a flow. We use the lowest order Raviart-Thomas mixed finite element space. We show the first order convergence in L ² norm and the superconvergence in certain discrete norms both for the pressure and velocity. Finally some numerical examples illustrating the error behavior of the scheme are provided. Supported by the National Natural Science Foundation of China under grant No. 10071044 and the Research Fund of Doctoral Program of High Education by State Education Ministry of China.     

Bounds for theN lowest eigenvalues of fourth-order boundary value problems

We describe a method for the calculation of theN lowest eigenvalues of fourth-order problems inH ₀ ² (Ω). In order to obtain small error bounds, we compute the defects inH ⁻²(Ω) and, to obtain a bound for the rest of the spectrum, we use a boundary homotopy method. As an example, we compute strict error bounds (using interval arithmetic to control rounding errors) for the 100 lowest eigenvalues of the clamped plate problem in the unit square. Applying symmetry properties, we prove the existence of double eigenvalues.     

Finite Volume Element Approximations of Nonlocal in Time One-Dimensional Flows in Porous Media

Various finite volume element schemes for parabolic integro-differential equations in 1-D are derived and studied. These types of equations arise in modeling reactive flows or material with memory effects. Our main goal is to develop a general framework for obtaining finite volume element approximations and to study the error analysis. We consider the lowest-order (linear and L-splines) finite volume elements, although higher-order volume elements can be considered as well under this framework. It is proved that finite volume element approximations are convergent with optimal order in H ¹-norms, suboptimal order in the L ²-norm and super-convergent order in a discrete H ¹-norm. Received August 3, 1998; revised October 11, 1999     

A Numerical Method to Verify the Elliptic Eigenvalue Problems Including a Uniqueness Property

We propose a numerical method to enclose the eigenvalues and eigenfunctions of second-order elliptic operators with local uniqueness. We numerically construct a set containing eigenpairs which satisfies the hypothesis of Banach's fixed point theorem in a certain Sobolev space by using a finite element approximation and constructive error estimates. We then prove the local uniqueness separately of eigenvalues and eigenfunctions. This local uniqueness assures the simplicity of the eigenvalue. Numerical examples are presented. Received: November 2, 1998; revised June 5, 1999     

A review of some a posteriori error estimates for adaptive finite element methods

Recently, the adaptive finite element methods have gained a very important position among numerical procedures for solving ordinary as well as partial differential equations arising from various technical applications. While the classical a posteriori error estimates are oriented to the use in h-methods the contemporary higher order hp-methods usually require new approaches in a posteriori error estimation.     

Uniform Pointwise Convergence of Difference Schemes for Convection-Diffusion Problems on Layer-Adapted Meshes

We consider two convection-diffusion boundary value problems in conservative form: for an ordinary differential equation and for a parabolic equation. Both the problems are discretized using a four-point second-order upwind space difference operator on arbitrary and layer-adapted space meshes. We give ɛ-uniform maximum norm error estimates O(N ⁻²ln² N(+τ)) and O(N ⁻²(+τ)), respectively, for the Shishkin and Bakhvalov space meshes, where N is the space meshnodes number, τ is the time meshinterval. The smoothness condition for the Bakhvalov mesh is replaced by a weaker condition. Received December 14, 1999; revised September 13, 2000     

Two-Level Additive Schwarz Preconditioners for the h-p Version of the Galerkin Boundary Element Method for 2-d Problems

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   where H _i is the length of the i-th subdomain, h _i 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   where δ is the size of the overlap and H=max _i H _i . 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 clog² M, where M is the degrees of freedom. Received October 27, 2000, revised March 26, 2001     

A Domain Decomposition Preconditioner for p-FEM Discretizations of Two-dimensional Elliptic Problems

In this paper, a uniformly elliptic second order boundary value problem in 2-D discretized by the p-version of the finite element method is considered. An inexact Dirichlet-Dirichlet domain decomposition pre-conditioner for the system of linear algebraic equations is investigated. Two solvers for the problem in the sub-domains, a pre-conditioner for the Schur-complement and an extension operator operating from the edges of the elements into the interior are proposed as ingredients for the inexact DD-pre-conditioner. In the main part of the paper, several numerical experiments on a parallel computer are given.     

The Fourier Finite-element Approximation of the Lamé Equations in Axisymmetric Domains with Edges

This paper is concerned with a priori error estimates and convergence analysis of the Fourier-finite-element solutions of the Neumann problem for the Lamé equations in axisymmetric domains with reentrant edges. The Fourier-FEM combines the approximating Fourier method with respect to the rotational angle using trigonometric polynomials of degree N (N→∞), with the finite element method on the plane meridian domain of with mesh size h (h→0) for approximating the Fourier coefficients. The asymptotic behavior of the solution near reentrant edges is described by singularity functions in non-tensor product form and treated numerically by means of finite element method on locally graded meshes. For the rate of convergence of the combined approximations in is proved to be of the order      

A Refined Finite Element Convergence Theory for Highly Indefinite Helmholtz Problems

It is well known that standard h-version finite element discretisations using lowest order elements for Helmholtz' equation suffer from the following stability condition: ``The mesh width h of the finite element mesh has to satisfy k <sup>2</sup> h≲1', where k denotes the wave number. This condition rules out the reliable numerical solution of Helmholtz equation in three dimensions for large wave numbers k≳50. In our paper, we will present a refined finite element theory for highly indefinite Helmholtz problems where the stability of the discretisation can be checked through an ``almost invariance' condition. As an application, we will consider a one-dimensional finite element space for the Helmholtz equation and apply our theory to prove stability under the weakened condition hk≲1 and optimal convergence estimates. Dedicated to Prof. Dr. Ivo Babuška on the occasion of his 80th birthday.     

Homogenization and Multigrid

For elliptic partial differential equations with periodically oscillating coefficients which may have large jumps, we prove robust convergence of a two-grid algorithm using a prolongation motivated by the theory of homogenization. The corresponding Galerkin operator on the coarse grid turns out to be a discretization of a diffusion operator with homogenized coefficients obtained by solving discrete cell problems. This two-grid method is then embedded inside a multi-grid cycle extending over both the fine and the coarse scale. Received August 10, 1999; revised July 28, 2000     

h-p Spectral Element Method for Elliptic Problems on Non-smooth Domains Using Parallel Computers

We propose a new h-p spectral element method to solve elliptic boundary value problems with mixed Neumann and Dirichlet boundary conditions on non-smooth domains. The method is shown to be exponentially accurate and asymptotically faster than the standard h-p finite element method. The spectral element functions are fully non-conforming for pure Dirichlet problems and conforming only at the vertices of the elements for mixed problems, and hence, the dimension of the resulting Schur complement matrix is quite small. The method is a least-squares collocation method and the resulting normal equations are solved using preconditioned conjugate gradient method with an almost optimal preconditioner. The algorithm is suitable for a distributed memory parallel computer. The numerical results of a number of model problems are presented, which confirm the theoretical estimates.     

Weighted Error Estimates for Finite Element Solutions of Variational Inequalities

In this note the studies begun in Blum and Suttmeier (1999) on adaptive finite element discretisations for nonlinear problems described by variational inequalities are continued. Similar to the concept proposed, e.g., in Becker and Rannacher (1996) for variational equalities, weighted a posteriori estimates for controlling arbitrary functionals of the discretisation error are constructed by using a duality argument. Numerical results for the obstacle problem demonstrate the derived error bounds to be reliable and, used for an adaptive grid refinement strategy, to produce economical meshes. Received September 6, 1999; revised February 8, 2000     

The Fourier-Nitsche-mortaring for elliptic problems with reentrant edges

The Fourier method is combined with the Nitsche-finite-element method (as a mortar method) and applied to the Dirichlet problem of the Poisson equation in three-dimensional axisymmetric domains with reentrant edges generating singularities. The approximating Fourier method yields a splitting of the 3D problem into a set of 2D problems on the meridian plane of the given domain. For solving the 2D problems bearing corner singularities, the Nitsche-finite-element method with non-matching meshes and mesh grading near reentrant corners is applied. Using the explicit representation of some singularity function of non-tensor product type, the rate of convergence of the Fourier-Nitsche-mortaring is estimated in some H ¹-like norm as well as in the L ₂-norm for weak regularity of the solution. Finally, some numerical results are presented.      

A Class of Smoothers for Saddle Point Problems

In this paper smoothing properties are shown for a class of iterative methods for saddle point problems with smoothing rates of the order 1/m, where m is the number of smoothing steps. This generalizes recent results by Braess and Sarazin, who could prove this rates for methods where, in the context of the Stokes problem, the pressure correction equation is solved exactly, which is not needed here. Received December 4, 1998; revised April 14, 2000