Approximate solutions of some Mellin equations with conjugation

We prove some stability results for a simple numerical method for Mellin convolution operators with conjugation and investigate the Fredholm property for its local operators.     

Circulant integral operators as preconditioners for Wiener-Hopf equations

In this paper, we study the solutions of finite-section Wiener-Hopf equations by the preconditioned conjugate gradient method. Our main aim is to give an easy and general scheme of constructing good circulant integral operators as preconditioners for such equations. The circulant integral operators are constructed from sequences of conjugate symmetric functions {C }. Letk(t) denote the kernel function of the Wiener-Hopf equation and be its Fourier transform. We prove that for sufficiently large if {C } is uniformly bounded on the real lineR and the convolution product of the Fourier transform ofC with uniformly onR, then the circulant preconditioned Wiener-Hopf operator will have a clustered spectrum. It follows that the conjugate gradient method, when applied to solving the preconditioned operator equation, converges superlinearly. Several circulant integral operators possessing the clustering and fast convergence properties are constructed explicitly. Numerical examples are also given to demonstrate the performance of different circulant integral operators as preconditioners for Wiener-Hopf operators.Research supported in part by HKRGC grant no. 221600070.     

On the discretization of differential and Volterra integral equations with variable delay

In this paper we analyze the attainable order ofm-stage implicit (collocation-based) Runge-Kutta methods for differential equations and Volterra integral equations of the second kind with variable delay of the formqt (0<q<1). It will be shown that, in contrast to equations without delay, or equations with constant delay, collocation at the Gauss (-Legendre) points will no longer yield the optimal (local) orderO(h ^2m ). This work was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC Research Grant OGP0009406).     

An algorithm for the approximate solution of integral equations of Mellin type

Summary. The cruciform crack problem of elasticity gives rise to an integral equation of the second kind on [0,1] whose kernel has a fixed singularity at (0,0). We introduce a transformation of [0,1] onto itself such that an arbitrary number of derivatives vanish at the end points 0 and 1. If the transformed kernel is dominated near the origin by a Mellin kernel then we have given conditions under which the use of a modified Euler-Maclaurin quadrature rule and the Nystr?m method gives an approximate solution which converges to the exact solution of the original equation. The method is illustrated with a numerical example. Received May 10, 1994     

Midpoint collocation for Cauchy singular integral equations

Summary A Cauchy singular integral equation on a smooth closed curve may be solved numerically using continuous piecewise linear functions and collocation at the midpoints of the underlying grid. Even if the grid is non-uniform, suboptimal rates of convergence are proved using a discrete maximum principle for a modified form of the collocation equations. The same techniques prove negative norm estimates when midpoint collocation is used to determine piecewise constant approximations to the solution of first kind equations with the logarithmic potential.This work was supported by the Australian Research Council through the program grant Numerical analysis for integrals, integral equations and boundary value problems     

A fast Fourier-collocation method for second boundary integral equations

In this paper we develop a fast collocation method for second boundary integral equations by the trigonometric polynomials. We propose a convenient way to compress the dense matrix representation of a compact integral operator with a smooth kernel under the Fourier basis and the corresponding collocation functionals. The compression leads to a sparse matrix with only O(nlog²n) number of nonzero entries, where 2n+1 denotes the order of the matrix. Thus we develop a fast Fourier-collocation method. We prove that the fast Fourier-collocation method gives the optimal convergence order up to a logarithmic factor. Moreover, we design a fast scheme for solving the corresponding truncated linear system. We establish that this algorithm preserves the quasi-optimal convergence of the approximate solution with requiring a number of O(nlog³n) multiplications.     

The Galerkin scheme for Lavrentiev’sm-times iterated method to solve linear accretive Volterra integral equations of the first kind

In this paper, for the numerical solution of linear accretive Volterra integral equations of the first kind in Hilbert spaces we consider the Galerkin scheme for Lavrentiev’sm-times iterated method, i.e., for each parameter choice for Lavrentiev’sm-times iterated method the arisingm stabilized equations are discretized by the Galerkin scheme. An associated discrepancy principle as parameter choice strategy for this finite-dimensional version of Lavrentiev’sm-times iterated method is proposed, and corresponding convergence results are provided.     

