Computing Atlas

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

Cash-Karp method

Numerical Algorithm

The Cash-Karp method is a numerical method for solving ordinary differential equations, proposed by Professor Jeff R. Cash of Imperial College London and Alan H. Karp of the IBM Scientific Center. It is a member of the Runge-Kutta family of ODE solvers. More specifically, it uses six function evaluations to calculate both a fourth-order and a fifth-order accurate solution, and the difference between the two is taken as the error estimate of the fourth-order solution. That estimate is very convenient for adaptive stepsize integration algorithms, which shrink or grow the step as the error demands. Similar embedded integration methods include the Fehlberg (RKF) and Dormand-Prince (RKDP) methods.

Connections

Credited To

Jeff R. Cash, Pioneers
Source Cash-Karp method (Wikipedia)

In Field

Source Cash-Karp method (Wikipedia)
Sources
Cash-Karp method (Wikipedia)
  • In Group: Numerical Integration and Differential Equations, Lead paragraph
    is a method for solving ordinary differential equations (ODEs)
  • In Field: Computational Science, Lead paragraph [in-field]
    In numerical analysis, the Cash-Karp method
  • Credited To: Jeff R. Cash, Lead paragraph
    proposed by Professor Jeff R. Cash
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.