general linear methods

General linear methods (GLMs) are a large class of numerical methods used to obtain numerical solutions to ordinary differential equations. They include multistage Runge–Kutta methods that use intermediate collocation points, as well as linear multistep methods that save a finite time history of the solution. John C. Butcher originally coined this term for these methods, and has written a series of review papers

a book chapter
and a textbook
on the topic. His collaborator, Zdzislaw Jackiewicz also has an extensive textbook on the topic. The original class of methods were originally proposed by
Butcher (1965), Gear (1965) and Gragg and Stetter (1964).

Some definitions

Numerical methods for first-order ordinary differential equations approximate solutions to initial value problems of the form

: $y' = f(t,y), \quad y(t_0) = y_0.$

The result is approximations for the value of $y(t)$ at discrete times $t_i$:

: $y_i \approx y(t_i) \quad\text\quad t_i = t_0 + i h,$

where ''h'' is the time step (sometimes referred to as $\Delta t$).

A description of the method

We follow Butcher (2006), pps 189–190 for our description,
although we note that this method can be found elsewhere.

General linear methods make use of two integers, $r$, the number of time points in history and $s$, the number of collocation points. In the case of $r=1$, these methods reduce to classical Runge–Kutta methods,
and in the case of $s=1$, these methods reduce to linear multistep methods.

Stage values $Y_i$ and stage derivatives, $F_i, i=1,2,\dots s$ are computed from approximations, $y_i^, i=1, \dots, r$, at time step $n$:

:
y^ =
\left \begin
y_1^ \\
y_2^ \\
\vdots \\
y_r^ \\
\end
\right \quad
y^ =
\left \begin
y_1^ \\
y_2^ \\
\vdots \\
y_r^ \\
\end
\right \quad
Y =
\left \begin
Y_1 \\
Y_2 \\
\vdots \\
Y_s
\end
\right \quad
F =
\left \begin
F_1 \\
F_2 \\
\vdots \\
F_s
\end
\right =
\left \begin
f(Y_1) \\
f(Y_2) \\
\vdots \\
f(Y_s)
\end
\right

The stage values are defined by two matrices, A = _ and U = u_ /math>:

:$Y_i = \sum_^s a_ h F_j + \sum_^r u_ y_j^, \qquad i=1,2, \dots, s,$

and the update to time $t^n$ is defined by two matrices, B = _ and V = _:

:$y_i^ = \sum_^s b_ h F_j + \sum_^r v_ y_j^, \qquad i=1, 2, \dots, r.$

Given the four matrices, $A, U, B$ and $V$, one can compactly write the analogue of a Butcher tableau as,

:
\left \begin
Y \\
y^
\end \right=
\left \begin
A \otimes I & U \otimes I \\
B \otimes I & V \otimes I
\end \right\left \begin
h F \\
y^
\end \right

where $\otimes$ stands for the
tensor product.

Examples

We present an example described in (Butcher, 1996). This method consists of a single 'predicted' step, and 'corrected' step, that uses extra information about the time history, as well as a single intermediate stage value.

An intermediate stage value is defined as something that looks like it came from a linear multistep method:

:$y^*_ = y_ + h \left( \frac9 8 f( y_ ) + \frac3 8 f( y_ ) \right).$

An initial 'predictor' $y^*_n$ uses the stage value $y^*_$ together with two pieces of time history:

:$y^*_n = \frac y_ - \frac y_ + h \left( \frac f( y^*_ ) - 4 f( y_ ) - \frac f( y_ ) \right),$

and the final update is given by:

:$y_n = \frac y_ - \frac y_ + h \left( \frac f( y^*_n ) + \frac f( y^*_ ) + \frac f( y_ ) - \frac f( y_ ) \right).$

The concise table representation for this method is given by:

:$\left[ \begin 0 & 0 & 0 & 0 & 1 & \frac & \frac \\ \frac & 0 & 0 & \frac & -\frac & -4 & -\frac \\ \frac & \frac & 0 & \frac & -\frac & \frac & -\frac \\ \hline \frac & \frac & 0 & \frac & -\frac & \frac & -\frac \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 1 & 0 \\ \end \right].$

See also

*Runge–Kutta methods
*Linear multistep methods
*Numerical methods for ordinary differential equations

Notes

References

*
*
*
* .

External links

General Linear Methods

{{Numerical integrators

Numerical differential equations