An Iteration Scheme for Implicit Runge—Kutta Methods

DOI10.1093/IMANUM/3.2.127zbMath0525.65052OpenAlexW2080036729MaRDI QIDQ3038530

G. J. Cooper, John C. Butcher

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1093/imanum/3.2.127

zbMATH Keywords

rate of convergenceiterationsuccessive overrelaxationlocal truncation errorsGauss-type methodss-stage implicit Runge-Kutta methods

Mathematics Subject Classification ID

Numerical methods for initial value problems involving ordinary differential equations (65L05)

Related Items (35)

Efficient iterations for Gauss methods on second-order problems ⋮ Variable-order, variable-step methods for second-order initial-value problems ⋮ Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs ⋮ Iterative schemes for three-stage implicit Runge-Kutta methods ⋮ Approximating Runge-Kutta matrices by triangular matrices ⋮ An iterated Radau method for time-dependent PDEs ⋮ Stability of implicit Runge-Kutta methods for nonlinear stiff differential equations ⋮ On the Implementation of Singly Implicit Runge-Kutta Methods ⋮ Some linear stability results for iterative schemes for implicit Runge-Kutta methods ⋮ On the numerical solution of stiff IVPs by Lobatto IIIA Runge-Kutta methods ⋮ Improving the efficiency of the iterative schemes for implicit Runge-Kutta methods ⋮ Blended implicit methods for solving ODE and DAE problems, and their extension for second-order problems ⋮ An embedded formula of the Chebyshev collocation method for stiff problems ⋮ Improved composite implicit time integration method for dynamic analysis of viscoelastic damping systems ⋮ A new one-step method with three intermediate points in a variable step-size mode for stiff differential systems ⋮ Convergence on error correction methods for solving initial value problems ⋮ Efficient eighth order p-stable methods for second order initial value problems ⋮ A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta-type methods ⋮ Efficient implementation of Radau collocation methods ⋮ Efficient implementation of Gauss collocation and Hamiltonian boundary value methods ⋮ Analysis of a Chebyshev-based backward differentiation formulae and relation with Runge–Kutta collocation methods ⋮ Theoretically optimal inexact spectral deferred correction methods ⋮ Some schemes for the implementation of implicit Runge-Kutta methods ⋮ A note on efficient preconditioner of implicit Runge-Kutta methods with application to fractional diffusion equations ⋮ Speeding up Newton-type iterations for stiff problems ⋮ The Hilber–Hughes–Taylor-α (HHT-α) method compared with an implicit Runge–Kutta for second-order systems ⋮ Implementation of high-order implicit Runge-Kutta methods ⋮ An Efficient Fourth Order Implicit Runge-Kutta Algorithm for Second Order Systems ⋮ An efficient implicit Runge-Kutta method for second order systems ⋮ An error embedded method based on generalized Chebyshev polynomials ⋮ Recent advances in linear analysis of convergence for splittings for solving ODE problems ⋮ On the use of parallel processors for implicit Runge-Kutta methods ⋮ A scheme for the implementation of implicit Runge-Kutta methods ⋮ Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems ⋮ Iterative schemes for Gauss methods

This page was built for publication: An Iteration Scheme for Implicit Runge—Kutta Methods