2021
DOI: 10.1007/s40819-020-00943-x
|View full text |Cite
|
Sign up to set email alerts
|

Numerical Solution for Nonlinear Klein–Gordon Equation via Operational Matrix by Clique Polynomial of Complete Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 21 publications
(8 citation statements)
references
References 34 publications
0
8
0
Order By: Relevance
“…Moreover, some of the properties and theorems on clique polynomials of complete graph are discussed in Ref. [20].…”
Section: Theoretical Results On Clique Polynomialsmentioning
confidence: 99%
“…Moreover, some of the properties and theorems on clique polynomials of complete graph are discussed in Ref. [20].…”
Section: Theoretical Results On Clique Polynomialsmentioning
confidence: 99%
“…where the notation h(u) has been studied in several popular forms. [28][29][30][31][32][33][34] For example, in the cases h(u) = sin(u), h(u) = sin(u) + sin(2u), h(u) = sinh(u) + sinh(2u), and h(u) = u 3 − u, Equation (1.6) is called sine-Gordon equation, double sine-Gordon equation, double sinh-Gordon equation, and 𝜙 4 equation, respectively. It should be noted that in addition to the nonlinear aspect of this problem, the domain of the problem can be unbounded.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In Bulbul and Sezer, 28 a numerical technique based on collocation and Taylor matrix method was applied to solve the NKG equation. Kumbinarasaiah et al 34 proposed a numerical technique based on the operational matrix by clique polynomial to solve the NKG equation. In previous studies, [23][24][25][26] the authors have applied the RBFs for the spatial direction and related derivatives and also have used the forward FD for the time derivative.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Berman [24] studied the Laminar ow in channels with porous walls.Preliminaries of Laguerre wavelets and frames are given in [25]. Recently, very attractive uid ow problems are solved by using wavelet technique [26][27][28].…”
Section: Introductionmentioning
confidence: 99%