On a class of \(P\)-stable mono-implicit Runge-Kutta-Nyström methods (Q1294584): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MIRKDC / rank | |||
Normal rank | |||
Revision as of 17:54, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a class of \(P\)-stable mono-implicit Runge-Kutta-Nyström methods |
scientific article |
Statements
On a class of \(P\)-stable mono-implicit Runge-Kutta-Nyström methods (English)
0 references
14 June 2000
0 references
Mono-implicit Runge-Kutta methods show interesting properties [e.g., see \textit{J. R. Cash} and \textit{A. Singhal}, IMA J. Numer. Anal. 2, 211-227 (1982; Zbl 0488.65031)]. In this paper the concept of mono-implicitness is extended to Runge-Kutta-Nyström (RKN) methods. The aim is to construct \(P\)-stable mono-implicit RKN methods. The conditions of the \(P\)-stability and of the order are developed for these methods, which lead to results on the attainable order. Finally, \(P\)-stable methods with 2, 4 and 6 stages are constructed.
0 references
Runge-Kutta-Nyström methods
0 references
mono-implicit Runge-Kutta methods
0 references
\(P\)-stability
0 references
order
0 references
