Adaptivity with moving grids
Adaptivity with moving grids
Adaptivity with moving grids
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>Adaptivity</strong> <strong>with</strong> <strong>moving</strong> <strong>grids</strong> 101<br />
Now consider a simple centred finite difference discretization of the Lagrangian<br />
form of the underlying PDE, which takes the form<br />
U i+1 −U i<br />
X i+1 −X i<br />
− U i−U i−1<br />
X i −X i−1<br />
U i+1 − U i−1<br />
˙U i =<br />
1<br />
2 (X + f(U i )+Ẋi<br />
i+1 − X i−1 )<br />
(X i+1 − X i−1 ) .<br />
We can substitute (5.20) directly into this expression to give<br />
αV i =<br />
V i+1 −V i<br />
Y i+1 −Y i<br />
− V i−V i−1<br />
Y i −Y i−1<br />
1<br />
2 (Y i+1 − Y i−1 )<br />
+ f(V i )+ Y i<br />
2<br />
V i+1 − V i−1<br />
(Y i+1 − Y i−1 ) . (5.22)<br />
It is immediately obvious that (5.22) is a consistent discretization of the<br />
ordinary differential equation (5.21) so that the function v(y) will be approximated<br />
by V i at the (time-independent computational) mesh point Y i .<br />
Note further that the discretization error in approximating v by V i is independent<br />
of the solution scale. In the case of systems such as the blow-up<br />
problems of Section 5.2, this implies that the asymptotic form of the singularity<br />
at the peak will be approximated <strong>with</strong> uniform accuracy for peaks<br />
<strong>with</strong> very small spatial scales (and correspondingly large solution scales).<br />
We note, however, that other errors do arise at points where the (rapidly)<br />
<strong>moving</strong> mesh following the evolving peak matches a nearly stationary mesh<br />
in the regions closer to the boundary of the domain.<br />
To determine the location of the points Y i in terms of the computational<br />
variables, we must apply the MMPDE used to evolve the mesh. Again, to<br />
give an example we consider MMPDE5. Substituting (5.20) into a standard<br />
discretization of MMPDE5 gives the following discrete equation for Y i :<br />
1<br />
2 Y i = 1 (<br />
Mi+1/2<br />
2∆ξ 2 (Y i+1 − Y i ) − M i−1/2 (Y i − Y i−1 ) ) . (5.23)<br />
Crucially, we note that the functional equation (5.14) satisfied by the monitor<br />
function M allows this rescaling to be made. Similar discrete equations<br />
arise for other choices of MMPDE, provided that M satisfies (5.14).<br />
We note that exactly the same rescalings are possible in higher-dimensional<br />
problems using <strong>moving</strong> meshes generated by any other methods described<br />
in this subsection, and for any other form of discretization (provided<br />
that the processes of discretization and rescaling commute).<br />
It is also possible to construct approximate discrete self-similar solutions<br />
in cases where the underlying solution is better described by approximate<br />
self-similar variables. Details of the calculations in this case are given in<br />
Budd and Williams (2006).<br />
As an example of this we return to the porous medium equation in one<br />
dimension. For this problem, for all constants C>0 there is a self-similar<br />
solution u s (x, t) of the form<br />
u s (x, t) =(t + C) −1/3 v(y), x =(t + C) 1/3 y,