Strong stability preserving general linear methods
DOI10.1007/s10915-014-9961-7zbMath1329.65164OpenAlexW2053962514MaRDI QIDQ898428
Giuseppe Izzo, Zdzisław Jackiewicz
Publication date: 9 December 2015
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-014-9961-7
monotonicitynumerical examplesgeneral linear methodstwo-step Runge-Kutta methodsstrong stability preservingCourant-Friedrichs-Levy conditionmultistep multistage methodsShu-Osher representation
Nonlinear ordinary differential equations and systems (34A34) Stability and convergence of numerical methods for ordinary differential equations (65L20) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06)
Related Items (23)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of algebraically stable dimsims
- Order conditions for general linear methods
- On high order strong stability preserving Runge-Kutta and multi step time discretizations
- High order strong stability preserving time discretizations
- Numerical treatment of O.D.Es.: The theory of A-methods
- Strong stability of singly-diagonally-implicit Runge-Kutta methods
- Optimal implicit strong stability preserving Runge-Kutta methods
- Convergence and order reduction of Runge-Kutta schemes applied to evolutionary problems in partial differential equations
- Efficient implementation of essentially nonoscillatory shock-capturing schemes
- Convergence analysis of one-step schemes in the method of lines
- Contractivity of Runge-Kutta methods
- Diagonally-implicit multi-stage integration methods
- A new approach to error estimation for general linear methods
- Implementation of DIMSIMs for stiff differential systems
- Unconditionally stable general linear methods for ordinary differential equations
- On strong stability preserving time discretization methods
- Stepsize restrictions for total-variation-boundedness in general Runge--Kutta procedures
- Elements of a general theory of composite integration methods
- Construction of general linear methods with Runge-Kutta stability properties
- Explicit general linear methods with inherent Runge--Kutta stability
- High-order linear multistep methods with general monotonicity and boundedness properties
- Optimal strong-stability-preserving time-stepping schemes with fast downwind spatial discretizations
- General linear methods with external stages of different orders
- Monotonicity for Runge-Kutta methods: inner product norms
- Strong Stability-Preserving High-Order Time Discretization Methods
- Optimal Explicit Strong-Stability-Preserving General Linear Methods
- Computation of optimal monotonicity preserving general linear methods
- Strong Stability Preserving Two-step Runge–Kutta Methods
- Solving Ordinary Differential Equations I
- On monotonicity and boundedness properties of linear multistep methods
- Stepsize Conditions for General Monotonicity in Numerical Initial Value Problems
- Non-linear stability of a general class of differential equation methods
- Analysis of Fixed-Stepsize Methods
- Implementation of Diagonally Implicit Multistage Integration Methods for Ordinary Differential Equations
- Monotonicity-Preserving Linear Multistep Methods
- Finite Volume Methods for Hyperbolic Problems
- Stepsize Restrictions for the Total-Variation-Diminishing Property in General Runge--Kutta Methods
- The Runge–Kutta Theory in a Nutshell
- A New Theoretical Approach to Runge–Kutta Methods
- A New Class of Optimal High-Order Strong-Stability-Preserving Time Discretization Methods
- An extension and analysis of the Shu-Osher representation of Runge-Kutta methods
- A General Class of Two-Step Runge–Kutta Methods for Ordinary Differential Equations
- The Theoretical Accuracy of Runge–Kutta Time Discretizations for the Initial Boundary Value Problem: A Study of the Boundary Error
- Solving Ordinary Differential Equations II
- Highly Efficient Strong Stability-Preserving Runge–Kutta Methods with Low-Storage Implementations
- Representations of Runge--Kutta Methods and Strong Stability Preserving Methods
- Numerical Methods for Ordinary Differential Equations
- A reliable error estimation for diagonally implicit multistage integration methods
- The common basis of the theories of linear cyclic methods and Runge-Kutta methods
This page was built for publication: Strong stability preserving general linear methods