1
Sep. 26, 2006
ATMS 502  CS 505  CSE 566
Jewett
Computer Problem 3
1D Adaptive Nesting
Due
: beginning of class – Thursday, Oct. 12
Turn in
: your code (printed out, and
also
emailed to me), and plotted results (on paper).
Problem being solved:
linear advection equation
using automatic grid nesting
.
Evaluation:
you will overlay the true solution with each of your numerical results,
as well as save/plot maximum absolute value vs. time for each case.
Method:
LaxWendroff, with
nesting
.
Nesting ratio:
variable
– you will
read this in
. Your code
must not
be “hardwired” for
this nest ratio – treat this as a variable throughout your code.
Constants:
Use the following in your calculations:
ν
= 0.5
Nest ratio = 4
∆
x = 1.0
(grid 1)
nx =
121
(both grids
.)
c
= 5.0
∆
t =
ν
∆
x/c
Width (cone) = 10
Width (square) = 20
Domain:
x(i)=
∆
x(i1), i=1,.
..,nx. The periodic
coarse grid
domain length is
nx
(
∆
x), as in
computer problem 2.
Initial conditions
:
same as program 2,
except
the initial center location x
ctr
of the cone or
square is
3*width/2
rather than the middle of the coarse grid domain.
Boundary conditions:
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '09
 JEWETT
 Grid Computing, Boundary value problem, Jewett, coarse grid

Click to edit the document details