Numerical Solution of Ordinary Differential Equations.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Exponentially fitted variable two-step BDF algorithm for first order ODEs☆ (2003, background): “The system is discussed in [13] to illustrate the stiffness, which increases with x .”
A multirate time stepping strategy for stiff ordinary differential equations (2007, background): “This form of variable step size selection is standard; see for example [8, 14].”
Impact-Angle-Constrained Suboptimal Model Predictive Static Programming Guidance of Air-to-Ground Missiles (2012, methodology): “The dynamics and guess history having been defined, the following algorithmic steps are performed in every guidance cycle: 1) Use the fourth-order Runge-Kutta (RK4) method [26] to propagate state dynamics using the preceding control history, U k , until the separation between the missile and target ”
Solving ODEs with MATLAB (2003, methodology): “Proofs of these technical matters can be found in Kierzenka (1998) and Kierzenka & Shampine (2001). In passing, we remark that a simple shooting code can also be described as controlling residuals.”
Numerical Solution of Ordinary Differential Equations: Atkinson/Numerical (2009, methodology): “Also, see Shampine [72] for a thorough study of one-step and multistep methods and of their implementation in computer software.”