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.     

Semi-discrete Galerkin approximation of the single layer equation by general splines

This paper deals with a semi-discrete version of the Galerkin method for the single-layer equation in a plane, in which the outer integral is approximated by a quadrature rule. A feature of the analysis is that it does not require high precision quadrature or exceptional smoothness of the data. Instead, the assumptions on the quadrature rule are that constant functions are integrated exactly, that the rule is based on sufficiently many quadrature points to resolve the approximation space, and that the Peano constant of the rule is sufficiently small. It is then shown that the semi-discrete Galerkin approximation is well posed. For the trial and test spaces we consider quite general piecewise polynomials on quasi-uniform meshes, ranging from discontinuous piecewise polynomials to smoothest splines. Since it is not assumed that the quadrature rule integrates products of basis functions exactly, one might expect degradation in the rate of convergence. To the contrary, it is shown that the semi-discrete Galerkin approximation will converge at the same rate as the corresponding Galerkin approximation in the and norms. Received March 15, 1996 / Revised version received June 2, 1997     

Integration of singular Galerkin-type boundary element integrals for 3D elasticity problems

Summary. A Galerkin approximation of both strongly and hypersingular boundary integral equation (BIE) is considered for the solution of a mixed boundary value problem in 3D elasticity leading to a symmetric system of linear equations. The evaluation of Cauchy principal values (v. p.) and finite parts (p. f.) of double integrals is one of the most difficult parts within the implementation of such boundary element methods (BEMs). A new integration method, which is strictly derived for the cases of coincident elements as well as edge-adjacent and vertex-adjacent elements, leads to explicitly given regular integrand functions which can be integrated by the standard Gauss-Legendre and Gauss-Jacobi quadrature rules. Problems of a wide range of integral kernels on curved surfaces can be treated by this integration method. We give estimates of the quadrature errors of the singular four-dimensional integrals. Received June 25, 1995 / Revised version received January 29, 1996     

Stable high-order quadrature rules with equidistant points

Newton-Cotes quadrature rules are based on polynomial interpolation in a set of equidistant points. They are very useful in applications where sampled function values are only available on a regular grid. Yet, these rules rapidly become unstable for high orders. In this paper we review two techniques to construct stable high-order quadrature rules using equidistant quadrature points. The stability follows from the fact that all coefficients are positive. This result can be achieved by allowing the number of quadrature points to be larger than the polynomial order of accuracy. The computed approximations then implicitly correspond to the integral of a least squares approximation of the integrand. We show how the underlying discrete least squares approximation can be optimised for the purpose of numerical integration.     

Efficient quadrature for highly oscillatory integrals involving critical points

This paper based on the Levin collocation method and Levin-type method together with composite two-point Gauss–Legendre quadrature presents efficient quadrature for integral transformations of highly oscillatory functions with critical points. The effectiveness and accuracy of the quadrature are tested.     

Numerical solution of linear Volterra integral equations of the second kind with sharp gradients

Collocation methods are a well-developed approach for the numerical solution of smooth and weakly singular Volterra integral equations. In this paper, we extend these methods through the use of partitioned quadrature based on the qualocation framework, to allow the efficient numerical solution of linear, scalar Volterra integral equations of the second kind with smooth kernels containing sharp gradients. In this case, the standard collocation methods may lose computational efficiency despite the smoothness of the kernel. We illustrate how the qualocation framework can allow one to focus computational effort where necessary through improved quadrature approximations, while keeping the solution approximation fixed. The computational performance improvement introduced by our new method is examined through several test examples. The final example we consider is the original problem that motivated this work: the problem of calculating the probability density associated with a continuous-time random walk in three dimensions that may be killed at a fixed lattice site. To demonstrate how separating the solution approximation from quadrature approximation may improve computational performance, we also compare our new method to several existing Gregory, Sinc, and global spectral methods, where quadrature approximation and solution approximation are coupled.     

$C^1$ error estimation on the boundary for an exterior Neumann problem in $\mathbb R^3$

Summary.   In this paper we establish a error estimation on the boundary for the solution of an exterior Neumann problem in . To solve this problem we consider an integral representation which depends from the solution of a boundary integral equation. We use a full piecewise linear discretisation which on one hand leads to a simple numerical algorithm but on the other hand the error analysis becomes more difficult due to the singularity of the integral kernel. We construct a particular approximation for the solution of the boundary integral equation, for the solution of the Neumann problem and its gradient on the boundary and estimate their error. Received May 11, 1998 / Revised version received July 7, 1999 / Published online August 24, 2000     

