Predictor–corrector method
Algorithms in numerical analysis
In numerical analysis, predictor–corrector methods belong to a class of algorithms designed to integrate ordinary differential equations – to find an unknown function that satisfies a given differential equation. All such algorithms proceed in two steps: The initial, "prediction" step, starts from a function fitted to the function-values and derivative-values at a preceding set of points to extrapolate ("anticipate") this function's value at a subsequent, new point.
Nº Q2650267 ★
Common · Knowledge
Predictor–corrector method
Algorithms in numerical analysis
In numerical analysis, predictor–corrector methods belong to a class of algorithms designed to integrate ordinary differential equations – to find an unknown function that satisfies a given differential equation. All such algorithms proceed in two steps: The initial, "prediction" step, starts from a function fitted to the function-values and derivative-values at a preceding set of points to extrapolate ("anticipate") this function's value at a subsequent, new point.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In numerical analysis, predictor–corrector methods belong to a class of algorithms designed to integrate ordinary differential equations – to find an unknown function that satisfies a given differential equation. All such algorithms proceed in two steps: The initial, "prediction" step, starts from a function fitted to the function-values and derivative-values at a preceding set of points to extrapolate ("anticipate") this function's value at a subsequent, new point. The next, "corrector" step refines the initial approximation by using the predicted value of the function and another method to interpolate that unknown function's value at the same subsequent point.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
B
Backward Euler method
Numerical method for solving differential equations
Nº Q2736820 ★★
Not listed
-
Euler method
An explicit, first-order method for numerically solving ordinary differential equations
Nº Q868454 ★★★
Not listed
-
Fixed-point iteration
Root-finding algorithm
Nº Q1030759 ★
Not listed
-
M
Method of undetermined coefficients
Approach for finding solutions of nonhomogeneous ordinary differential equations
Nº Q1036452 ★
Not listed
-
Newton's method
Algorithm for finding a zero of a function
Nº Q374195 ★★★
Not listed
-
Forward–backward algorithm
Hidden Markov model inference algorithm which computes the posterior marginals of all hidden state variables given a sequence of observations, making use of dynamic programming to make only 2 passes: one forward, one backward
Nº Q4909 ★
Not listed