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.     

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.     

Discretization of Volterra integral equations of the first kind (II)

Summary In the present paper integral equations of the first kind associated with strictly monotone Volterra integral operators are solved by projecting the exact solution of such an equation into the spaceS _m ^(–1) (Z _N ) of piecewise polynomials of degreem0, possessing jump discontinuities on the setZ _N of knots. Since the majority of direct one-step methods (including the higher-order block methods) result from particular discretizations of the moment integrals occuring in the above projection method we obtain a unified convergence analysis for these methods; in addition, the above approach yields the tools to deal with the question of the connection between the location of the collocation points used to determine the projection inS _m ^(–1) (Z _N ) and the order of convergence of the method.This research was supported by the National Research Council of Canada (Grant No. A-4805)     

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.     

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.     

Extrapolation method for Fredholm integral equations with non-smooth kernels

Summary This note analyses the methods of extrapolation from certain approximate solutions of integral equations whose kernels have lower degree smoothness. We show that in order to generate a global superconvergent approximation the extrapolation procedure must be applied to the iterated collocation solution rather than to the usual Nyström solution.     

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 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.     

Runge-Kutta theory for Volterra integrodifferential equations

Summary The present paper develops the theory of general Runge-Kutta methods for Volterra integrodifferential equations. The local order is characterized in terms of the coefficients of the method. We investigate the global convergence of mixed and extended Runge-Kutta methods and give results on asymptotic error expansions. In a further section we construct examples of methods up to order 4.     

An analysis of the numerical solution of Fredholm integral equations of the first kind

Summary This paper analyzes the numerical solution of Fredholm integral equations of the first kindTx=y by means of finite rank and other approximation methods replacingTx=y byT _N x=y _N ,N=1,2, .... The operatorsT andT _N can be viewed as operators from eitherL ₂[a, b] toL ₂[c,d] or as operators fromL [a, b] toL [c, d]. A complete analysis of the fully discretized problem as compared with the continuous problemTx=y is also given. The filtered least squares minimum norm solutions (LSMN) to the discrete problem and toT _N x=y are compared with the LSMN solution ofTx=y. Rates of convergence are included in all cases and are in terms of the mesh spacing of the quadrature for the fully discretized problem.     

An extrapolation method with step size control for nonlinear Volterra integral equations

Summary In [6] it has been shown that the midpoint rule applied to second kind volterra integral equations possesses an asymptotic expansion in even powers of the stepsizeh. In this paper we describe an extrapolation method based on the midpoint rule, together with a mechanism of step size control.     

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.     

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.     

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. 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.     

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.     

Procedures for kernel approximation and solution of fredholm integral equations of the second kind

Summary The purpose of this paper is to present explicit ALGOL procedures for (1) the approximation of a kernel (surface) by tensor products of splines, and (2) the computation of approximate eigenvalues and eigenfunctions for Fredholm integral equations of the second kind. Editor's Note. In this fascile, prepublication of algorithms from the Approximations series of the Handbook for Automatic Computation is continued. Algorithms are published in ALGOL 60 reference language as approved by the IFIP. Contributions in this series should be styled after the most recently published ones     

Product integration rules for volterra integral equations of the first kind

The numerical solution of Volterra integral equations of the first kind can be achieved via product integration. This paper establishes the asymptotic error expansions of certain product integration rules. The rectangular rules are found to produce expansions containing all powers ofh, and the midpoint product method is found to produce even powers ofh. Extrapolation to the limit is then applied.     

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.