26.12.2013 Views

Adaptivity with moving grids

Adaptivity with moving grids

Adaptivity with moving grids

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

<strong>Adaptivity</strong> <strong>with</strong> <strong>moving</strong> <strong>grids</strong> 37<br />

a true estimate, this expression needs to be integrated. A useful expression<br />

for the error for both (2.46) and (2.45) (see Andreev and Kopteva (1998))<br />

is then given by the next lemma.<br />

Lemma 2.5.<br />

[<br />

]<br />

‖U j − u(X j )‖ ∞ ≤ C max ∆ 2 i max<br />

[X i ,X i+1 ] |u′′ | +∆ 2 i . (2.55)<br />

Given suitable aprioriestimates, this error can be bounded by using a<br />

monitor function M which controls this via the expression<br />

(<br />

) (<br />

)<br />

∆ 2 i max<br />

[X i ,X i+1 ] |u′′ | +1 =∆ξ 2 x 2 ξ max<br />

[X i ,X i+1 ] |u′′ | +1<br />

=∆ξ 2( )<br />

max<br />

[X i ,X i+1 ] |u′′ | +1 θ 2 /M 2 .<br />

This motivates the choice of the curvature-dependent monitor function given<br />

by<br />

M = √ 1+|u ′′ | 2 .<br />

Such a function has been used by Blom and Verwer (1989); see also Mackenzie<br />

and Robertson (2002), Chen (1994), Huang and Sun (2003) and Kopteva<br />

(2007). In this case the error becomes a function of ∆ξ only and does not<br />

depend upon the solution. Hence it has the great advantage of yielding a<br />

mesh for which large variations in u ′′ (for example at boundary layers) do<br />

not affect accuracy. This is good enough for most calculations. Observe,<br />

however, the difference between using the curvature-based monitor function<br />

to bound the error, and the optimal monitor function for the Poisson<br />

equation which eliminates this error to leading order.<br />

Similar issues arise in the case of the singularly perturbed problems (2.45).<br />

For example, it is possible to get very sharp estimates on the solution in<br />

certain cases (such as when c(x) = 1). In the latter case (Andreev and<br />

Kopteva 1998) we have the following result.<br />

Lemma 2.6.<br />

‖U j − u(X j )‖ ∞ ≤ C [ ‖ min{∆ 2 i /ɛ 2 , 1} e −xi−1/ɛ ‖ ∞ + max ∆ 2 ]<br />

i . (2.56)<br />

This error can be completely controlled to be proportional only to ∆ξ 2<br />

using a Bakhvalov mesh. For such problems it can also be shown (Kopteva<br />

2007) that, if the monitor function is chosen to be a discrete arclength of<br />

the form<br />

M = √ 1+u 2 x,<br />

then, provided that the solution has converged closely to an equidistributed<br />

one, the computed solution is first-order accurate <strong>with</strong> errors O(∆ξ), independent<br />

of the value of ɛ.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!