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.     

Multidomain Legendre-Galerkin Least-Squares Method for Linear Differential Equations with Variable Coefficients

The multidomain Legendre-Galerkin least-squares method is developed for solving linear differential problems with variable coefficients. By introducing a flux, the original differential equation is rewritten into an equivalent first-order system, and the Legendre Galerkin is applied to the discrete form of the corresponding least squares function. The proposed scheme is based on the Legendre-Galerkin method, and the Legendre/Chebyshev-Gauss-Lobatto collocation method is used to deal with the variable coefficients and the right hand side terms. The coercivity and continuity of the method are proved and the optimal error estimate in $H^1$-norm is obtained. Numerical examples are given to validate the efficiency and spectral accuracy of our scheme. Our scheme is also applied to the numerical solutions of the parabolic problems with discontinuous coefficients and the two-dimensional elliptic problems with piecewise constant coefficients, respectively.     

Efficient Collocation Schemes for Singular Boundary Value Problems

We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.     

An a posteriori error estimate for a first-kind integral equation

In this paper we present a new a posteriori error estimate for the boundary element method applied to an integral equation of the first kind. The estimate is local and sharp for quasi-uniform meshes and so improves earlier work of ours. The mesh-dependence of the constants is analyzed and shown to be weaker than expected from our previous work. Besides the Galerkin boundary element method, the collocation method and the qualocation method are considered. A numerical example is given involving an adaptive feedback algorithm.

     

Nonconforming spline collocation methods in irregular domains

This article studies a class of nonconforming spline collocation methods for solving elliptic PDEs in an irregular region with either triangular or quadrilateral partition. In the methods, classical Gaussian points are used as matching points and the special quadrature points in a triangle or quadrilateral element are used as collocation points. The solution and its normal derivative are imposed to be continuous at the marching points. The authors present theoretically the existence and uniqueness of the numerical solution as well as the optimal error estimate in H¹‐norm for a spline collocation method with rectangular elements. Numerical results confirm the theoretical analysis and illustrate the high‐order accuracy and some superconvergence features of methods. Finally the authors apply the methods for solving two physical problems in compressible flow and linear elasticity, respectively. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

A novel mathematical modeling of multiple scales for a class of two dimensional singular perturbed problems

A novel mathematical modeling of multiple scales (NMMMS) is presented for a class of singular perturbed problems with both boundary or transition layers in two dimensions. The original problems are converted into a series of problems with different scales, and under these different scales, each of the problem is regular. The rational spectral collocation method (RSCM) is applied to deal with the problems without singularities. NMMMS can still work successfully even when the parameter ε is extremely small (ε = 10^?25 or even smaller). A brief error estimate for the model problem is given in Section 2. Numerical examples are implemented to show the method is of high accuracy and efficiency.     

New a posteriori error estimates for singular boundary value problems

In this paper, we discuss the asymptotic properties and efficiency of several a posteriori estimates for the global error of collocation methods. Proofs of the asymptotic correctness are given for regular problems and for problems with a singularity of the first kind. We were also strongly interested in finding out which of our error estimates can be applied for the efficient solution of boundary value problems in ordinary differential equations with an essential singularity. Particularly, we compare estimates based on the defect correction principle with a strategy based on mesh halving. AMS subject classification 65L05Supported in part by the Austrian Research Fund (FWF) grant P-15072-MAT and SFB Aurora.     

A note on accurate estimations of the local truncation error of polynomial methods for differential equations

We give sharp error estimations for the local truncation error of polynomial methods for the approximate solution of initial value problems. Our analysis is developed for second order differential equations with polynomial coefficients using the Tau Method as an analytical tool. Our estimates apply to approximations derived with the latter, with collocation and with techniques based on series expansions. An example on collocation is given, to illustrate the use of our estimates.     

Error estimates in interpolation methods for solving boundary value problems for ordinary differential equations

We estimate the error of the subdomain method, the multiple coincidence method, and the collocation method for two-point boundary value problems.     

An efficient asymptotically correct error estimator for collocation solutions to singular index-1 DAEs

A computationally efficient a posteriori error estimator is introduced and analyzed for collocation solutions to linear index-1 DAEs (differential-algebraic equations) with properly stated leading term exhibiting a singularity of the first kind. The procedure is based on a modified defect correction principle, extending an established technique from the context of ordinary differential equations to the differential-algebraic case. Using recent convergence results for stiffly accurate collocation methods, we prove that the resulting error estimate is asymptotically correct. Numerical examples demonstrate the performance of this approach. To keep the presentation reasonably self-contained, some arguments from the literature on DAEs concerning the decoupling of the problem and its discretization, which is essential for our analysis, are also briefly reviewed. The appendix contains a remark about the interrelation between collocation and implicit Runge-Kutta methods for the DAE case.     

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.     

Adaptive sparse grid algorithms with applications to electromagnetic scattering under uncertainty

