Order barrier for low-storage DIRK methods with positive weights

DOI10.1007/s10915-017-0540-6zbMath1398.65171OpenAlexW2748678213MaRDI QIDQ1747633

Inmaculada Higueras, Teo Roldán

Publication date: 26 April 2018

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/2454/34791

zbMATH Keywords

compositionstiff problemsRunge-Kuttatime discretizationsymplecticlow-storageDIRKdiagonally implicit

Mathematics Subject Classification ID

Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Numerical methods for stiff equations (65L04)

Related Items (1)

Diagonally implicit Runge-Kutta methods for stiff ODEs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some new low storage implementations of time advancing Runge-Kutta methods
• Runge-Kutta methods with minimum storage implementations
• Strong stability of singly-diagonally-implicit Runge-Kutta methods
• Low-storage Runge-Kutta schemes
• Contractivity of Runge-Kutta methods
• Low-storage, explicit Runge-Kutta schemes for the compressible Navier-Stokes equations
• Additive semi-implicit Runge-Kutta methods for computing high-speed nonequilibrium reactive flows
• Construction of additive semi-implicit Runge-Kutta methods with low-storage requirements
• Composite Exponential Approximations
• Highly Efficient Strong Stability-Preserving Runge–Kutta Methods with Low-Storage Implementations
• Geometric Numerical Integration

This page was built for publication: Order barrier for low-storage DIRK methods with positive weights