<s>
General	B-Algorithm
linear	I-Algorithm
methods	I-Algorithm
(	O
GLMs	O
)	O
are	O
a	O
large	O
class	O
of	O
numerical	B-Algorithm
methods	I-Algorithm
used	O
to	O
obtain	O
numerical	B-Algorithm
solutions	O
to	O
ordinary	O
differential	O
equations	O
.	O
</s>
<s>
They	O
include	O
multistage	O
Runge	B-Algorithm
–	I-Algorithm
Kutta	I-Algorithm
methods	I-Algorithm
that	O
use	O
intermediate	O
collocation	B-Algorithm
points	I-Algorithm
,	O
as	O
well	O
as	O
linear	B-Algorithm
multistep	I-Algorithm
methods	I-Algorithm
that	O
save	O
a	O
finite	O
time	O
history	O
of	O
the	O
solution	O
.	O
</s>
<s>
General	B-Algorithm
linear	I-Algorithm
methods	I-Algorithm
make	O
use	O
of	O
two	O
integers	O
,	O
,	O
the	O
number	O
of	O
time	O
points	O
in	O
history	O
and	O
,	O
the	O
number	O
of	O
collocation	B-Algorithm
points	I-Algorithm
.	O
</s>
<s>
In	O
the	O
case	O
of	O
,	O
these	O
methods	O
reduce	O
to	O
classical	O
Runge	B-Algorithm
–	I-Algorithm
Kutta	I-Algorithm
methods	I-Algorithm
,	O
</s>
<s>
and	O
in	O
the	O
case	O
of	O
,	O
these	O
methods	O
reduce	O
to	O
linear	B-Algorithm
multistep	I-Algorithm
methods	I-Algorithm
.	O
</s>
<s>
An	O
intermediate	O
stage	O
value	O
is	O
defined	O
as	O
something	O
that	O
looks	O
like	O
it	O
came	O
from	O
a	O
linear	B-Algorithm
multistep	I-Algorithm
method	I-Algorithm
:	O
</s>
