A dual method to the collocation method

In this article we consider methods which are related to the collocation method by interchanging the test and the trial spaces. Error estimates are derived. As a by-product we obtain some extensions to the known convergence results for the collocation method.     

A quadrature-based approach to improving the collocation method

Summary The collocation method is a popular method for the approximate solution of boundary integral equations, but typically does not achieve the high order of convergence reached by the Galerkin method in appropriate negative norms. In this paper a quadrature-based method for improving upon the collocation method is proposed, and developed in detail for a particular case. That case involves operators with even symbol (such as the logarithmic potential) operating on 1-periodic functions; a smooth-spline trial space of odd degree, with constant mesh spacingh=1/n; and a quadrature rule with 2n points (where ann-point quadrature rule would be equivalent to the collocation method). In this setting it is shown that a special quadrature rule (which depends on the degree of the splines and the order of the operator) can yield a maximum order of convergence two powers ofh higher than the collocation method.     

A collocation method for eigenvalue problems

Approximations to the eigenvalues ofmth-order linear eigenvalue problems are determined by using a collocation method with piecewise-polynomial functions of degreem+d possessingm continuous derivatives as basis functions. It is shown that for a general class of problems the error in these approximations is at leastO([h(II)] ^d+1) whereh(II) is the maximal subinterval length. The question of stability of the discretized problems is also considered. It is not assumed that the eigenvalue problems are in any sense self-adjoint.     

A collocation method for boundary value problems

Collocation with piecewise polynomial functions is developed as a method for solving two-point boundary value problems. Convergence is shown for a general class of linear problems and a rather broad class of nonlinear problems. Some computational examples are presented to illustrate the wide applicability and efficiency of the procedure.     

A new superconvergent collocation method for eigenvalue problems

Here we propose a new method based on projections for the approximate solution of eigenvalue problems. For an integral operator with a smooth kernel, using an interpolatory projection at Gauss points onto the space of (discontinuous) piecewise polynomials of degree , we show that the proposed method exhibits an error of the order of for eigenvalue approximation and of the order of for spectral subspace approximation. In the case of a simple eigenvalue, we show that by using an iteration technique, an eigenvector approximation of the order can be obtained. This improves upon the order for eigenvalue approximation in the collocation/iterated collocation method and the orders and for spectral subspace approximation in the collocation method and the iterated collocation method, respectively. We illustrate this improvement in the order of convergence by numerical examples.

     

A spline collocation method for parabolic pseudodifferential equations

The purpose of this paper is to examine a boundary element collocation method for some parabolic pseudodifferential equations. The basic model problem for our investigation is the two-dimensional heat conduction problem with vanishing initial condition and a given Neumann or Dirichlet type boundary condition. Certain choices of the representation formula for the heat potential yield boundary integral equations of the first kind, namely the single layer and the hypersingular heat operator equations. Both of these operators, in particular, are covered by the class of parabolic pseudodifferential operators under consideration. Moreover, the spatial domain is allowed to have a general smooth boundary curve. As trial functions the tensor products of the smoothest spline functions of odd degree (space) and continuous piecewise linear splines (time) are used. Stability and convergence of the method is proved in some appropriate anisotropic Sobolev spaces.     

A collocation method for generalized nonlinear Klein-Gordon equation

In this paper, we propose a collocation method for an initial-boundary value problem of the generalized nonlinear Klein-Gordon equation. It possesses the spectral accuracy in both space and time directions. The numerical results indicate the high accuracy and the stability of long-time calculation of suggested algorithm, even for moderate mode in spatial approximation and big time step sizes. The main idea and techniques developed in this work provide an efficient framework for the collocation method of various nonlinear problems.     

A sixth-order optimal collocation method for elliptic problems

In this paper, we present a collocation method based on biquintic splines for a fourth order elliptic problems. To have a better accuracy, we formulate the standard collocation method by an appropriate perturbation on the original differential equations that leads to an optimal approximating scheme. As a result, computational results confirm that this method is optimal.     

A collocation method for solving singular integro-differential equations

