Dormand–Prince method
0 sources
Dormand–Prince method
Summary
Dormand–Prince method is an embedded Runge-Kutta method[1]. It draws 52 Wikipedia views per month (embedded_runge_kutta_method category, ranking #2 of 3).[2]
Key Facts
- Dormand–Prince method's instance of is recorded as embedded Runge-Kutta method[3].
- Dormand–Prince method's time of discovery or invention is recorded as +1980-00-00T00:00:00Z[4].
- Dormand–Prince method's Freebase ID is recorded as /m/0273ydp[5].
- Dormand–Prince method's has characteristic is recorded as number of stages[6].
- Dormand–Prince method's Microsoft Academic ID is recorded as 164991812[7].
- Dormand–Prince method's Butcher tableau is recorded as \begin{array}{l|lllll}0& \1/5&1/5\3/10&3/40&9/40&\4/5&44/45&-56 /15&32/9&\8/9&19372/6561&-25360/2187& 64448/6561&-212/729&\1&9017/3168&-355/33&46732/5247&49/176&-5103/18656&\1&35/384&0&500/1113&125/192&-2187/6784&11/84 \ \hline&35/384&0&500/1113&125/192&-2187/6784&11/84&0 \& 5179/57600&0&7571/16695&393/640&-92097/339200&187/2100&1/40\end{array}[8].
Why It Matters
Dormand–Prince method draws 52 Wikipedia views per month (embedded_runge_kutta_method category, ranking #2 of 3).[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[9] It is known by 6 alternative names across languages and contexts.[10]