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.     

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.     

Superconvergence of piecewise polynomial Galerkin approximations,for Fredholm integral equations of the second kind

Summary Piecewise polynomial Galerkin approximations for Fredholm integral equations of the second kind are shown to posses superconvergence properties in some circumstances.     

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.     

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.     

Adaptive boundary element methods for strongly elliptic integral equations

Summary Integral operators are nonlocal operators. The operators defined in boundary integral equations to elliptic boundary value problems, however, are pseudo-differential operators on the boundary and, therefore, provide additional pseudolocal properties. These allow the successful application of adaptive procedures to some boundary element methods. In this paper we analyze these methods for general strongly elliptic integral equations and obtain a-posteriori error estimates for boundary element solutions. We also apply these methods to nodal collocation with odd degree splines. Some numerical examples show that these adaptive procedures are reliable and effective.This work was carried out while Dr. De-hao Yu was an Alexander-von-Humboldt-Stiftung research fellow at the University of Stuttgart in 1987, 1988     

Stability of a spline collocation method for strongly elliptic multidimensional singular integral equations

Summary We consider a spline collocation method for strongly elliptic zero order pseudodifferential equationsp _gw Au=f on a cube =(0, 1) ^m . Utilizing multilinear spline functions which are zero at the boundary we collocate at the meshpoints inside . For classical strongly elliptic translation invariant pseudodifferential operators, we verify the stability of the considered collocation method inL ²(). Afterwards, form2 and a right hand sidefH ⁸(),s>m/2, we prove an asymptotic convergence estimate.The author has been supported by a grant of Deutsche Forschungsgemeinschaft under grant number Ko 634/32-1     

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 convergence of the Galerkin method for nonsmooth solutions of integral equations

Summary It is shown that the stability region of the Galerkin method includes solutions not lying in the conventional energy space. Optimal order error estimates for these nonsmooth solutions are derived. The new result is compared with the classical statement by means of the basic potential problem.     

On parameters influencing the stability of quadrature methods for singular integral equations with conjugation

In this paper, we study an approximation method for solving singular integral equations with conjugation on an open arc. The stability of the method depends on the invertibility of certain operators which belong to well-known algebras. We investigate properties of these operators and show how to choose the parameters of the approximation method so that the Fredholm indices of the operators mentioned become equal to zero.     

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.     

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.     

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.     

Asymptotic expansions for multistep methods applied to nonlinear Volterra integral equations of the second kind

Summary This paper deals with linear multistep methods applied to nonlinear, nonsingular Volterra integral equations of the second kind. Analogously to the theory of W.B. Gragg, the existence of asymptotic expansions in the stepsizeh is proved. Under certain conditions only even powers ofh occur. As a special case, the midpoint rule is treated, a short numerical example for the applicability to extrapolation techniques is given.     

Analysis of general quadrature methods for integral equations of the second kind

Summary This paper is concerned with a class of approximation methods for integral equations of the form , wherea andb are finite,f andy are continuous and the kernelk may be weakly singular. The methods are characterized by approximate equations of the form ; such methods include the Nyström method and a variety of product-integration methods. A general convergence theory is developed for methods of this type. In suitable cases it has the feature that its application to a specific method depends only on a knowledge of convergence properties of the underlying quadrature rule. The theory is used to deduce convergence results, some of them new, for a number of specific methods.Work supported by the U.S. Department of Energy     

Error bounds and estimates for eigenvalues of integral equations

Summary Approximate solutions of the linear integral equation eigenvalue problem can be obtained by the replacement of the integral by a numerical quadrature formula and then collocation to obtain a linear algebraic eigenvalue problem. This method is often called the Nyström method and its convergence was discussed in [7]. In this paper computable error bounds and dominant error terms are derived for the approximation of simple eigenvalues of nonsymmetric kernels.     

On monotone Abel-Volterra integral equations on the half line

Summary In this paper we reanalyze the trapezoidal method for the solution of nonlinear Abel-Volterra integral equations on the half line. We prove the convergence of the method in the uniform norm, provided the nonlinearity is Lipschitz-continuous and strictly monotone.Research supported in part by the United States Army under contracts DAAG29-83-K-0109 and DAAG 29-85-G-0009     

Error bounds and estimates for eigenvalues of integral equations. II

Summary In a previous paper computable error bounds and dominant error terms are derived for the approximation of simple eigenvalues of non-symmetric integral equations. In this note an alternative analysis is presented leading to equivalent dominant error terms with error bounds which are quicker to calculate than those derived previously.     

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     

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.