IDeC — Convergence independent of error asymptotics

The present paper is concerned with the method of Iterated Defect Correction (IDeC) for two-point boundary value problems. We investigate the contractive behaviour of the IDeC iteration in a completely discrete setting. Our results (which are a generalization of classical results based on asymptotic expansions of the discretization error) imply the stability of the collocation method which defines the fixed point of the IDeC iteration.     

Modified Defect Correction Algorithms for ODEs. Part I: General Theory

The well-known method of Iterated Defect Correction (IDeC) is based on the following idea: Compute a simple, basic approximation and form its defect w.r.t. the given ODE via a piecewise interpolant. This defect is used to define an auxiliary, neighboring problem whose exact solution is known. Solving the neighboring problem with the basic discretization scheme yields a global error estimate. This can be used to construct an improved approximation, and the procedure can be iterated. The fixed point of such an iterative process corresponds to a certain collocation solution. We present a variety of modifications to this algorithm. Some of these have been proposed only recently, and together they form a family of iterative techniques, each with its particular advantages. These modifications are based on techniques like defect quadrature (IQDeC), defect interpolation (IPDeC), and combinations thereof. We investigate the convergence on locally equidistant and nonequidistant grids and show how superconvergent approximations can be obtained. Numerical examples illustrate our considerations. The application to stiff initial value problems will be discussed in Part II of this paper.     

Analysis of a defect correction method for geometric integrators

We discuss a new variant of Iterated Defect Correction (IDeC), which increases the range of applicability of the method. Splitting methods are utilized in conjunction with special integration methods for Hamiltonian systems, or other initial value problems for ordinary differential equations with a particular structure, to solve the neighboring problems occurring in the course of the IDeC iteration. We demonstrate that this acceleration technique serves to rapidly increase the convergence order of the resulting numerical approximations, up to the theoretical limit given by the order of certain superconvergent collocation methods. This project was supported by the Special Research Program SFB F011 ‘AURORA’ of the Austrian Science Fund FWF.     

Iterated defect correction for the efficient solution of stiff systems of ordinary differential equations

Iterated Defect Correction (IDeC)-methods based on the implicit Euler scheme are shown to have a fixed point. This fixed point coincides with the solution of certain implicit multi-stage Runge-Kutta methods (equivalent to polynomial collocation). Sufficient conditions for the convergence of the iterates to the fixed point are given for linear problems. These results indicate that for a large variety of general non-linear stiff problems, fixed-point-convergence can be expected, and moreover they indicate that the rate of convergence to the fixed point is very high for very stiff problems. Thus the proposed methods combine the high orders and the high accuracy of multistage-methods with the low computational effort of single-stage methods.     

Modified defect correction algorithms for ODEs. Part II: Stiff initial value problems

As shown in part I of this paper and references therein, the classical method of Iterated Defect Correction (IDeC) can be modified in several nontrivial ways, extending the flexibility and range of applications of this approach. The essential point is an adequate definition of the defect, resulting in a significantly more robust convergence behavior of the IDeC iteration, in particular, for nonequidistant grids. The present part II is devoted to the efficient high-order integration of stiff initial value problems. By means of model problem investigation and systematic numerical experiments with a set of stiff test problems, our new versions of defect correction are systematically evaluated, and further algorithmic measures are proposed for the stiff case. The performance of the different variants under consideration is compared, and it is shown how strong coupling between non-stiff and stiff components can be successfully handled. AMS subject classification 65L05 Supported by the Austrian Research Fund (FWF) grant P-15030.     

The method of successive updated iterated defect correction and its application to second kind volterra integral equations

We present a new method for the numerical solution of Volterra integral equations of the second kind. This method is based on the technique of Iterated Defect Correction. Numerical examples are given to demonstrate the power of our method.Based on his research at Indian Institute of Technology, Kanpur, India.     

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.     

Extrapolation methods in Lie groups

Summary. The numerical solution of differential equations on Lie groups by extrapolation methods is investigated. The main principles of extrapolation for ordinary differential equations are extended on the general case of differential equations in noncommutative Lie groups. An asymptotic expansion of the global error is given. A symmetric method is given and quadratic asymptotic expansion of the global error is proved. The theoretical results are verified by numerical experiments. Received September 27, 1999 / Revised version received February 14, 2000 / Published online April 5, 2001     

Local theory of extrapolation methods

In this paper we discuss the theory of one-step extrapolation methods applied both to ordinary differential equations and to index 1 semi-explicit differential-algebraic systems. The theoretical background of this numerical technique is the asymptotic global error expansion of numerical solutions obtained from general one-step methods. It was discovered independently by Henrici, Gragg and Stetter in 1962, 1964 and 1965, respectively. This expansion is also used in most global error estimation strategies as well. However, the asymptotic expansion of the global error of one-step methods is difficult to observe in practice. Therefore we give another substantiation of extrapolation technique that is based on the usual local error expansion in a Taylor series. We show that the Richardson extrapolation can be utilized successfully to explain how extrapolation methods perform. Additionally, we prove that the Aitken-Neville algorithm works for any one-step method of an arbitrary order s, under suitable smoothness.     

Drawdown in prolate spheroidal–spherical coordinates obtained via Green’s function and perturbation methods

