<s>
Strang	B-Algorithm
splitting	I-Algorithm
is	O
a	O
numerical	O
method	O
for	O
solving	O
differential	O
equations	O
that	O
are	O
decomposable	O
into	O
a	O
sum	O
of	O
differential	O
operators	O
.	O
</s>
<s>
Strang	B-Algorithm
splitting	I-Algorithm
extends	O
this	O
approach	O
to	O
second	O
order	O
by	O
choosing	O
another	O
order	O
of	O
operations	O
.	O
</s>
<s>
One	O
can	O
prove	O
that	O
Strang	B-Algorithm
splitting	I-Algorithm
is	O
second	O
order	O
by	O
using	O
either	O
the	O
Baker-Campbell-Hausdorff	O
formula	O
,	O
Rooted	O
tree	O
analysis	O
or	O
a	O
direct	O
comparison	O
of	O
the	O
error	O
terms	O
using	O
Taylor	O
expansion	O
.	O
</s>
