Ralston

Ralston's time integration method.

Ralston's time integration method is second-order accurate in time. It is a two-step explicit method and a special case of the 2nd-order Runge-Kutta method. It is obtained through an error minimization process and has been shown to outperform other 2nd-order explicit Runge-Kutta methods, see Ralston (1962).

Description

With , the vector of nonlinear variables, and , a nonlinear operator, we write the PDE of interest as:

Using for the current time step and for the previous step, Ralston's method can be written:

This method can be expressed as a Runge-Kutta method with the following Butcher Tableau:

warningwarning

All kernels except time-(derivative)-kernels should have the parameter implicit=false to use this time integrator.

warningwarning

ExplicitRK2-derived TimeIntegrators ExplicitMidpoint, Heun, Ralston) and other multistage TimeIntegrators are known not to work with Materials/AuxKernels that accumulate 'state' and should be used with caution.

Input Parameters

  • control_tagsAdds user-defined labels for accessing object parameters via control logic.

    C++ Type:std::vector<std::string>

    Controllable:No

    Description:Adds user-defined labels for accessing object parameters via control logic.

  • enableTrueSet the enabled status of the MooseObject.

    Default:True

    C++ Type:bool

    Controllable:No

    Description:Set the enabled status of the MooseObject.

References

  1. Anthony Ralston. Runge-kutta methods with minimum error bounds. Math. Comput., 80:431–437, 1962. doi:10.1090/S0025-5718-1962-0150954-0.[BibTeX]