Abstract
We analyze a fully discrete numerical scheme approximating the evolution of n–dimensional graphs under anisotropic mean curvature. The highly nonlinear problem is discretized by piecewise linear finite elements in space and semi–implicitly in time. The scheme is unconditionally stable und we obtain optimal error estimates in natural norms. We also present numerical examples which confirm our theoretical results.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call