Software for ordinary and delay differential equations: Accurate discrete approximate solutions are not enough

  • Authors:
  • W. H. Enright

  • Affiliations:
  • Department of Computer Science, University of Toronto, Toronto, M5S 3G4 Canada

  • Venue:
  • Applied Numerical Mathematics
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Numerical methods for both ordinary differential equations (ODEs) and delay differential equations (DDEs) are traditionally developed and assessed on the basis of how well the accuracy of the approximate solution is related to the specified error tolerance on an adaptively-chosen, discrete mesh. This may not be appropriate in numerical investigations that require visualization of an approximate solution on a continuous interval of interest (rather than at a small set of discrete points) or in investigations that require the determination of the 'average' values or the 'extreme' values of some solution components. In this paper we will identify modest changes in the standard error-control and stepsize-selection strategies that make it easier to develop, assess and use methods which effectively deliver approximations to differential equations (both ODEs and DDEs) that are more appropriate for these type of investigations. The required changes will typically increase the cost per step by up to 40%, but the improvements and advantages gained will be significant. Numerical results will be presented for these modified methods applied to two example investigations (one ODE and one DDE).