TY - JOUR

T1 - An adaptive method with rigorous error control for the Hamilton-Jacobi equations. Part I

T2 - The one-dimensional steady state case

AU - Cockburn, Bernardo

AU - Yenikaya, Bayram

PY - 2005/2/1

Y1 - 2005/2/1

N2 - In this paper, we introduce a new adaptive method for finding approximations for Hamilton-Jacobi equations whose L∞-distance to the viscosity solution is no bigger than a prescribed tolerance. This is done on the simple setting of a one-dimensional model problem with periodic boundary conditions. We consider this to be a stepping stone towards the more challenging goal of constructing such methods for general Hamilton-Jacobi equations. The method proceeds as follows. On any given grid, the approximate solution is computed by using a well-known monotone scheme; then, the quality of the approximation is tested by using an approximate a posteriori error estimate. If the error is bigger than the prescribed tolerance, a new grid is computed by solving a differential equation whose devising is the main contribution of the paper. A thorough numerical study of the method is performed which shows that rigorous error control is achieved, even though only an approximate a posteriori error estimate is used; the method is thus reliable. Furthermore, the numerical study also shows that the method is efficient and that it has an optimal computational complexity. These properties are independent of the value of the tolerance. Finally, we provide extensive numerical evidence indicating that the adaptive method converges to an approximate solution that can be characterized solely in terms of the tolerance, the artificial viscosity of the monotone scheme and the exact solution.

AB - In this paper, we introduce a new adaptive method for finding approximations for Hamilton-Jacobi equations whose L∞-distance to the viscosity solution is no bigger than a prescribed tolerance. This is done on the simple setting of a one-dimensional model problem with periodic boundary conditions. We consider this to be a stepping stone towards the more challenging goal of constructing such methods for general Hamilton-Jacobi equations. The method proceeds as follows. On any given grid, the approximate solution is computed by using a well-known monotone scheme; then, the quality of the approximation is tested by using an approximate a posteriori error estimate. If the error is bigger than the prescribed tolerance, a new grid is computed by solving a differential equation whose devising is the main contribution of the paper. A thorough numerical study of the method is performed which shows that rigorous error control is achieved, even though only an approximate a posteriori error estimate is used; the method is thus reliable. Furthermore, the numerical study also shows that the method is efficient and that it has an optimal computational complexity. These properties are independent of the value of the tolerance. Finally, we provide extensive numerical evidence indicating that the adaptive method converges to an approximate solution that can be characterized solely in terms of the tolerance, the artificial viscosity of the monotone scheme and the exact solution.

KW - A posteriori error estimates

KW - Adaptivity

KW - Hamilton-Jacobi equations

UR - http://www.scopus.com/inward/record.url?scp=10444290638&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10444290638&partnerID=8YFLogxK

U2 - 10.1016/j.apnum.2004.08.030

DO - 10.1016/j.apnum.2004.08.030

M3 - Article

AN - SCOPUS:10444290638

VL - 52

SP - 175

EP - 195

JO - Applied Numerical Mathematics

JF - Applied Numerical Mathematics

SN - 0168-9274

IS - 2-3 SPEC. ISS.

ER -