Skip to main content
Log in

Deferred Correction Methods for Initial Value Problems

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

In this paper we derive high order implicit difference methods for large systems of ODE. The methods are based on the deferred correction principle, yielding accuracy of order p by applying the trapezoidal rule p/2 times in each timestep. Numerical experiments demonstrate the efficiency of the method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  • M. Carpenter, D. Gottlieb, S. Abarbanel, and W.-H. Don, The theoretical accuracy of Runge-Kutta time discretizations for the initial boundary value problem: A study of the boundary error, SIAM J. Sci. Comput., 16 (1995), pp. 1241–1252.

    Google Scholar 

  • G. Dahlquist, A special stability problem for linear multistep methods, BIT, 3 (1963), pp. 27–43.

    Google Scholar 

  • J. Daniel, V. Pereyra, and L. Schumaker, Iterated deferred corrections for initial value problems, Acta Cient. Venezolana, 19 (1968), pp. 128–135.

    Google Scholar 

  • A. Dutt, L. Greengard, and V. Rokhlin, Spectral deferred correction methods for ordinary differential equations, BIT, 40 (2000), pp. 241–266.

    Google Scholar 

  • B. Gustafsson and L. Hemmingsson-Frändén, A fast domain decomposition high order Poisson solver, J. Sci. Comput., 14 (1999), pp. 223–243.

    Google Scholar 

  • B. Gustafsson and L. Hemmingsson-Frändén, Implicit high-order difference methods and domain decomposition, Appl. Numer. Math., 33 (2000), pp. 493–500.

    Google Scholar 

  • B. Gustafsson, H.-O. Kreiss, and J. Oliger, Time Dependent Problems and Difference Methods, Wiley, New York, 1995.

    Google Scholar 

  • B. Lindberg, Error estimation and iterative improvement for discretization algorithms, BIT, 20 (1980), pp. 486–500.

    Google Scholar 

  • V. Pereyra, Accelerating the convergence of discretizations algorithms, SIAM J. Numer. Anal., 4 (1967), pp. 508–532.

    Google Scholar 

  • V. Pereyra, Iterated deferred corrections for nonlinear operator equations, Num er. Math., 10 (1967), pp. 316–323.

    Google Scholar 

  • V. Pereyra, Iterated deferred corrections for nonlinear operator equations, Num er. Math., 11 (1968), pp. 111–125.

    Google Scholar 

  • V. Pereyra, Highly accurate numerical solution of quasilinear elliptic boundary-value problems in n dimensions, Math. Comp., 11 (1970), pp. 771–783.

    Google Scholar 

  • V. Pereyra, W. Proskurowski, and O. Widlund, High order fast Laplace solvers for the Dirichlet problem on general regions, Math. Comp., 31 (1977), pp. 1–16.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gustafsson, B., Kress, W. Deferred Correction Methods for Initial Value Problems. BIT Numerical Mathematics 41, 986–995 (2001). https://doi.org/10.1023/A:1021937227950

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021937227950

Navigation