Approximating Runge-Kutta matrices by triangular matrices
From MaRDI portal
Nonlinear ordinary differential equations and systems (34A34) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Multiple scale methods for ordinary differential equations (34E13) Numerical methods for initial value problems involving ordinary differential equations (65L05)
Recommendations
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 50395 (Why is no real title available?)
- An Iteration Scheme for Implicit Runge—Kutta Methods
- Iterated Runge–Kutta Methods on Parallel Computers
- Triangularly Implicit Iteration Methods for ODE-IVP Solvers
Cited in
(7)- Fast solution of fully implicit Runge-Kutta and discontinuous Galerkin in time for numerical PDEs. I: The linear setting
- Generalized Kronecker product splitting iteration for the solution of implicit Runge-Kutta and boundary value methods.
- Fast solution of fully implicit Runge-Kutta and discontinuous Galerkin in time for numerical PDEs. II: Nonlinearities and DAEs
- CWI contributions to the development of parallel Runge-Kutta methods
- A splitting preconditioner for the iterative solution of implicit Runge-Kutta and boundary value methods
- Kronecker product splitting preconditioners for implicit Runge-Kutta discretizations of viscous wave equations
- A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta-type methods
This page was built for publication: Approximating Runge-Kutta matrices by triangular matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1359972)