Nordsieck methods with computationally verified algebraic stability

DOI10.1016/j.amc.2011.03.096zbMath1217.65145OpenAlexW2037622785MaRDI QIDQ546030

Michał Braś, Zdzisław Jackiewicz

Publication date: 24 June 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.03.096

zbMATH Keywords

order conditionsgeneral linear methodsalgebraic stabilityNordsieck methods

Mathematics Subject Classification ID

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

Related Items (4)

Strong stability preserving transformed DIMSIMs ⋮ Construction of algebraically stable dimsims ⋮ Explicit Nordsieck methods with extended stability regions ⋮ EFFICIENT GENERAL LINEAR METHODS OF HIGH ORDER WITH INHERENT QUADRATIC STABILITY

Uses Software

• RODAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Search for highly stable two-step Runge-Kutta methods
• Algebraically stable diagonally implicit general linear methods
• Algebraically stable general linear methods and the \(G\)-matrix
• The equivalence of algebraic stability and AN-stability
• Explicit general linear methods with inherent Runge--Kutta stability
• Thirty years of G-stability
• Nonlinear stability of general linear methods
• Non-linear stability of a general class of differential equation methods
• Conditions for Positive and Nonnegative Definiteness in Terms of Pseudoinverses

This page was built for publication: Nordsieck methods with computationally verified algebraic stability