Efficient higher order implicit one-step methods for integration of stiff differential equations

DOI10.1007/BF01933583zbMath0448.65047MaRDI QIDQ3894903

Wim M. G. van Bokhoven

Publication date: 1980

Published in: BIT Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

stiff differential equationsimplicit Runge-Kutta methodsoscillatory systemsmultistep formulasimplicit endpoint quadrature formulas

Mathematics Subject Classification ID

Stability and convergence of numerical methods for ordinary differential equations (65L20) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Related Items (29)

Efficient classes of Runge-Kutta methods for two-point boundary value problems ⋮ Relationships among some classes of implicit Runge-Kutta methods and their stability functions ⋮ Complementarity problems in semi-inner product spaces ⋮ Fixed point approach for complementarity problems ⋮ Modulus-based matrix splitting algorithms for the quasi-complementarity problems ⋮ A stability criterion for explicit boundary value Runge-Kutta methods ⋮ On the generation of mono-implicit Runge-Kutta-Nyström methods by mono-implicit Runge-Kutta methods ⋮ Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem ⋮ Pseudo-Hamiltonian system identification ⋮ Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix ⋮ Pseudo-Hamiltonian neural networks with state-dependent external forces ⋮ Iterative algorithms for the linear complementarity problem ⋮ A two-step, fourth-order method with energy preserving properties ⋮ Embedded symmetric nested implicit Runge-Kutta methods of Gauss and Lobatto types for solving stiff ordinary differential equations and Hamiltonian systems ⋮ A preconditioned two-step modulus-based matrix splitting iteration method for linear complementarity problem ⋮ MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems ⋮ Infimum of error bounds for linear complementarity problems of \(\Sigma\)-\textit{SDD} and \(\Sigma_1\)-\textit{SSD} matrices ⋮ Runge-Kutta methods for the solution of stiff two-point boundary value problems ⋮ Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an \(H_+\)-matrix ⋮ Adaptive nested implicit Runge-Kutta formulas of Gauss type ⋮ An iterative scheme for generalized mildly nonlinear complementarity problems ⋮ An iterative technique for generalized strongly nonlinear complementarity problems ⋮ Change of variable method for generalized complementarity problems ⋮ Numerical integration of non-linear two-point boundary-value problems using iterated deferred corrections—I ⋮ On a class of \(P\)-stable mono-implicit Runge-Kutta-Nyström methods ⋮ A variable-step variable-order algorithm for systems of stiff odes ⋮ Mono-implicit Runge-Kutta schemes for the parallel solution of initial value ODEs ⋮ Multiderivative Runge-Kutta processes for two-point boundary value problems ⋮ On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method

Cites Work

• Unnamed Item
• Multistep-multistage-multiderivative methods for ordinary differential equations
• On the Butcher group and general multi-value methods
• Runge-Kutta methods with a multiple real eigenvalue only
• A special family of Runge-Kutta methods for solving stiff differential equations
• High order a-stable methods for the numerical solution of systems of D.E.'s
• Implicit Runge-Kutta Processes

This page was built for publication: Efficient higher order implicit one-step methods for integration of stiff differential equations