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> 113<br />

Example 1. As a first calculation we consider a problem <strong>with</strong> the initial<br />

and boundary values chosen over the unit square, so that (5.31) has the<br />

exact solution given by<br />

u(x, y, t) = ( 1+e (x+y−t)/2ν) −1 . (5.32)<br />

This solution has a sharp <strong>moving</strong> front. For the purposes of this example we<br />

consider coupling this system to the PMA algorithm described in Section 3,<br />

to generate a <strong>moving</strong> mesh which can both compute an approximation to<br />

this solution and follow the front as it evolves over the time interval t ∈<br />

[1/4, 2]. To do this we discretize (5.31) in the Lagrangian form<br />

( 1<br />

u t = ν∆u −<br />

2 (u2 ) x + 1 )<br />

2 (u2 ) y +ẋu x +ẏu y , ν ≪ 1. (5.33)<br />

<strong>with</strong> all discretizations made in the computational variables. The conservation<br />

form of the equation above is used for this calculation so that, for<br />

example, the advective term u 2 x is rescaled as<br />

u 2 x = 1 J<br />

[<br />

yη u 2 ξ − y ξu 2 η]<br />

,<br />

which is then discretized using a central difference scheme. For this calculation<br />

we also take similar discretizations for the other advective terms. The<br />

equation posed in the computational variables is then coupled to the discretized<br />

form of PMA equation (5.17) <strong>with</strong> the values of the approximation<br />

U i,j to u(X i ,Y j )andofQ given on the mesh vertices. In these computations<br />

we take an N × N computational mesh (typically N = 40), a viscosity of<br />

ν =0.005, and use the arclength monitor function<br />

√<br />

M = 1+α ( u 2 x + uy) 2 ,<br />

<strong>with</strong> α = 1. A number of different strategies could be used to evolve this<br />

coupled system forward in time, but in practice a simple scheme which<br />

solved the PMA equation and (5.33) simultaneously using a simple forward<br />

Euler method is effective <strong>with</strong> a time step ∆t, as given in Zhang and Tang<br />

(2002), determined by the CFL condition. In the PMA equation we used<br />

ɛ =1,γ =0.335 to find the initial mesh (before evolving the solution PDE)<br />

when t =1/4, and then ɛ =0.01,γ = √ max(M) to follow the front up<br />

to t = 2. More details are given in Walsh et al. (2009). We note that<br />

solving the PMA equation coupled to (5.33), using an alternating solution<br />

strategy coupled <strong>with</strong> an up-winding discretization, has also been shown<br />

to be effective (Sulman 2008). In Figure 5.7 we present the results of a<br />

series of computations using this method, when N = 40, showing both<br />

the solution for (5.31) and the corresponding mesh. In this figure we see<br />

excellent resolution of the solution at the front.

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

Saved successfully!

Ooh no, something went wrong!