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

Mathematics – Numerical Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This paper has been withdrawn by the authors, due to the carelessness, we have submitted the wrong version of manuscript which

Scientific paper

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 $L^2$ error estimate for the linear case with the convergence rate $O(h^{k+1}+(\Delta t)^2+(\Delta t)^\frac{\alpha}{2}h^{k+1/2})$. Numerical examples are presented to show the efficiency and accuracy of our scheme.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Numerical algorithm based on an implicit fully discrete local discontinuous Galerkin method for the time-fractional KdV-Burgers-Kuramoto equation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Numerical algorithm based on an implicit fully discrete local discontinuous Galerkin method for the time-fractional KdV-Burgers-Kuramoto equation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Numerical algorithm based on an implicit fully discrete local discontinuous Galerkin method for the time-fractional KdV-Burgers-Kuramoto equation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-609894

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.