When investigating aquifer behaviour it is important to note that there exists a close relationship between the geometrical properties of the aquifer and the behaviour of the solution. In this paper our concern is to solve the flow equation described by prolate spheroidal coordinates by means of perturbation and the Green’s function method, where the spheroid is considered to be a perturbation of a sphere. We transformed the spheroidal coordinates to spherical polar coordinates in the limit, as the shape factor tends to zero. The new groundwater flow equation is solved via an asymptotic parameter expansion and the Green’s function method. The approximate solution of the new equation is compared with experimental data from real world. To take into account the error committed while approximating, we estimate the error in the asymptotic expansion. The error functions obtained suggest that the error would be very small for the shape factor tending to zero if the first two terms of the expansion are taken as an approximation.     

Asymptotic error expansion for the Nyström method for nonlinear Fredholm integral equations of the second kind

In this paper the asymptotic error expansion for the Nyström method for one-dimensional nonlinear Fredholm integral equations of the second kind is considered. We show that the Nyström solution admits an error expansion in powers of the step-sizeh. Thus Richardson's extrapolation can be performed on the solution, and this will greatly increase the accuracy of the numerical solution.The project has been supported by the National Natural Science Foundation of China.     

Error bounds for asymptotic approximations of the partition function

We consider Markovian queueing models with a finite number of states and a product form solution for its steady state probability distribution. Starting from the integral representation for the partition function in complex space we construct error bounds for its asymptotic expansion obtained by the saddle point method. The derivation of error bounds is based on an idea by Olver applicable to integral transforms with an exponentially decaying kernel. The bounds are expressed in terms of the supremum of a certain function and are asymptotic to the absolute value of the first neglected term in the expansion as the large parameter approaches infinity. The application of these error bounds is illustrated for two classes of queueing models: loss systems and single chain closed queueing networks.     

A Small Noise Asymptotic Expansion for Young SDE Driven by Fractional Brownian Motion: A Sharp Error Estimate With Malliavin Calculus

This article shows an analytically tractable small noise asymptotic expansion with a sharp error estimate for the expectation of the solution to Young’s pathwise stochastic differential equations (SDEs) driven by fractional Brownian motions with the Hurst index H > 1/2. In particular, our asymptotic expansion can be regarded as small noise and small time asymptotics by the error estimate with Malliavin culculus. As an application, we give an expansion formula in one-dimensional general Young SDE driven by fractional Brownian motion. We show the validity of the expansion through numerical experiments.     

Numerical solution by LMMs of stiff delay differential systems modelling an immune response

Summary. We consider the application of linear multistep methods (LMMs) for the numerical solution of initial value problem for stiff delay differential equations (DDEs) with several constant delays, which are used in mathematical modelling of immune response. For the approximation of delayed variables the Nordsieck's interpolation technique, providing an interpolation procedure consistent with the underlying linear multistep formula, is used. An analysis of the convergence for a variable-stepsize and structure of the asymptotic expansion of global error for a fixed-stepsize is presented. Some absolute stability characteristics of the method are examined. Implementation details of the code DIFSUB-DDE, being a modification of the Gear's DIFSUB, are given. Finally, an efficiency of the code developed for solution of stiff DDEs over a wide range of tolerances is illustrated on biomedical application model. Received March 23, 1994 / Revised version received March 13, 1995     

二维非线性Volterra积分方程数值解的渐近展开及其外推

本文讨论了求解二维非线性Ｖｏｌｔｅｒｒａ积分方程的Ｎｙｓｔｒｏｍ方法，得到了数值解的逐项渐近展开。从而可进行Ｒｉｃｈａｒｄｓｏｎ外推，提高数值解的精度。     

迁移方程的扩散近似的收敛性

导出了迁移方程的扩散近似方程．说明了它的离散纵标方法在区间内和边界上都有扩散极限，它的解关于一致地收敛于迁移方程的解．其收敛性的证明是依据其渐近扩散展开式，在边界层上得到的误差估计逼近其离散纵标方法的解．     

Superconvergence and asymptotic expansions for linear finite element approximations on crisscross mesh

In this paper, we discuss the error estimation of the linear finite element solution on criss-cross mesh. Using space orthogonal decomposition techniques, we obtain an asymptotic expansion and superconvergence results of the finite element solution. We first prove that the asymptotic expansion has different forms on the two kinds of nodes and then derive a high accuracy combination formula of the approximate derivatives.     

一类小周期椭圆方程的三重尺度渐近分析

利用三重尺度方法对一类小周期椭圆方程进行了三重尺度渐近展开分析,构造了对应的三重尺度形式渐近展开式,得到了均匀化常数和均匀化方程.在形式渐近展开的基础上,构造了对应边值问题解的三重尺度渐近近似解,并分析了对应三重尺度形式渐近误差估计.     

Superconvergence and asymptotic expansions for linear finite element approximations on criss-cross mesh

In this paper, we discuss the error estimation of the linear finite element solution on criss-cross mesh. Using space orthogonal decomposition techniques, we obtain an asymptotic expansion and superconvergence results of the finite element solution. We first prove that the asymptotic expansion has different forms on the two kinds of nodes and then derive a high accuracy combination formula of the approximate derivatives.     

Richardson extrapolation of iterated discrete Galerkin solution for two-dimensional Fredholm integral equations

In this paper, we study the numerical solution of two-dimensional Fredholm integral equation by discrete Galerkin and iterated discrete Galerkin method. We are able to derive an asymptotic error expansion of the iterated discrete Galerkin solution. This expansion covers arbitrarily high powers of the discretization parameters if the solution of the integral equation is smooth. The expansion gives rise to Richardson-type extrapolation schemes which rapidly improve the original rate of the convergence. Numerical experiments confirm our theoretical results.