2007
DOI: 10.1007/s11071-006-9191-0
|View full text |Cite
|
Sign up to set email alerts
|

Spectral method for solving the equal width equation based on Chebyshev polynomials

Abstract: A spectral solution of the equal width (EW) equation based on the collocation method using Chebyshev polynomials as a basis for the approximate solution has been studied. Test problems, including the migration of a single solitary wave with different amplitudes are used to validate this algorithm which is found to be accurate and efficient. The three invariants of the motion are evaluated to determine the conservation properties of the algorithm. The interaction of two solitary waves is seen to cause the creat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
7
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 16 publications
1
7
0
Order By: Relevance
“…The dimensionless form of the RLW equation with power-law nonlinearity that is going to be studied in this paper is given by [1,8] …”
Section: Rlw Equationmentioning
confidence: 99%
“…The dimensionless form of the RLW equation with power-law nonlinearity that is going to be studied in this paper is given by [1,8] …”
Section: Rlw Equationmentioning
confidence: 99%
“…Therefore, the Hermite DAF has sufficient flexibility to handle complicated boundary conditions and geometries, like finite-difference and finite-element methods, but with an accuracy of the same order as spectral methods. Note that (15) assumes that the derivative of and approaches zero as → ±∞; this is convenient for approximating soliton solutions of the RLW equation, as they tend to zero as → ±∞. However, in general this is not the case and the complete numerical approximation must provide a way to handle boundary conditions.…”
Section: Distributed Approximating Functionalsmentioning
confidence: 99%
“…In (15), if the kernel, ( ) , , is fixed to be symmetric (or antisymmetric) and invariant by translation, there must be cases where ( ) are located outside of the computational domain, [ , ], and their values are undefined there. In the present algorithm, such ( ) are to be obtained by boundary conditions.…”
Section: Distributed Approximating Functionalsmentioning
confidence: 99%
See 2 more Smart Citations