论文信息 - Starting step size for an ODE solver

Starting step size for an ODE solver

Abstract One of the more critical issues in solving ordinary differential equations by a step-by-step process occurs in the starting phase. Somehow the procedure must be supplied with an initial step size that is on scale for the problem at hand. It must be small enough to yield a reliable solution by the process, but not so small as to significantly affect the efficiency of solution. In this paper, we discuss an algorithm for obtaining a good starting step size and present a subroutine which can be readily used in most ODE solvers.

H. A. Watts

[1] A. Sedgwick,et al. An effective variable-order variable-step adams method. , 1973 .

[2] J. Reid,et al. The Choice of Step Lengths When Using Differences to Approximate Jacobian Matrices , 1974 .

[3] M. K. Gordon,et al. Some numerical experiments with DIFSUB , 1972, SGNM.

[4] C. William Gear. Runge-Kutta Starters for Multistep Methods , 1980, TOMS.

[5] Norman Winarsky,et al. Adaptive numerical differentiation , 1979 .

[6] J. Oliver,et al. An algorithm for numerical differentiation of a function of one real variable , 1980 .

[7] T. E. Hull,et al. Comparing numerical methods for stiff systems of O.D.E:s , 1975 .

[8] T. E. Hull,et al. Comparing Numerical Methods for Ordinary Differential Equations , 1972 .

[9] L. Shampine,et al. Computer solution of ordinary differential equations : the initial value problem , 1975 .

[10] Lawrence F. Shampine. Limiting precision in differential equation solvers. II Sources of trouble and starting a code , 1978 .

[11] Lawrence F. Shampine,et al. The art of writing a Runge-Kutta code. II. , 1979 .

[12] Michael A. Malcolm,et al. Computer methods for mathematical computations , 1977 .