Superconvergence of the iterated collocation methods for Hammerstein equations

In this paper, we analyse the iterated collocation method for Hammerstein equations with smooth and weakly singular kernels. The paper expands the study which began in [16] concerning the superconvergence of the iterated Galerkin method for Hammerstein equations. We obtain in this paper a similar superconvergence result for the iterated collocation method for Hammerstein equations. We also discuss the discrete collocation method for weakly singular Hammerstein equations. Some discrete collocation methods for Hammerstein equations with smooth kernels were given previously in [3, 18].     

Local error estimation for multistep collocation methods

Multistep collocation methods for initial value problems in ordinary differential equations are known to be a subclass of multistep Runge-Kutta methods and a generalisation of the well-known class of one-step collocation methods as well as of the one-leg methods of Dahlquist. In this paper we derive an error estimation method of embedded type for multistep collocation methods based on perturbed multistep collocation methods. This parallels and generalizes the results for one-step collocation methods by Nørsett and Wanner. Simple numerical experiments show that this error estimator agrees well with a theoretical error estimate which is a generalisation of an error estimate first derived by Dahlquist for one-leg methods.     

时滞积-微分方程配置解的多重校正

本文讨论线性Volterra时滞积一微分方程的连续分片多项式样条配置方法．在适当条件下,获得了配置解的导数在结点集上成立的精细误差展开式．以此为基础,给出了配置解的多重校正格式．     

Regularized collocation method for Fredholm integral equations of the first kind

In this paper we consider a collocation method for solving Fredholm integral equations of the first kind, which is known to be an ill-posed problem. An “unregularized” use of this method can give reliable results in the case when the rate at which smallest singular values of the collocation matrices decrease is known a priori. In this case the number of collocation points plays the role of a regularization parameter. If the a priori information mentioned above is not available, then a combination of collocation with Tikhonov regularization can be the method of choice. We analyze such regularized collocation in a rather general setting, when a solution smoothness is given as a source condition with an operator monotone index function. This setting covers all types of smoothness studied so far in the theory of Tikhonov regularization. One more issue discussed in this paper is an a posteriori choice of the regularization parameter, which allows us to reach an optimal order of accuracy for deterministic noise model without any knowledge of solution smoothness.     

非线性积分方程迭代配置法的渐近展开及其外推

非线性积分方程迭代配置法的渐近展开及其外推韩国强（华南理工大学计算机工程与科学系）ＡＳＹＭＰＴＯＴＩＣＥＲＲＯＲＥＸＭＮＳＩＯＮＳＡＮＤＥＸＴＲＡＰＯＬＡＴＩＯＮＦＯＲＴＨＥＩＴＥＲＡＴＥＤＣＯＬＬＯＣＡＴＩＯＮＭＥＴＨＯＤＳＯＦＮＯＮＬＩＮＥＡＲＩ...     

The discrete collocation method for nonlinear integral equations

The collocation method for solving linear and nonlinear integralequations results in many integrals which must be evaluatednumerically. In this paper, we give a general framework fordiscrete collocation methods, in which all integrals are replacedby numerical integrals. In some cases, the collocation methodleads to solutions which are superconvergent at the collocationnode points. We consider generalizations of these results, toobtain similar results for discrete collocation solutions. Lastly,we consider a variant due to Kumar and Sloan for the collocationsolution of Hammerstein integral equations.     

On the convergence of the collocation method for nonlinear boundary integral equations

Recently, Galerkin and collocation methods have been analysed for some nonlinear boundary integral equations. For the collocation method it has been assumed that the nonlinearity is asymptotically linear. In this paper we remove this restriction. We shall prove the convergence of the collocation method for nonlinear boundary integral equations, when the nonlinearity has a polynomial growth condition. In addition to this the optimal order error estimates follow in L^q(Γ)-norm.     

Stability of collocation methods for delay differential equations with vanishing delays

We analyze the asymptotic stability of collocation solutions in spaces of globally continuous piecewise polynomials on uniform meshes for linear delay differential equations with vanishing proportional delay qt (0<q<1) (pantograph DDEs). It is shown that if the collocation points are such that the analogous collocation solution for ODEs is A-stable, then this asymptotic behaviour is inherited by the collocation solution for the pantograph DDE.     

Piecewise spectral collocation method for system of Volterra integral equations

The main purpose of this paper is to investigate the piecewise spectral collocation method for system of Volterra integral equations. The provided convergence analysis shows that the presented method performs better than global spectral collocation method and piecewise polynomial collocation method. Numerical experiments are carried out to confirm these theoretical results.     

ASYMPTOTIC ERROR EXPANSIONS OF QUADRATIC SPLINE COLLOCATION SOLUTIONS FOR TWO-POINT BOUNDARY VALUE PROBLEMS

