Algebraic conditions for stability in Runge-Kutta methods and their certification via semidefinite programming
From MaRDI portal
(Redirected from Publication:6646505)
Recommendations
Cites work
- A fourth-order Runge-Kutta method based on BDF-type Chebyshev approximations
- A special stability problem for linear multistep methods
- Algebraic characterization of A-stable Runge-Kutta methods
- Algebraic Structure of the Weak Stage Order Conditions for Runge–Kutta Methods
- Algebraically Stable and Implementable Runge-Kutta Methods of High Order
- C-polynomials for rational approximation to the exponential function
- Characterization of allA-stable methods of order 2m-4
- Complete Algebraic Characterization of A-Stable Runge–Kutta Methods
- Constructive characterization of A-stable approximations to exp(z) and its connection with algebraically stable Runge-Kutta methods
- Design of DIRK schemes with high weak stage order
- Diagonally implicit Runge-Kutta methods for stiff problems
- Graph implementations for nonsmooth convex programs
- scientific article; zbMATH DE number 4050871 (Why is no real title available?)
- scientific article; zbMATH DE number 3716707 (Why is no real title available?)
- scientific article; zbMATH DE number 940566 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Moments, positive polynomials and their applications
- OnA-stable implicit Runge-Kutta methods
- Provably faster gradient descent via long steps
- Solving Ordinary Differential Equations I
- Stochastic linear-quadratic control via semidefinite programming
- Validated B-series and Runge-Kutta pairs
- Very high-order A-stable stiffly accurate diagonally implicit Runge-Kutta methods with error estimators
This page was built for publication: Algebraic conditions for stability in Runge-Kutta methods and their certification via semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646505)