Predictors and Correctors
We use a predictor-corrector scheme to track paths. These are the predictors and correctors currently available.
The following predictors are currently implemented.
This uses the explicit Euler method for prediction, also known as the tangent predictor.
The Heun predictor of order 2.
The Ralston predictor of order 2.
The classical Runge-Kutta predictor of order 3.
The classical Runge-Kutta predictor of order 4.
This uses a Padé-approximation of type (2,1) for prediction.
A predictor which does no prediction step, i.e., it just returns the input as its prediction.
The following correctors are currently implemented.
An ordinary Newton's method. If
true, then for the last iteration the previously Jacobian will be used. This uses an LU-factorization for square systems and a QR-factorization for overdetermined.