Opuscula Math. 26, no. 2 (2006), 269-287

 
Opuscula Mathematica

The numerical solution of nonlinear two-point boundary value problems using iterated deferred correction - a survey

Jeff R. Cash

Abstract. The use of iterated deferred correction has proved to be a very efficient approach to the numerical solution of general first order systems of nonlinear two-point boundary value problems. In particular the two high order codes TWPBVP.f, based on mono-implicit Runge-Kutta (MIRK) formulae, and TWPBVPL.f based on Lobatto Runge-Kutta formulae as well as the continuation codes ACDC.f and COLMOD.f are now widely used. In this survey we describe some of the problems involved in the derivation of efficient deferred correction schemes. In particular we consider the construction of high order methods which preserve the stability of the underlying formulae, the choice of the mesh choosing algorithm which is based both on local accuracy and conditioning, and the computation of continuous solutions.

Keywords: deferred correction, boundary value problems, conditioning, mesh selection.

Mathematics Subject Classification: 65L05, 65L06, 65L20.

Full text (pdf)

  • Jeff R. Cash
  • Imperial College, South Kensington, Department of Mathematics, London SW7, England
  • Received: 2005-10-21.
Opuscula Mathematica - cover

Cite this article as:
Jeff R. Cash, The numerical solution of nonlinear two-point boundary value problems using iterated deferred correction - a survey, Opuscula Math. 26, no. 2 (2006), 269-287

Download this article's citation as:
a .bib file (BibTeX),
a .ris file (RefMan),
a .enw file (EndNote)
or export to RefWorks.

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.