Abstract
We construct high order local discontinuous Galerkin (LDG) discretizations coupled with third and fourth order backward differentiation formulas (BDF) for the Allen–Cahn equation. The numerical discretizations capture the advantages of linearity and high order accuracy in both space and time. We analyze the stability and error estimates of the time third-order and fourth-order BDF-LDG discretizations for numerically solving Allen–Cahn equation respectively. Theoretical analysis shows the stability and the optimal error results of theses numerical discretizations, in the sense that the time step τ requires only a positive upper bound and is independent of the mesh size h. A series of numerical examples show the correctness of the theoretical analysis. Comparison with the first-order numerical discretization illustrates that the high order BDF-LDG discretizations show good performance in solving stiff problems.
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 callMore From: Журнал вычислительной математики и математической физики
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
