Computation of optimal monotonicity preserving general linear methods

DOI10.1090/S0025-5718-09-02209-1zbMath1198.65117OpenAlexW2065376751MaRDI QIDQ3055155

David I. Ketcheson

Publication date: 7 November 2010

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-09-02209-1

Mathematics Subject Classification ID

Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06)

Related Items (22)

Strong stability preserving transformed DIMSIMs ⋮ Strong Stability Preserving Integrating Factor Runge--Kutta Methods ⋮ High order strong stability preserving time discretizations ⋮ Explicit strong stability preserving multistep Runge–Kutta methods ⋮ Strong-stability-preserving 3-stage Hermite-Birkhoff time-discretization methods ⋮ Strong stability preserving Runge-Kutta and linear multistep methods ⋮ Strong stability preserving general linear methods ⋮ Strong stability preserving explicit peer methods ⋮ Stepsize restrictions for boundedness and monotonicity of multistep methods ⋮ ODE-Based Multistep Schemes for Backward Stochastic Differential Equations ⋮ Numerical integration of positive linear differential-algebraic systems ⋮ Strong-stability-preserving additive linear multistep methods ⋮ A Polynomial Formulation of Adaptive Strong Stability Preserving Multistep Methods ⋮ Strong-stability-preserving, Hermite-Birkhoff time-discretization based on \(k\) step methods and 8-stage explicit Runge-Kutta methods of order 5 and 4 ⋮ Rational functions with maximal radius of absolute monotonicity ⋮ Optimal monotonicity-preserving perturbations of a given Runge-Kutta method ⋮ A new class of strong stability preserving general linear methods ⋮ Strong stability preserving integrating factor two-step Runge-Kutta methods ⋮ Computation of optimal linear strong stability preserving methods via adaptive spectral transformations of Poisson-Charlier measures ⋮ Strong Stability Preserving Explicit Linear Multistep Methods with Variable Step Size ⋮ Strong Stability Preserving Time Discretizations: A Review ⋮ Optimal explicit strong stability preserving Runge–Kutta methods with high linear order and optimal nonlinear order

Cites Work

• Unnamed Item
• High-order RKDG methods for computational electromagnetics
• On high order strong stability preserving Runge-Kutta and multi step time discretizations
• High order strong stability preserving time discretizations
• Circle contractive linear multistep methods
• Absolute monotonicity of rational functions occurring in the numerical solution of initial value problems
• Contractivity preserving explicit linear multistep methods
• Efficient implementation of essentially nonoscillatory shock-capturing schemes
• Stability of explicit time discretizations for solving initial value problems
• Contractivity of Runge-Kutta methods
• Strong stability preserving properties of Runge--Kutta time discretization methods for linear constant coefficient operators
• Contractivity in the numerical solution of initial value problems
• Absolute monotonicity of polynomials occuring in the numerical solution of initial value problems
• High-order linear multistep methods with general monotonicity and boundedness properties
• An accurate spectral/discontinuous finite-element formulation of a phase-space-based level set approach to geometrical optics
• Optimal strong-stability-preserving time-stepping schemes with fast downwind spatial discretizations
• Strong Stability-Preserving High-Order Time Discretization Methods
• Solving Ordinary Differential Equations I
• Contractivity-Preserving Implicit Linear Multistep Methods
• The CFL Condition for Spectral Approximations to Hyperbolic Initial-Boundary Value Problems
• Total variation diminishing Runge-Kutta schemes
• Highly Efficient Strong Stability-Preserving Runge–Kutta Methods with Low-Storage Implementations

This page was built for publication: Computation of optimal monotonicity preserving general linear methods