Analysis of the Enright-Kamel Partitioning Method for Stiff Ordinary Differential Equations

DOI10.1093/imanum/9.1.1zbMath0659.65069OpenAlexW2083915368MaRDI QIDQ3809147

Desmond J. Higham

Publication date: 1989

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4691b90f864f239b6c122420849b41ae272f5f6f

zbMATH Keywords

partitioningstiff ordinary differential equationsNewton iterationKrylov subspaceimplicit formulae

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Related Items (9)

Jacobi orthogonal approximation with negative integer and its application to ordinary differential equations ⋮ The numerical solution of large systems of stiff IVPs for ODEs ⋮ Legendre-Gauss-Radau collocation method for solving initial value problems of first order ordinary differential equations ⋮ Analysis of a Chebyshev-based backward differentiation formulae and relation with Runge–Kutta collocation methods ⋮ Legendre-tau-Galerkin and spectral collocation method for nonlinear evolution equations ⋮ Integration processes of ordinary differential equations based on Laguerre-Radau interpolations ⋮ Legendre-Gauss collocation methods for ordinary differential equations ⋮ Numerical integration based on Laguerre-Gauss interpolation ⋮ Automatic partitioning in linearly-implicit Runge-Kutta methods

This page was built for publication: Analysis of the Enright-Kamel Partitioning Method for Stiff Ordinary Differential Equations