Optimal error estimate of Chebyshev-Legendre spectral method for the generalised Benjamin-Bona-Mahony-Burgers equations (Q437503): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 04:04, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal error estimate of Chebyshev-Legendre spectral method for the generalised Benjamin-Bona-Mahony-Burgers equations |
scientific article |
Statements
Optimal error estimate of Chebyshev-Legendre spectral method for the generalised Benjamin-Bona-Mahony-Burgers equations (English)
0 references
18 July 2012
0 references
Summary: 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.
0 references
semidiscretization
0 references
Chebyshev-Legendre spectral method
0 references
Crank-Nicolson/leapfrog scheme in time
0 references
Benjamin-Bona-Mahony-Burgers equations
0 references
computational complexity
0 references
stability
0 references
convergence
0 references
error estimate
0 references
numerical experiments
0 references