Explicit pseudo two-step runge-kutta methods for parallel computers<sup>∗</sup> (Q4935391)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1395870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Explicit pseudo two-step runge-kutta methods for parallel computers<sup>∗</sup> |
scientific article; zbMATH DE number 1395870 |
Statements
Explicit pseudo two-step runge-kutta methods for parallel computers<sup>∗</sup> (English)
0 references
5 October 2000
0 references
parallel computation
0 references
order conditions
0 references
numerical experiments
0 references
explicit pseudo two-step Runge-Kutta methods
0 references
collocation
0 references
stability
0 references
comparisons
0 references
0 references
0.9687835
0 references
0.96102124
0 references
0.94742614
0 references
0.9402979
0 references
0.9371451
0 references
0.93657833
0 references
0.9270984
0 references
This paper is concerned with a new class of explicit pseudo two-step Runge-Kutta methods of arbitrarily high-order for nonstiff initial value problems. By using collocation techniques \(s\)-stage methods are deduced possessing order \(p\) equal to \(s+1\) or \(s\), whereby each of the \(s\) function evaluations can be computed in parallel. Order conditions and stability properties are investigated. Numerical experiments with such methods up to order ten and comparisons with other parallel and sequential methods available in the literature are presented.
0 references
