The convergence rate for the error in
, measured at t=50, is:
| (11) |
A dramatic increased performance of the
algorithm results from the
constraint adjustment:
| (12) |
As shown in the next Figure for 100 gridpoints, this adjustment with
keeps the error in
under control for
, as compared with
for the unadjusted run.
The constraint damping:
| (13) |
also leads to improvement over the unadjusted case but the results are more
modest. As shown in the next Figure for
, the errors in
for the undamped and damped cases are roughly the same at 200.
Although the damped case runs longer it produces a highly oscillatory error
which leads to unacceptable error.
These results cannot be significantly improved through other choices of
damping coefficient
or by using the normal direction
instead of the evolution direction
.
The numerical dissipation also produces a modest improvement in performance,
as the following Figure shows, with the dissipation coefficients set to
.
However, as we can see in the previous figure, dissipation is not effective in controlling the large oscillations in error produced by constraint damping.