Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems

5,432 citations recorded by the source corpus.

How researchers see this paper

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

A General-Purpose Software Framework for Dynamic Optimization (Een algemene softwareomgeving voor dynamische optimalisatie) (2013, methodology): “For a comprehensive overview of methods, we refer to Hairer, Nørsett and Wanner [107,108].”
Solving Ordinary Differential Equations in R (2012, methodology): “The implicit Runge-Kutta’s ( irk.. ) from this list are not optimally coded; a better implicit Runge-Kutta is the ( radau ) method [11] that will be discussed in Chaps.”
Lyapunov, Bohl and Sacker-Sell Spectral Intervals for Differential-Algebraic Equations (2009, methodology): “…strangeness index, Lyapunov exponent, Bohl exponent, Sacker-Sell spectrum, exponential dichotomy, spectral interval, smooth QR factorization, continuous QR algorithm, discrete QR algorithm, kinematic equivalence, Steklov function AMS(MOS) subject classification: 65L07, 65L80, 34D08, 34D09”
An ETD Crank‐Nicolson method for reaction‐diffusion systems (2012, neutral): “[8]: ∂u ∂t = A + u(2)v − (B + 1)u + α (2)u ∂x2 ∂v ∂t = Bu − u(2)v + α (2)v ∂x2 with 0 ≤ x ≤ 1, A = 1, B = 3, α = 1/50, and boundary conditions u(0, t) = u(1, t) = 1 v(0, t) = v(1, t) = 3 and initial conditions u(x, 0) = 1 + sin(2πx) v(x, 0) = 3.”