Mixed boundary integral methods for Helmholtz transmission problems

In this paper we propose a hybrid between direct and indirect boundary integral methods to solve a transmission problem for the Helmholtz equation in Lipschitz and smooth domains. We present an exhaustive abstract study of the numerical approximation of the resulting system of boundary integral equations by means of Galerkin methods. Some particular examples of convergent schemes in the smooth case in two dimensions are given. Finally, we extend the results to a thermal scattering problem in a half plane with several obstacles and provide numerical results that illustrate the accuracy of our methods depending on the regularity of the interface.     

Global polynomial approximation for Symm's equation on polygons

Summary. To solve 1D linear integral equations on bounded intervals with nonsmooth input functions and solutions, we have recently proposed a quite general procedure, that is essentially based on the introduction of a nonlinear smoothing change of variable into the integral equation and on the approximation of the transformed solution by global algebraic polynomials. In particular, the new procedure has been applied to weakly singular equations of the second kind and to solve the generalized air foil equation for an airfoil with a flap. In these cases we have obtained arbitrarily high orders of convergence through the solution of very-well conditioned linear systems. In this paper, to enlarge the domain of applicability of our technique, we show how the above procedure can be successfully used also to solve the classical Symm's equation on a piecewise smooth curve. The collocation method we propose, applied to the transformed equation and based on Chebyshev polynomials of the first kind, has shown to be stable and convergent. A comparison with some recent numerical methods using splines or trigonometric polynomials shows that our method is highly competitive. Received October 1, 1998 / Revised version received September 27, 1999 / Published online June 21, 2000     

Numerical analysis of a non‐singular boundary integral method: Part I. The circular case

In order to numerically solve the interior and the exterior Dirichlet problems for the Laplacian operator, we present here a method which consists in inverting, on a finite element space, a non‐singular integral operator. This operator is a geometrical perturbation of the Steklov operator, and we precisely define the relation between the geometrical perturbation and the dimension of the finite element space, in order to obtain a stable and convergent scheme. Furthermore, this numerical scheme does not give rise to any singular integral. The scheme can also be considered as a special quadrature formula method for the standard piecewise linear Galerkin approximation of the weakly singular single layer potential, the special quadrature formula being defined by the introduction of a neighbouring curve. In the present paper, we prove stability and we give error estimates of our numerical scheme when the Laplace problem is set on a disk. We will extend our results to any domains by using compact perturbation arguments, in a second paper. Copyright © 2001 John Wiley & Sons, Ltd.     

A product integration method for the approximation of the early exercise boundary in the American option pricing problem

Integral equation methods are now becoming well‐established tools in the study of financial models used in theory and practice. In this paper, we investigate the fully nonlinear weakly singular nonstandard Volterra integral equations representing the early exercise boundary of American option contracts, which gained popularity in recent years. We propose a product integration approach based on linear barycentric rational interpolation to solve the problem. The price of the option will then be computed using the obtained approximation of the early exercise boundary and a barycentric rational quadrature. The convergence of the approximation scheme will also be analyzed. Finally, some numerical experiments based on the introduced method are presented and compared with some exiting approaches.     

The Euler Maclaurin expansion for the Cauchy Principal Value integral

Summary The classical Euler Maclaurin Summation Formula expresses the difference between a definite integral over [0, 1] and its approximation using the trapezoidal rule with step lengthh=1/m as an asymptotic expansion in powers ofh together with a remainder term. Many variants of this exist some of which form the basis of extrapolation methods such as Romberg Integration. in this paper a variant in which the integral is a Cauchy Principal Value integral is derived. The corresponding variant of the Fourier Coefficient Asymptotic Expansion is also derived. The possible role of the former in numerical quadrature is discussed.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38     

On Cayley-Transform Methods for the Discretization of Lie-Group Equations

In this paper we develop in a systematic manner the theory of time-stepping methods based on the Cayley transform. Such methods can be applied to discretize differential equations that evolve in some Lie groups, in particular in the orthogonal group and the symplectic group. Unlike many other Lie-group solvers, they do not require the evaluation of matrix exponentials. Similarly to the theory of Magnus expansions in [13], we identify terms in a Cayley expansion with rooted trees, which can be constructed recursively. Each such term is an integral over a polytope but all such integrals can be evaluated to high order by using special quadrature formulas similar to the construction in [13]. Truncated Cayley expansions (with exact integrals) need not be time-symmetric, hence the method does not display the usual advantages associated with time symmetry, e.g., even order of approximation. However, time symmetry (with its attendant benefits) is attained when exact integrals are replaced by certain quadrature formulas. March 7, 2000. Final version received: August 10, 2000. Online publication: January 2, 2001.     