In this paper, we consider the following problem:The quadratic spline collocation, with uniform mesh and the mid-knot points are taken as the collocation points for this problem is considered. With some assumptions, we have proved that the solution of the quadratic spline collocation for the nonlinear problem can be written as a series expansions in integer powers of the mesh-size parameter. This gives us a construction method for using Richardson's extrapolation. When we have a set of approximate solution with different mesh-size parameter a solution with high accuracy can he obtained by Richardson's extrapolation.     

On the Divergence of Collocation Solutions in Smooth Piecewise Polynomial Spaces for Volterra Integral Equations

In this paper we present a characterization of those smooth piecewise polynomial collocation spaces that lead to divergent collocation solutions for Volterra integral equations of the second kind. The key to these results is an equivalence result between such collocation solutions and collocation solutions in slightly smoother spaces for initial-value problems for ordinary differential equations. For the latter problems Mülthei (1979/1980) established a complete divergence (and convergence) theory. Our analysis can be extended to furnish divergence results for smooth collocation solutions to Volterra integral equations of the first kind. AMS subject classification (2000) 65R20, 65L20, 65L60.Received May 2004. Accepted September 2004. Communicated by Tom Lyche.Hermann Brunner: This research was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC).     

Analysis of a moving collocation method for one-dimensional partial differential equations

A moving collocation method has been shown to be very efficient for the adaptive solution of second- and fourth-order time-dependent partial differential equations and forms the basis for the two robust codes MOVCOL and MOVCOL4.In this paper,the relations between the method and the traditional collocation and finite volume methods are investigated.It is shown that the moving collocation method inherits desirable properties of both methods: the ease of implementation and high-order convergence of the traditional collocation method and the mass conservation of the finite volume method.Convergence of the method in the maximum norm is proven for general linear two-point boundary value problems.Numerical results are given to demonstrate the convergence order of the method.     

A fast collocation method for the radiosity equation,based on the hierarchical algorithm of Hanrahan and Salzman: the 1d case

In this paper we study a collocation method with piecewise constant trial functions for the solution of the planar radiosity equation. The matrix of the collocation method is approximated by a method which was developed by Hanrahan et al. [9,10]. We prove that the modified collocation method results in a reduction of work while the order of convergence stays the same. Numerical examples demonstrate the theoretical results. AMS subject classification 45B05, 65R20, 65Y20     

Efficient mesh selection for collocation methods applied to singular BVPs

We describe a mesh selection strategy for the numerical solution of boundary value problems for singular ordinary differential equations. This mesh adaptation procedure is implemented in our MATLAB code sbvp which is based on polynomial collocation. We prove that under realistic assumptions our mesh selection strategy serves to approximately equidistribute the global error of the collocation solution, thus enabling to reach prescribed tolerances efficiently. Moreover, we demonstrate that this strategy yields a favorable performance of the code and compare its computational effort with other implementations of polynomial collocation.     

Error Analysis of the Strang Time-Splitting Laguerre–Hermite/Hermite Collocation Methods for the Gross–Pitaevskii Equation

The aim of this paper is to carry out a rigorous error analysis for the Strang splitting Laguerre–Hermite/Hermite collocation methods for the time-dependent Gross–Pitaevskii equation (GPE). We derive error estimates for full discretizations of the three-dimensional GPE with cylindrical symmetry by the Strang splitting Laguerre–Hermite collocation method, and for the d-dimensional GPE by the Strang splitting Hermite collocation method.     

On the stability of meshless symmetric collocation for boundary value problems

In this paper, we study the stability of symmetric collocation methods for boundary value problems using certain positive definite kernels. We derive lower bounds on the smallest eigenvalue of the associated collocation matrix in terms of the separation distance. Comparing these bounds to the well-known error estimates shows that another trade-off appears, which is significantly worse than the one known from classical interpolation. Finally, we show how this new trade-off can be overcome as well as how the collocation matrix can be stabilized by smoothing. AMS subject classification (2000)  65N12, 65N15, 65N35     

Bernstein operational matrix of fractional derivatives and its applications

In this paper, Bernstein operational matrix of fractional derivative of order α in the Caputo sense is derived. We also apply this matrix to the collocation method for solving multi-order fractional differential equations. The numerical results obtained by the present method compares favorably with those obtained by various collocation methods earlier in the literature.     

Interpolation correction for collocation solutions of Fredholm integro-differential equations

In this paper we discuss the collocation method for a large class of Fredholm linear integro-differential equations. It will be shown that, when a certain higher order interpolation operation is added to the collocation solution of this equation, the new approximations will, under suitable assumptions, admit a multiterm error expansion in even powers of the step-size . Based on this expansion, ideal multilevel correction results of this collocation solution are obtained.

     

广义SRLW方程的拟谱配点方法

1.引言 我们考虑求解下列非线性波动方程周期初值问题：     

On a least-squares collocation method for linear differential-algebraic equations

Summary The aim of this note is to extend some results on least-squares collocation methods and to prove the convergence of a least-squares collocation method applied to linear differential-algebraic equations. Some numerical examples are presented.