We discuss adaptive sparse grid algorithms for stochastic differential equations with a particular focus on applications to electromagnetic scattering by structures with holes of uncertain size, location, and quantity. Stochastic collocation (SC) methods are used in combination with an adaptive sparse grid approach based on nested Gauss-Patterson grids. As an error estimator we demonstrate how the nested structure allows an effective error estimation through Richardson extrapolation. This is shown to allow excellent error estimation and it also provides an efficient means by which to estimate the solution at the next level of the refinement. We introduce an adaptive approach for the computation of problems with discrete random variables and demonstrate its efficiency for scattering problems with a random number of holes. The results are compared with results based on Monte Carlo methods and with Stroud based integration, confirming the accuracy and efficiency of the proposed techniques.     

Numerical solutions of integro-differential equations and application of a population model with an improved Legendre method

In this paper, an improved Legendre collocation method is presented for a class of integro-differential equations which involves a population model. This improvement is made by using the residual function of the operator equation. The error differential equation, gained by residual function, has been solved by the Legendre collocation method (LCM). By summing the approximate solution of the error differential equation with the approximate solution of the problem, a better approximate solution is obtained. We give the illustrative examples to demonstrate the efficiency of the method. Also we compare our results with the results of the known some methods. In addition, an application of the population model is made.     

Optimal uniform error estimates for moving least‐squares collocation with application to option pricing under jump‐diffusion processes

In this study, we derive optimal uniform error bounds for moving least‐squares (MLS) mesh‐free point collocation (also called finite point method) when applied to solve second‐order elliptic partial integro‐differential equations (PIDEs). In the special case of elliptic partial differential equations (PDEs), we show that our estimate improves the results of Cheng and Cheng (Appl. Numer. Math. 58 (2008), no. 6, 884–898) both in terms of the used error norm (here the uniform norm and there the discrete vector norm) and the obtained order of convergence. We then present optimal convergence rate estimates for second‐order elliptic PIDEs. We proceed by some numerical experiments dealing with elliptic PDEs that confirm the obtained theoretical results. The article concludes with numerical approximation of the linear parabolic PIDE arising from European option pricing problem under Merton's and Kou's jump‐diffusion models. The presented computational results (including the computation of option Greeks) and comparisons with other competing approaches suggest that the MLS collocation scheme is an efficient and reliable numerical method to solve elliptic and parabolic PIDEs arising from applied areas such as financial engineering.     

An exact local error representation of exponential operator splitting methods for evolutionary problems and applications to linear Schrödinger equations in the semi-classical regime

In this paper, we are concerned with the derivation of a local error representation for exponential operator splitting methods when applied to evolutionary problems that involve critical parameters. Employing an abstract formulation of differential equations on function spaces, our framework includes Schrödinger equations in the semi-classical regime as well as parabolic initial-boundary value problems with high spatial gradients. We illustrate the general mechanism on the basis of the first-order Lie splitting and the second-order Strang splitting method. Further, we specify the local error representation for a fourth-order splitting scheme by Yoshida. From the given error estimate it is concluded that higher-order exponential operator splitting methods are favourable for the time-integration of linear Schrödinger equations in the semi-classical regime with critical parameter 0<ε?1, provided that the time stepsize h is sufficiently smaller than \(\sqrt[p]{\varepsilon}\), where p denotes the order of the splitting method.     

Global error estimates for a uniparametric family of stiffly accurate Runge-Kutta collocation methods on singularly perturbed problems

An error analysis for a newly defined uniparametric family of stiffly accurate Runge-Kutta collocation methods when applied to initial value problems for singularly perturbed differential equations is carried out. The so-called SAFERK methods possess a first internal stage of explicit type and are based on collocation nodes. Sharp convergence results are obtained for these methods through the analysis of a sequence of higher index Differential Algebraic Equations. A numerical test with the Van der Pol oscillator reveals that the proposed error estimates are realistic whenever the stepsize h is large enough compared to the stiffness parameter ε.     

A Collocation Code for Singular Boundary Value Problems in Ordinary Differential Equations

We present a MATLAB package for boundary value problems in ordinary differential equations. Our aim is the efficient numerical solution of systems of ODEs with a singularity of the first kind, but the solver can also be used for regular problems. The basic solution is computed using collocation methods and a new, efficient estimate of the global error is used for adaptive mesh selection. Here, we analyze some of the numerical aspects relevant for the implementation, describe measures to increase the efficiency of the code and compare its performance with the performance of established standard codes for boundary value problems.     

Maximum‐norm a posteriori error bounds for a collocation method applied to a singularly perturbed reaction–diffusion problem in three dimensions

Collocation with triquadratic C¹‐splines for a singularly perturbed reaction–diffusion problem in three dimension is studied. A posteriori error bound in the maximum norm is derived for the collocation method on arbitrary tensor‐product meshes which is robust in the perturbation parameter. Numerical results are presented that support our theoretical estimate.     

Numerical solution of multiterm variable‐order fractional differential equations via shifted Legendre polynomials

In this paper, shifted Legendre polynomials will be used for constructing the numerical solution for a class of multiterm variable‐order fractional differential equations. In the proposed method, the shifted Legendre operational matrix of the fractional variable‐order derivatives will be investigated. The fundamental problem is reduced to an algebraic system of equations using the constructed matrix and the collocation technique, which can be solved numerically. The error estimate of the proposed method is investigated. Some numerical examples are presented to prove the applicability, generality, and accuracy of the suggested method.