Convergence of Adaptive Filtered Schemes for First Order Evolutionary Hamilton-Jacobi Equations

We consider a class of "filtered" schemes for first order time dependent Hamilton-Jacobi equations and prove a general convergence result for this class of schemes. A typical filtered scheme is obtained mixing a high-order scheme and a monotone scheme according to a filter function $F$ which decides where the scheme has to switch from one scheme to the other. A crucial role for this switch is played by a parameter $\varepsilon=\varepsilon({Δt,Δx})>0$ which goes to 0 as the time and space steps $(Δt,Δx)$ are going to 0 and does not depend on the time $t_n$, for each iteration $n$. The tuning of this parameter in the code is rather delicate and has an influence on the global accuracy of the filtered scheme. Here we introduce an adaptive and automatic choice of $\varepsilon=\varepsilon ^n (Δt, Δx)$ at every iteration modifying the classical set up. The adaptivity is controlled by a smoothness indicator which selects the regions where we modify the regularity threshold $\varepsilon^n$. A convergence result and some error estimates for the new adaptive filtered scheme are proved, this analysis relies on the properties of the scheme and of the smoothness indicators. Finally, we present some numerical tests to compare the adaptive filtered scheme with other methods.

No reviews yet.

No comments yet.