ON A MOVING GRID NUMERICAL SCHEME FOR HAMILTON-JACOBI EQUATIONS
BUM It HONG
1. Introduction
Analysis by the method of characteristics shows that if I and Uo are smooth and Uo has compact support, then the Hamilton-Jacobi equation
(H-J)
Ut+ I(u x ) = 0, x E lR, t > 0, u(x,O) = uo(x), x E lR,
has a unique Cl solution u on some maximal time interval 0 :5 t < T for which limt...
Tu( x, t) exists uniformly; but this limiting function is not continuously differentiable. Thus u x becomes discontinuous at t = T. Crandall and Lions [2] showed both existence and uniqueness of the generalized solutions that satisfy so called "viscosity" condition.
They also showed that viscosity solutions of (H-J) are stable in Loo with respect to perturbation in the initial data, and consequently that the space of Lipschitz continuous functions forms a regularity space for (H-J). In one space dimension, Hong [3] has recently shown that if I is approximated in LOO(lR) to order (2 n )-3 by a Cl piecewise quadratic function In and if Uo is approximated in LOO by a continuous, piecewise quadratic polynomial Wo with 2
nfree knots, then the solution w(·, t) of
wt+ln(w x ) =0, xER, t>O, w(x,O) = wo(x), x E lR,
Received October 14, 1994.
1991 AMS Subject Classification: 70H20, 65M60.
Key words: Hamilton-Jacobi equations, Finite elements.
Supported by NON DIRECTED RESEARCH FUND, Korea Research Founda-
tion,1993.
is again continuous, piecewise quadratic for all time and has no more than C2
npieces for some C. As a result, u(·, t) can be approximated with an error not exceeding the error of approximation of Uo plus O((2
n)-3).
In this paper, we construct a moving grid numerical scheme using the method of the characteristics that the continuous, piecewise quadratic solution w( x, t) of Hamilton-Jacobi equations in one space dimension may be approximated in LOO(JR.) to within O(N-
3)by a continuous, piecewise quadratic polynomial wo(x) with D(N) meshpoints.
To show this, we use the simple relationship between the equations of (H-J) and hyperbolic single conservation laws. This relationsh.1p is very simple: if w is the viscosity solution of (H-J), then v =
Wx is the entropy solution of scalar conservation laws
Vt
+ f( v)x = 0, x E JR., t > 0, v(x,O) = vo(x) = w~(x), x E lR.
Therefore, if one calculates shocks of single conservation laws accord- ing to the Rankine-Hugoniot jump condition and the entropy condi- tion, then one can calculate the viscosity solution w(x, t) by integrating v(x, t) with property that w( x, t) is continuous.
2. Stability of (H-J)
THEOREM 2.1. Suppose that f and 9 are Lipscmtz continuous and f(O) = g(O) = 0. If Uo and Wo are bounded and Lipschitz continuous, and u and w are the viscosity solutions of
Ut
+ f( u x ) = 0, x E JR., t > 0, u(x,O}=uo(x), xEJR.,
and
Wt
+ g( w x ) = 0, x E JR., t > 0, . w(x,O) = wo(x), x E JR.,
then for any t > 0,
(H) lIu(·, t) - w(·, t)IILOO(ll) ::; lIuo - woIlLOO(ll) + tllf - gIlLOO(ll).
Proof See Hong [4].
3. A Construction of a Perturbed Equation
Suppose that f E W 3,OO(R.) is strictly convex and f(O) = 0. Then there is a Cl piecewise, quadratic approximation fN to f with knots at the point j fN for j = 0, 1, ... , N, that is defined by fN(j fN) =
f'(jfN), fN(O) = 0; fN is strictly convex. Moreover IIf - fNII Loo (lIi) ::;
Cllf(3)IILoo(lIi)N-
3where C = (9 + ;)j"fel)3; see [1] and [7].
We suppose that a Lipschitz continuous function Uo having the sup- port in [0, 1] has no polynomial piece of degree ::; 1 and that the range of Uo is in [0,1]. We also assume that ua
i)is in BV(R.) for i = 0, 1 and
that u~ is also in BV(R.) outside a finite set of points {diH=l where
u~ is discontinuous.
Now construct a continuous, piecewise quadratic approximation Wo to uo.
(1) choose Ti = i Jv for i = 0,1, ... ,N as initial meshpoints.
(2) If u~(x) is discontinuous at di, then choose di- 2Jv3 and di + 2Jv3'
and add these two points to the set of initial meshpoints.
(3) Insert least number of meshpoints in the interval where u~( x) is smooth so that
(4) Construct a continuous, piecewise quadratic function woex) as follows. Let I i = [Ti, Ti+l]' Set woe Ti) = uo( Ti) and woe Ti+I) =
uo( Ti+l). Now we need one more information to determine an unknown coefficient for wo(x). Let Mi = sUPI; uHx) and mi = infI; u~(x). Then choose any number for w~ satisfying mi ::; minI; W~( x) ::; maxI; W~( x) ::; M
i -(5) Insert new meshpoints Ti satisfying w~( Ti) = -k for all j =
O, ... ,N.
From these two approximations fN and Wo, we have the following properties.
LEMMA 3.1. Iw~(x)IBV(lIi)::;3Iu~(x)IBV(lIi)'
Proof· Consider one interval Ii = h, Ti+l]' Let ~i = IIil, Mi =
sup I; u~, and mi = infI; u~' Let Si be the slope of w~ on h, Ti+l].
Then since Iw&IBV(I.) = ISil~i ::; Mi - mi ::; lu&IBV(I.),
L Iw~IBV(I;) ::; L lu~IBV(I;)
::; lu~(x)IBV(J!l.).
We now measure the jump Iw&(rt) - w&(ri-)I. Since
Iw&(rt) - w~(ri-)I ::; (Mi - mi) + (Mi+l - miH) ::; lu~IBV(I;) + lu~IBv(I.+d'
~i Iw&(rt)-w&(ri-)I ::; ~i(lu&IBV(I;)+lu&IBV(I.+d) ::; 2Iu&(x)IBV(J!l.).
Hence Iw&(x)IBV(J!l.) ::; 3Iu&(x)IBV(ll).
LEMMA 3.2. Suppose that s is a piecewise linear interpolation to I
at 0 = to < t 1 < ... < tN-l < tN = 1, and the ti's are chosen so that
rt;+l 1
(ti+l - ti) It; 1f"ldx ::; N2
1f'IBV([O,1j) for all i,
then III - slloo ::; 41-21f'IBV([O,1j).
Proof. See [3].
LEMMA 3.3. H u&(x) has k number of discontinuities, then there are at most (6Iu&IBV(J!l.) + 6)N + 6k -1 meshpoints.
Proof. Step (1) and step (2) give at most 2k+N +1 meshpoints. By de Boor [1], step (3) gives at most N new meshpoints. We now count the number of meshpoints ri inserted by step (5). If call it "pi and order them, then each interval ['lj1i, 'lj1i+l] mayor may not contain previously inserted meshpoints: If ['lj1i, 'lj1i+l] does not contain any old meshpoint generated by (1), (2) and (3), then "pi and 'lj1iH are two adjacient points constructed by (5). Therefore Iw&('lj1i) - w&( 'lj1i+l)1 = it
l --k
or -k _I;/ = 1- for some j. So the total number of meshpoints in this case is no more than 2Iw&IBV(J!l.)N ::; 6Iu&IBV(J!l.)N. If ['lj1i, "piH] does contain any old meshpoint, then, since the number of old meshpoints is 2k + 2N + 1, at most (2k + 2N -1) number of the interval ["pi, ~iH]
may contain old meshpoints. So the total number of meshpoints of
this kind is no more than 2(2k + 2N -1) = 4k + 4N - 2. Therefore
step (5) adds no more than (6Iu&IBV(m) + 4)N + 4k - 2 number of new
meshpoints. So we complete the proof.
THEOREM 3.4.
Proof. Let B be the union of I i = h, Ti+l] containing a point at which u~ is discontinuous. Let A = [0,1] - B. Then
lI u o - woIlLOO(li) ~ sup luo - wol + sup luo - wol
B A
= maxsup IUO(Ti) - WO(Ti) + r: (u~(s) - w~(s» dsl
B I. lr.
+ mIX s~p luo( Td - Wo( Ti) + f.
X(u~( s) - w~( s» dsl
~ maxsup { lu~(s) - w~(s)l ds
B
i11.
+ m;xs~p ITHl - Tilllu~(s) - w~(s )11
Loo(1;)
I