<s>
In	O
computational	O
fluid	O
dynamics	O
,	O
the	O
MacCormack	B-Algorithm
method	I-Algorithm
is	O
a	O
widely	O
used	O
discretization	O
scheme	O
for	O
the	O
numerical	O
solution	O
of	O
hyperbolic	O
partial	O
differential	O
equations	O
.	O
</s>
<s>
This	O
second-order	O
finite	B-Algorithm
difference	I-Algorithm
method	I-Algorithm
was	O
introduced	O
by	O
Robert	O
W	O
.	O
MacCormack	O
in	O
1969	O
.	O
</s>
<s>
The	O
MacCormack	B-Algorithm
method	I-Algorithm
is	O
elegant	O
and	O
easy	O
to	O
understand	O
and	O
program	O
.	O
</s>
<s>
The	O
MacCormack	B-Algorithm
method	I-Algorithm
is	O
a	O
variation	O
of	O
the	O
two-step	B-Algorithm
Lax	I-Algorithm
–	I-Algorithm
Wendroff	I-Algorithm
scheme	I-Algorithm
but	O
is	O
much	O
simpler	O
in	O
application	O
.	O
</s>
<s>
The	O
application	O
of	O
MacCormack	B-Algorithm
method	I-Algorithm
to	O
the	O
above	O
equation	O
proceeds	O
in	O
two	O
steps	O
;	O
a	O
predictor	O
step	O
which	O
is	O
followed	O
by	O
a	O
corrector	O
step	O
.	O
</s>
<s>
The	O
MacCormack	B-Algorithm
method	I-Algorithm
is	O
well	O
suited	O
for	O
nonlinear	O
equations	O
(	O
Inviscid	O
Burgers	O
equation	O
,	O
Euler	O
equations	O
,	O
etc	O
.	O
)	O
</s>
<s>
For	O
linear	O
equations	O
,	O
the	O
MacCormack	B-Algorithm
scheme	I-Algorithm
is	O
equivalent	O
to	O
the	O
Lax	B-Algorithm
–	I-Algorithm
Wendroff	I-Algorithm
method	I-Algorithm
.	O
</s>
<s>
Unlike	O
first-order	O
upwind	B-Algorithm
scheme	I-Algorithm
,	O
the	O
MacCormack	O
does	O
not	O
introduce	O
diffusive	B-Algorithm
errors	I-Algorithm
in	O
the	O
solution	O
.	O
</s>
