Kybernetika 43 no. 6, 855-867, 2007

Finite difference scheme for the Willmore flow of graphs

Tomáš Oberhuber


In this article we discuss numerical scheme for the approximation of the Willmore flow of graphs. The scheme is based on the finite difference method. We improve the scheme we presented in Oberhuber \cite{Obe-2005-2,Obe-2005-1} which is based on combination of the forward and the backward finite differences. The new scheme approximates the Willmore flow by the central differences and as a result it better preserves symmetry of the solution. Since it requires higher regularity of the solution, additional numerical viscosity is necessary in some cases. We also present theorem showing stability of the scheme together with the EOC and several results of the numerical experiments.