Dormand–Prince method

an embedded Runge-Kutta method for numerically solving differential equations
Thing embedded_runge_kutta_method Q5298067
Press Enter · cited answer in seconds

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]

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [3] . wikidata.org.
  2. [4] . wikidata.org.
  3. [5] . wikidata.org.
  4. [6] . wikidata.org.
  5. [7] . wikidata.org.
  6. [8] . wikidata.org.

Class ancestry

  1. [1] . Wikidata. wikidata.org.

Aggregate / graph-position facts

  1. [2] . Wikimedia Foundation. dumps.wikimedia.org.
  2. [9] . Wikidata sitelinks. wikidata.org.
  3. [10] . Wikidata aliases. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Dormand–Prince method. Retrieved May 3, 2026, from https://4ort.xyz/entity/dormand-prince-method
MLA “Dormand–Prince method.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/dormand-prince-method.
BibTeX @misc{4ortxyz_dormand-prince-method_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Dormand–Prince method}}, year = {2026}, url = {https://4ort.xyz/entity/dormand-prince-method}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Dormand–Prince method — https://4ort.xyz/entity/dormand-prince-method (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/dormand-prince-method · Last refreshed: