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.     

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.     

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.     

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)     

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.     

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.     

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.     

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.     

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.     

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.     

Error bounds for the approximation of Green's kernels by splines

Summary In this paper we give error bounds for the approximation by tensor-product splines of surfaces which are defined on a square and which are smooth except along the diagonal.Supported in part by AFOSR Grant 77-3150     

Error bounds for computed eigenvalues and eigenvectors. II

Summary In this paper, motivated by Symm-Wilkinson's paper [5], we describe a method which finds the rigorous error bounds for a computed eigenvalue ⁽⁰⁾ and a computed eigenvectorx ⁽⁰⁾ of any matrix A. The assumption in a previous paper [6] that ⁽⁰⁾,x ⁽⁰⁾ andA are real is not necessary in this paper. In connection with this method, Symm-Wilkinson's procedure is discussed, too.     

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.     

Sur les bornes d'erreur a posteriori pour les éléments propres d'opérateurs linéaires

Summary The theoretical framework of this study is presented in Sect. 1, with a review of practical numerical methods. The linear operatorT and its approximationT _n are defined in the same Banach space, which is a very common situation. The notion of strong stability forT _n is essential and cannot be weakened without introducing a numerical instability [2]. IfT (or its inverse) is compact, most numerical methods are strongly stable. Without compactness forT(T ^–1) they may not be strongly stable [20].In Sect. 2 we establish error bounds valid in the general setting of a strongly stable approximation of a closedT. This is a generalization of Vainikko [24, 25] (compact approximation). Osborn [19] (uniform and collectivity compact approximation) and Chatelin and Lemordant [6] (strong approximation), based on the equivalence between the eigenvalues convergence with preservation of multiplicities and the collectively compact convergence of spectral projections. It can be summarized in the following way: , eigenvalue ofT of multiplicitym is approximated bym numbers, _n is their arithmetic mean.- _n and the gap between invariant subspaces are of order _n =(T-T _n)P. IfT _n ^* converges toT ^*, pointwise inX ^*, the principal term in the error on - _n is . And for projection methods, withT _n= _n T, we get the bound . It applies to the finite element method for a differential operator with a noncompact resolvent. Aposteriori error bounds are given, and thegeneralized Rayleigh quotient TP _n appears to be an approximation of of the second order, as in the selfadjoint case [12].In Sect. 3, these results are applied to the Galerkin method and its Sloan variant [22], and to approximate quadrature methods. The error bounds and the generalized Rayleigh quotient are numerically tested in Sect. 4.

---

Sur les bornes d'erreur a posteriori pour les éléments propres d'opérateurs linéaires

     

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     

Error bounds for computed eigenvalues and eigenvectors

Summary On the basis of an existence theorem for solutions of nonlinear systems, a method is given for finding rigorous error bounds for computed eigenvalues and eigenvectors of real matrices. It does not require the usual assumption that the true eigenvectors span the whole space. Further, a priori error estimates for eigenpairs corrected by an iterative method are given. Finally the results are illustrated with numerical examples.Dedicated to Professor Yoshikazu Nakai on his sixtieth birthday     

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.     

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.     

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.