This paper describes a collocation method for numerically solving Cauchy-type linear singular integro-differential equations. The numerical method is based on the transformation of the integro-differential equation into an integral equation, and then applying a collocation method to solve the latter. The collocation points are chosen as the Chebyshev nodes. Uniform convergence of the resulting method is then discussed. Numerical examples are presented and solved by the numerical techniques.     

A generalized log-normal distribution and its goodness of fit to censored data

In life testing experiments, the skewed distributions like log-normal, Weibull, gamma and generalized gamma are the most suitable models for recording the failure time measurements. In this paper, a generalized version of log-normal distribution is proposed and its goodness-of-fit for a randomly censored data set representing the remission times of bladder cancer patients has been demonstrated and compared with other lifetime models considered in the literature. The P-P plots of Kaplan-Meier estimator against the survival functions of the considered models are used to show the goodness-of-fit. A simulation study is also performed to estimate the parameters in both the classical and Bayesian setups.     

A collocation method for high-frequency scattering by convex polygons

We consider the problem of scattering of a time-harmonic acoustic incident plane wave by a sound soft convex polygon. For standard boundary or finite element methods, with a piecewise polynomial approximation space, the computational cost required to achieve a prescribed level of accuracy grows linearly with respect to the frequency of the incident wave. Recently Chandler–Wilde and Langdon proposed a novel Galerkin boundary element method for this problem for which, by incorporating the products of plane wave basis functions with piecewise polynomials supported on a graded mesh into the approximation space, they were able to demonstrate that the number of degrees of freedom required to achieve a prescribed level of accuracy grows only logarithmically with respect to the frequency. Here we propose a related collocation method, using the same approximation space, for which we demonstrate via numerical experiments a convergence rate identical to that achieved with the Galerkin scheme, but with a substantially reduced computational cost.     

A multidomain spectral collocation method for the Stokes problem

Summary We propose a multidomain spectral collocation scheme for the approximation of the two-dimensional Stokes problem. We show that the discrete velocity vector field is exactly divergence-free and we prove error estimates both for the velocity and the pressure.Deceased     

A Taylor collocation method for solving delay integral equations

A numerical method based on the use of Taylor polynomials is proposed to construct a collocation solution $u\in S_{m-1}^{(-1)}(\Pi _{N})$ for approximating the solution of delay integral equations. It is shown that this method is convergent. Some numerical examples are given to show the validity of the presented method.     

GENERALIZED PARETO DISTRIBUTION FIT TO MEDICAL INSURANCE CLAIMS DATA

How to choose an optimal threshold is a key problem in the generalized Pareto distribution （GPD） model. This paper attains the exact threshold by testing for GPD,and shows that GPD model allows the actuary to easily estimate high quantiles and the probable maximum loss from the medical insurance claims data.     

A collocation method to solve higher order linear complex differential equations in rectangular domains

In this article, a collocation method is developed to find an approximate solution of higher order linear complex differential equations with variable coefficients in rectangular domains. This method is essentially based on the matrix representations of the truncated Taylor series of the expressions in equation and their derivates, which consist of collocation points defined in the given domain. Some numerical examples with initial and boundary conditions are given to show the properties of the method. All results were computed using a program written in scientific WorkPlace v5.5 and Maple v12. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

A fast collocation method for acoustic scattering in shallow oceans

In this paper, we investigate the numerical solution of the integral equation of the second kind reduced by acoustic scattering in shallow oceans with Dirichlet condition. Based on analyzing the singularity of the truncating kernel with a sum of infinite series, using our trigonometric interpolatory wavelets and collocation method, we obtain the numerical solution which possesses a fast convergence rate like o(2^−j). Moreover, the entries of the stiffness matrix can be obtained by FFT, which lead the computational complexity to decrease obviously.     

A collocation method for systems of nonlinear ordinary differential equations

A collocation method based on piecewise polynomials is applied to boundary value problems for mth order systems of nonlinear ordinary differential equations. Optimal a priori estimates are obtained for the error of approximation in the maximum norm and superconvergence is verified at particular points.