Duality estimates for the numerical solution of integral equations

Summary We formulate and prove Aubin-Nitsche-type duality estimates for the error of general projection methods. Examples of applications include collocation methods and augmented Galerkin methods for boundary integral equations on plane domains with corners and three-dimensional screen and crack problems. For some of these methods, we obtain higher order error estimates in negative norms in cases where previous formulations of the duality arguments were not applicable.     

Fast solution methods for fredholm integral equations of the second kind

Summary The main purpose of this paper is to describe a fast solution method for one-dimensional Fredholm integral equations of the second kind with a smooth kernel and a non-smooth right-hand side function. Let the integral equation be defined on the interval [–1, 1]. We discretize by a Nyström method with nodes {cos(j/N)} _j ^=0/N . This yields a linear system of algebraic equations with an (N+1)×(N+1) matrixA. GenerallyN has to be chosen fairly large in order to obtain an accurate approximate solution of the integral equation. We show by Fourier analysis thatA can be approximated well by , a low-rank modification of the identity matrix. ReplacingA by in the linear system of algebraic equations yields a new linear system of equations, whose elements, and whose solution , can be computed inO (N logN) arithmetic operations. If the kernel has two more derivatives than the right-hand side function, then is shown to converge optimally to the solution of the integral equation asN increases.We also consider iterative solution of the linear system of algebraic equations. The iterative schemes use bothA andÃ. They yield the solution inO (N ²) arithmetic operations under mild restrictions on the kernel and the right-hand side function.Finally, we discuss discretization by the Chebyshev-Galerkin method. The techniques developed for the Nyström method carry over to this discretization method, and we develop solution schemes that are faster than those previously presented in the literature. The schemes presented carry over in a straightforward manner to Fredholm integral equations of the second kind defined on a hypercube.     

Convergence analysis of discretization methods for nonlinear first kind Volterra integral equations

Summary An existence and uniqueness result is given for nonlinear Volterra integral equations of the first kind. This permits, by means of analogous discrete manipulations, a general convergence analysis for a wide class of discretization methods for nonlinear first kind Volterra integral equations to be presented. A concept of optimal consistency allows twosided error bounds to be derived.     

Numerical solution of integral equations,fast algorithms and Krein-Sobolev equation

Summary This paper contains a unified rigorous approach for the treatment of fast numerical algorithms for different classes of Fredholm integral equations of second kind. The Krein-Sobolev functional-differential nonlinear equation for the resolvent provides the ground for a unified approach. New results concerning the general analysis of the Krein-Sobolev equation and the convergence and stability of related numerical schemes are also presented.     

On Bateman's method for second kind integral equations

Summary Under suitable conditions, we prove the convergence of the Bateman method for integral equations defined over bounded domains inR ^d ,d1. The proof makes use of Hilbert space methods, and requires the integral operator to be non-negative definite. For one-dimensional integral equations over finite intervals, estimated rates of convergence are obtained which depend on the smoothness of the kernel, but are independent of the inhomogeneous term. In particular, for aC kernel andn reasonably spaced Bateman points, the convergence is shown to be faster than any power of 1/n. Numerical calculations support this result.     

Approximation of infinite delay and Volterra type equations

Summary We consider a class of infinite delay equations of neutral type which includes Volterrra type integral und integrodifferential equations. Using abstract approximation results (cf. Trotter-Kato-type) for strongly continuous semigroups we develop an approximation scheme which is based on approximation of the system state by Laguerre (and Legendre) polynomials. Numerical examples demonstrate the feasibility of the scheme and show infinite order convergence for smooth data.Supported in part by the Air Force Office of Scientific Research under Contracts AFORS-84-0398 and AFORS-85-0303 and the National Aeronautics and Space Administration under NASA Grant NAG-1-517 and by NSF under Grant UINT-8521208Supported in part by the Air Force Office of Scientific Research under Contract AFORS-84-0398 and in part by the Fonds zur Förderung der wissenschaftlichen Forschung, Austria, under project No. S3206     

Spline collocation for singular integro-differential equations over (0.1)

Summary This paper analyses the convergence of spline collocation methods for singular integro-differential equations over the interval (0.1). As trial functions we utilize smooth polynomial splines the degree of which coincides with the order of the equation. Depending on the choice of collocation points we obtain sufficient and even necessary conditions for the convergence in sobolev norms. We give asymptotic error estimates and some numerical results.     

On the fast matrix multiplication in the boundary element method by panel clustering

