Runge-Kutta methods with minimum storage implementations

From MaRDI portal
Publication:846600

DOI10.1016/j.jcp.2009.11.006zbMath1183.65093OpenAlexW2072602885MaRDI QIDQ846600

David I. Ketcheson

Publication date: 9 February 2010

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2009.11.006




Related Items (19)

A purely hyperbolic discontinuous Galerkin approach for self-gravitating gas dynamicsConstruction of additive semi-implicit Runge-Kutta methods with low-storage requirementsOptimized explicit Runge-Kutta schemes for high-order collocated discontinuous Galerkin methods for compressible fluid dynamicsCommutator-free Lie group methods with minimum storage requirements and reuse of exponentialsLength-scales for efficient CFL conditions in high-order methods with distorted meshes: application to local-timestepping for \(p\)-multigridImplicit and implicit-explicit strong stability preserving Runge-Kutta methods with high linear orderOn some new low storage implementations of time advancing Runge-Kutta methodsEfficient SSP low-storage Runge-Kutta methodsHigh-order multiderivative time integrators for hyperbolic conservation lawsAn energy conservative \(hp\)-method for Liouville's equation of geometrical opticsOrder barrier for low-storage DIRK methods with positive weightsA unified discontinuous Galerkin framework for time integrationA fourth-order accurate finite volume method for ideal MHD via upwind constrained transportLow-Storage Integral Deferred Correction Methods for Scientific ComputingNew third order low-storage SSP explicit Runge-Kutta methodsStrong stability preserving properties of composition Runge-Kutta schemesThe Picard Integral Formulation of Weighted Essentially Nonoscillatory SchemesOptimal explicit strong stability preserving Runge–Kutta methods with high linear order and optimal nonlinear orderOptimized Runge-Kutta methods with automatic step size control for compressible computational fluid dynamics



Cites Work


This page was built for publication: Runge-Kutta methods with minimum storage implementations