Optimal error estimate of chebyshev-legendre spectral method for the generalised benjamin-bona-mahony-burgers equations

7Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Combining with the Crank-Nicolson/leapfrog scheme in time discretization, Chebyshev-Legendre spectral method is applied to space discretization for numerically solving the Benjamin-Bona-Mahony-Burgers (gBBM-B) equations. The proposed approach is based on Legendre Galerkin formulation while the Chebyshev-Gauss-Lobatto (CGL) nodes are used in the computation. By using the proposed method, the computational complexity is reduced and both accuracy and efficiency are achieved. The stability and convergence are rigorously set up. Optimal error estimate of the Chebyshev-Legendre method is proved for the problem with Dirichlet boundary condition. The convergence rate shows "spectral accuracy". Numerical experiments are presented to demonstrate the effectiveness of the method and to confirm the theoretical results. Copyright © 2012 Tinggang Zhao et al.

Cite

CITATION STYLE

APA

Zhao, T., Zhang, X., Huo, J., Su, W., Liu, Y., & Wu, Y. (2012). Optimal error estimate of chebyshev-legendre spectral method for the generalised benjamin-bona-mahony-burgers equations. Abstract and Applied Analysis, 2012. https://doi.org/10.1155/2012/106343

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free