Summary The boundary element method (BEM) leads to a system of linear equations with a full matrix, while FEM yields sparse matrices. This fact seems to require much computational work for the definition of the matrix, for the solution of the system, and, in particular, for the matrix-vector multiplication, which always occurs as an elementary. In this paper a method for the approximate matrix-vector multiplication is described which requires much less arithmetical work. In addition, the storage requirements are strongly reduced.This paper reports results of a research project supported by the DFG (Schwerpunktprogramm Finite Approximationen in der Strömungsmechanik     

A quadrature-based approach to improving the collocation method

Summary The collocation method is a popular method for the approximate solution of boundary integral equations, but typically does not achieve the high order of convergence reached by the Galerkin method in appropriate negative norms. In this paper a quadrature-based method for improving upon the collocation method is proposed, and developed in detail for a particular case. That case involves operators with even symbol (such as the logarithmic potential) operating on 1-periodic functions; a smooth-spline trial space of odd degree, with constant mesh spacingh=1/n; and a quadrature rule with 2n points (where ann-point quadrature rule would be equivalent to the collocation method). In this setting it is shown that a special quadrature rule (which depends on the degree of the splines and the order of the operator) can yield a maximum order of convergence two powers ofh higher than the collocation method.     

Continuous time collocation methods for Volterra-Fredholm integral equations

Summary Integral equations of mixed Volterra-Fredholm type arise in various physical and biological problems. In the present paper we study continuous time collocation, time discretization and their global and discrete convergence properties.     

Multigrid methods for boundary integral equations

Summary Multigrid methods are applied for solving algebraic systems of equations that occur to the numerical treatment of boundary integral equations of the first and second kind. These methods, originally formulated for partial differential equations of elliptic type, combine relaxation schemes and coarse grid corrections. The choice of the relaxation scheme is found to be essential to attain a fast convergent iterative process. Theoretical investigations show that the presented relaxation scheme provides a multigrid algorithm of which the rate of convergence increases with the dimension of the finest grid. This is illustrated for the calculation of potential flow around an aerofoil.     

On the numerical resolution of the generalized airfoil equation with Possio kernel

Summary In this paper we consider the so-called generalized airfoil singular integral equation, with a smooth input function, and present ad hoc quadrature rules to compute efficiently the elements of collocation and Galerkin matrices.Work sponsored by the Italian Ministry of Education     

Backward differentiation type formulas for Volterra integral equations of the second kind

Summary Numerical integration formulas are discussed which are obtained by differentiation of the Volterra integral equation and by applying backward differentiation formulas to the resulting integro-differential equation. In particular, the stability of the method is investigated for a class of convolution kernels. The accuracy and stability behaviour of the method proposed in this paper is compared with that of (i) a block-implicit Runge-Kutta scheme, and (ii) the scheme obtained by applying directly a quadrature rule which is reducible to the backward differentiation formulas. The present method is particularly advantageous in the case of stiff Volterra integral equations.     

Sur une équation d'évolution intégro-différentielle singulière linéaire

Summary We show an existence and uniqueness result for a singular integro-differential evolution equation. A sensible choice of basis leads to an efficient numerical method.

     

A Nyström method for boundary integral equations in domains with corners

Summary We give a convergence and error analysis for a Nyström method on a graded mesh for the numerical solution of boundary integral equations for the harmonic Dirichlet problem in plane domains with corners.

Dedicated to Professor L. Collatz on the occassion of his 80th birthday     

Galerkin methods with splines for singular integral equations over (0, 1)

Summary In this paper a convergence analysis of Galerkin methods with splines for strongly elliptic singular integral equations over the interval (0, 1) is given. As trial functions we utilize smoothest polynomial splines on arbitrary meshes and continuous splines on special nonuniform partitions, multiplied by a weight function. Using inequalities of Gårding type for singular integral operators in weightedL ² spaces and the complete asymptotics of solutions at the endpoints, we provide error estimates in certain Sobolev norms.     

Natural Continuous Extensions of Runge-Kutta methods for Volterra integrodifferential equations

Summary In this paper we deal with a very general class of Runge-Kutta methods for the numerical solution of Volterra integrodifferential equations. Our main contribution is the development of the theory of Natural Continuous Extensions (NCEs), i.e. piecewice polynomial functions which interpolate the values given by the RK-method at the mesh points. The particular features of these NCEs allow us to construct tail approximations which are quite efficient since they require a minimal number of kernel evaluations.     

Superconvergence of collocation methods for Volterra and Abel integral equations of the second kind

Summary This paper deals with the question of the attainable order of convergence in the numerical solution of Volterra and Abel integral equations by collocation methods in certain piecewise polynomial spaces and which are based on suitable interpolatory quadrature for the resulting moment integrals. The use of a (nonlinear) variation of constants formula for the representation of the error function in terms of the defect allows for a unified treatment of equations with continuous and weakly singular kernels.     

On multilevel iterative methods for integral equations of the second kind and related problems

Summary We describe a unifying framework for multigrid methods and projection-iterative methods for integral equations of the second kind, and for the iterative aggregation method for solving input-output relations. The methods are formulated as iterations combined with a defect correction in a subspace. Convergence proofs use contraction arguments and thus involve the nonlinear case automatically. Some new results are presented.     

On spline Galerkin methods for singular integral equations with piecewise continuous coefficients

Summary This article analizes the convergence of the Galerkin method with polynomial splines on arbitrary meshes for systems of singular integral equations with piecewise continuous coefficients inL ² on closed or open Ljapunov curves. It is proved that this method converges if and, for scalar equations and equidistant partitions, only if the integral operator is strongly elliptic (in some generalized sense). Using the complete asymptotics of the solution, we provide error estimates for equidistant and for special nonuni-form partitions.