Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

P. J. Prince

Theory of Computation

P. J. Prince is the co-originator, with John R. Dormand, of the Dormand-Prince method, an embedded Runge-Kutta method for solving ordinary differential equations. The method has seven stages but uses only six function evaluations per step because of the First Same As Last property, in which the last stage is evaluated at the same point as the first stage of the next step. Dormand and Prince chose the coefficients of their method to minimize the error of the fifth-order solution, so the method suits local extrapolation. It is the default method in the ode45 solver of MATLAB and GNU Octave and an option in the SciPy and Julia ODE libraries.

Connections

Credited

Source Dormand-Prince method (Wikipedia)

In Field

Source Dormand-Prince method (Wikipedia)

Invented By

Source Dormand-Prince method (Wikipedia)
Sources
Dormand-Prince method (Wikipedia)
  • In Field: Computational Science, Lead
    Dormand and Prince chose the coefficients of their method to minimize the error of the fifth-order solution.
  • In Group: Algorithm Design and Analysis, Lead
    Dormand and Prince chose the coefficients of their method to minimize the error of the fifth-order solution.
  • Credited: Dormand-Prince method, Lead
    Dormand and Prince chose the coefficients of their method to minimize the error of the fifth-order solution.
  • Invented By: Dormand-Prince method, Lead
    Dormand and Prince chose the coefficients of their method to minimize the error of the fifth-order solution.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.