A Nonexistence Theorem for Explicit A-Stable Methods
From MaRDI portal
Publication:4045541
Cited in
(7)- Designing stable neural networks using convex analysis and ODEs
- A general class of second-order \(L\)-stable explicit numerical methods for stiff problems
- Asymptotic stability and discretization on an infinite interval
- Very high-order A-stable stiffly accurate diagonally implicit Runge-Kutta methods with error estimators
- An algebraic test forA 0-stability
- P-stable and P[\(\alpha\),\(\beta]\)-stable integration/interpolation methods in the solution of retarded differential-difference equations
- Symmetric-adjoint and symplectic-adjoint Runge-Kutta methods and their applications
This page was built for publication: A Nonexistence Theorem for Explicit A-Stable Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4045541)