Efficient evaluation of highly oscillatory acoustic scattering surface integrals

We consider the approximation of some highly oscillatory weakly singular surface integrals, arising from boundary integral methods with smooth global basis functions for solving problems of high frequency acoustic scattering by three-dimensional convex obstacles, described globally in spherical coordinates. As the frequency of the incident wave increases, the performance of standard quadrature schemes deteriorates. Naive application of asymptotic schemes also fails due to the weak singularity. We propose here a new scheme based on a combination of an asymptotic approach and exact treatment of singularities in an appropriate coordinate system. For the case of a spherical scatterer we demonstrate via error analysis and numerical results that, provided the observation point is sufficiently far from the shadow boundary, a high level of accuracy can be achieved with a minimal computational cost.     

Some observations on Gauss-Legendre quadrature error estimates for analytic functions

This paper is concerned with estimates for the error when a Gauss-Legendre quadrature rule is used to numerically integrate an analytic function. The error in a standard approximation to the kernel function, which appears in a contour integral representation for the quadrature error, is investigated for this purpose. Applications to meromorphic functions with simple poles are discussed.     

A note on the effect of numerical quadrature in finite element eigenvalue approximation

Summary In a recent work by the author and J.E. Osborn, it was shown that the finite element approximation of the eigenpairs of differential operators, when the elements of the underlying matrices are approximated by numerical quadrature, yield optimal order of convergence when the numerical quadrature satisfies a certain precision requirement. In this note we show that this requirement is indeed sharp for eigenvalue approximation. We also show that the optimal order of convergence for approximate eigenvectors can be obtained, using numerical quadrature with less precision.The author would like to thank Prof. I. Babuka for several helpful discussions. This work was done during the author's visit to the Institute of Physical Sciences and Technology and the Department of Mathematics of University of Maryland, College Park, MD 20742, USA, and was supported in part by the Office of Naval Research under Naval Research Grant N0001490-J-1030     

A natural interpolation formula for the numerical solution of singular integral equations with hilbert kernel

The direct quadrature method for the numerical solution of singular integral equations with Hilbert kernel is investigated and a very accurate natural interpolation formula for the approximation of the unknown function is proposed. It is further proved that this formula coincides with Nyström's natural interpolation formula for the Fredholm integral equation of the second kind equivalent to the original integral equation if the same quadrature rule is used in both cases.     

On the numerical solution of a logarithmic integral equation of the first kind for the Helmholtz equation

Summary We describe a quadrature method for the numerical solution of the logarithmic integral equation of the first kind arising from the single-layer approach to the Dirichlet problem for the two-dimensional Helmholtz equation in smooth domains. We develop an error analysis in a Sobolev space setting and prove fast convergence rates for smooth boundary data.     

THE COLLOCATION METHODS FOR SINGULAR INTEGRAL EQUATIONS WITH CAUCHY KERNELS

1 Introduction Singular integral equations (SIEs) with Cauchy kernels Of the formoften arise in mathematical models of physical phenomena. Since closed-form solutions to SIEsare generally not available, much att.ntion has been focused on numerical methods of solution.In the past twenty years, various collocation methods for SIEs have been the topic of a greatmany of papers, most of which can be found in two surveys[213]. The early works in the fieldis to study tile numerical solutions for…     

On the convergence of the vortex loop method with regularization for the Neumann boundary value problem on a plane screen

We consider a linear integral equation with a supersingular integral treated in the sense of the Hadamard finite value, which arises in the solution of the Neumann boundary value problem for the Laplace equation with the representation of the solution in the form of a doublelayer potential. We consider the case in which the exterior boundary value problem is solved outside a plane surface (a screen). For the integral operator in the above-mentioned equation, we suggest quadrature formulas of the vortex loop method with regularization, which provide its approximation on the entire surface when using an unstructured partition. In the problem in question, the derivative of the unknown density of the double-layer potential, as well as the errors of quadrature formulas, has singularities in a neighborhood of the screen edge. We construct a numerical scheme for the integral equation on the basis of the suggested quadrature formulas and prove an estimate for the norm of the inverse matrix of the resulting system of linear equations and the uniform convergence of the numerical solutions to the exact solution of the supersingular integral equation on the grid.