Mono-implicit Runge-Kutta methods can be used to generate implicit Runge-Kutta-Nystr6m (IRKN) methods for the numerical solution of systems of second-order differential equations. The paper is concerned with the investigation of the conditions to be fulfilled by the mono-implicit Runge-Kutta (MIRK)
β¦ LIBER β¦
On the use of parallel processors for implicit Runge-Kutta methods
β Scribed by G. J. Cooper; R. Vignesvaran
- Publisher
- Springer Vienna
- Year
- 1993
- Tongue
- English
- Weight
- 889 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0010-485X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the generation of mono-implicit Runge
On the generation of mono-implicit Runge-Kutta-NystrΓΆm methods by mono-implicit Runge-Kutta methods
β
H De Meyer; G Vanden Berghe; T Van Hecke; M Van Daele
π
Article
π
1997
π
Elsevier Science
π
English
β 1017 KB
On the implementation of implicit Runge-
β
J. C. Butcher
π
Article
π
1976
π
Springer Netherlands
π
English
β 192 KB
A-stable diagonally implicit Runge-Kutta
β
Nguyen huu Cong
π
Article
π
1993
π
Springer US
π
English
β 902 KB
On the D-suitability of implicit Runge-K
β
Jiao-Xun Kuang; Jia-Xiang Xiang
π
Article
π
1989
π
Springer Netherlands
π
English
β 291 KB
On the construction of error estimators
β
Jacques J.B de Swart; Gustaf SΓΆderlind
π
Article
π
1997
π
Elsevier Science
π
English
β 621 KB
For implicit Runge-Kutta methods intended for stiff ODEs or DAEs, it is often difficult to embed a local error estimating method which gives realistic error estimates for stiff/algebraic components. If the embedded method's stability function is unbounded at z = o0, stiff error components are grossl
The order of some implicit Runge-Kutta m
β
J. H. Verner
π
Article
π
1969
π
Springer-Verlag
π
English
β 471 KB