Conditions for blow-up of solutions of some nonlinear Volterra integral equations

In this paper we give necessary and sufficient conditions for blow-up of solutions for a particular class of nonlinear Volterra equations. We also give some examples.     

Numerical solution of cauchy-type integral equations of index −1 by collocation methods

This paper describes a collocation method for solving constant coefficient Cauchy-type singular integral equations of index –1. A technique for reducing the set of linear equations resulting from collocation to match the number of unknows is described. The uniform convergence analysis of the resulting method is presented and convergence rates based on the smoothness of the data are given.This work was partially supported by CNPq under grant #300105/88-6(RN).     

On the approximation of singular integral equations by equations with smooth kernels

Singular integral equations with Cauchy kernel and piecewise-continuous matrix coefficients on open and closed smooth curves are replaced by integral equations with smooth kernels of the form(t–)[(t–) ²–n ² (t) ²]^–1,0, wheren(t), t , is a continuous field of unit vectors non-tangential to . we give necessary and sufficient conditions under which the approximating equations have unique solutions and these solutions converge to the solution of the original equation. For the scalar case and the spaceL ₂() these conditions coincide with the strong ellipticity of the given equation.This work was fulfilled during the first author's visit to the Weierstrass Institute for Applied Analysis and Stochastics, Berlin in October 1993.     

Multiple positive solutions for a class of integral inclusions

This paper deals with sufficient conditions for the existence of at least two positive solutions for a class of integral inclusions arising in the traffic theory. To show our main results, we apply a norm-type expansion and compression fixed point theorem for multivalued map due to Agarwal and O’Regan [A note on the existence of multiple fixed points for multivalued maps with applications, J. Differential Equation 160 (2000) 389–403].     

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     

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.     

Fast Fourier-Galerkin methods for solving singular boundary integral equations: Numerical integration and precondition

We develop a fast fully discrete Fourier-Galerkin method for solving a class of singular boundary integral equations. We prove that the number of multiplications used in generating the compressed matrix is O(nlog³n), and the solution of the proposed method preserves the optimal convergence order O(n^−t), where n is the order of the Fourier basis functions used in the method and t denotes the degree of regularity of the exact solution. Moreover, we propose a preconditioning which ensures the numerical stability when solving the preconditioned linear system. Numerical examples are presented to confirm the theoretical estimates and to demonstrate the approximation accuracy and computational efficiency of the proposed algorithm.     

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.     

Nyström method for Cauchy singular integral equations with negative index

In this paper, the authors propose a Nyström method to approximate the solutions of Cauchy singular integral equations with constant coefficients having a negative index. They consider the equations in spaces of continuous functions with weighted uniform norm. They prove the stability and the convergence of the method and show some numerical tests that confirm the error estimates.     

On the uniform convergence of a collocation method for a class of singular integral equations

We establish the uniform convergence of a collocation method for solving a class of singular integral equations. This method uses the Jacobi polynomials {P _n ^{(, )} } as basis elements and the zeros of a Chebyshev polynomial of the first kind as collocation points. Uniform convergence is shown to hold under the weak assumption that the kernel and the right-hand side are Hölder-continous functions. Convergence rates are also given.     

On polynomial collocation for Cauchy singular integral equations with fixed singularities

In this paper we consider a polynomial collocation method for the numerical solution of Cauchy singular integral equations with fixed singularities over the interval, where the fixed singularities are supposed to be of Mellin convolution type. For the stability and convergence of this method in weightedL ² spaces, we derive necessary and sufficient conditions.     

High performance parallel numerical methods for Volterra equations with weakly singular kernels

Non-stationary discrete time waveform relaxation methods for Abel systems of Volterra integral equations using fractional linear multistep formulae are introduced. Fully parallel discrete waveform relaxation methods having an optimal convergence rate are constructed. A significant expression of the error is proved, which allows us to estimate the number of iterations needed to satisfy a prescribed tolerance and allows us to identify the problems where the optimal methods offer the best performance. The numerical experiments confirm the theoretical expectations.