Numerical algorithm based on an implicit fully discrete local discontinuous Galerkin method for the time-fractional KdV-Burgers-Kuramoto equation
Leilei Wei, Yinnian He

TL;DR
This paper introduces a fully discrete local discontinuous Galerkin method for solving the time-fractional KdV-Burgers-Kuramoto equation, demonstrating stability and convergence through theoretical analysis and numerical tests.
Contribution
It develops a novel fully discrete LDG scheme combining finite differences in time with spatial DG methods for the fractional KBK equation, with proven stability and error estimates.
Findings
Unconditionally stable scheme
Error convergence rate of O(h^{k+1}+(\Delta t)^2+(\Delta t)^{rac{ ext{ extalpha}}{2}}h^{k+1/2})
Numerical results confirm efficiency and accuracy
Abstract
In this paper, a fully discrete local discontinuous Galerkin (LDG) finite element method is considered for solving the time-fractional KdV-Burgers-Kuramoto (KBK) equation. The scheme is based on a finite difference method in time and local discontinuous Galerkin methods in space. We prove that our scheme is unconditional stable and error estimate for the linear case with the convergence rate . Numerical examples are presented to show the efficiency and accuracy of our scheme.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFractional Differential Equations Solutions · Numerical methods for differential equations · Differential Equations and Numerical Methods
