<s>
Beeman	B-Algorithm
's	I-Algorithm
algorithm	I-Algorithm
is	O
a	O
method	O
for	O
numerically	B-Algorithm
integrating	I-Algorithm
ordinary	O
differential	O
equations	O
of	O
order	O
2	O
,	O
more	O
specifically	O
Newton	O
's	O
equations	O
of	O
motion	O
.	O
</s>
<s>
It	O
is	O
a	O
variant	O
of	O
the	O
Verlet	B-Language
integration	I-Language
method	O
.	O
</s>
<s>
Using	O
only	O
the	O
predictor	O
formula	O
and	O
the	O
corrector	O
for	O
the	O
velocities	O
one	O
obtains	O
a	O
direct	O
or	O
explicit	O
method	O
which	O
is	O
a	O
variant	O
of	O
the	O
Verlet	B-Language
integration	I-Language
method	O
:	O
</s>
<s>
In	O
exchange	O
for	O
greater	O
accuracy	O
,	O
Beeman	B-Algorithm
's	I-Algorithm
algorithm	I-Algorithm
is	O
moderately	O
computationally	O
more	O
expensive	O
.	O
</s>
<s>
The	O
simulation	O
must	O
keep	O
track	O
of	O
position	O
,	O
velocity	O
,	O
acceleration	O
and	O
previous	O
acceleration	O
vectors	O
per	O
particle	O
(	O
though	O
some	O
clever	O
workarounds	O
for	O
storing	O
the	O
previous	O
acceleration	O
vector	O
are	O
possible	O
)	O
,	O
keeping	O
its	O
memory	O
requirements	O
on	O
par	O
with	O
velocity	O
Verlet	O
and	O
slightly	O
more	O
expensive	O
than	O
the	O
original	O
Verlet	B-Language
method	I-Language
.	O
</s>
