Linearly implicit full discretization of surface evolution
classification
🧮 math.NA
keywords
discretizationfullstabilityconvergenceevolutionhigher-orderimplicitlinearly
read the original abstract
Stability and convergence of full discretizations of various surface evolution equations are studied in this paper. The proposed discretization combines a higher-order evolving-surface finite element method (ESFEM) for space discretization with higher-order linearly implicit backward difference formulae (BDF) for time discretization. The stability of the full discretization is studied in the matrix--vector formulation of the numerical method. The geometry of the problem enters into the bounds of the consistency errors, but does not enter into the proof of stability. Numerical examples illustrate the convergence behaviour of the full discretization.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.