2009
DOI: 10.1016/j.chaos.2007.01.105
|View full text |Cite
|
Sign up to set email alerts
|

An efficient technique for finding the eigenvalues of fourth-order Sturm–Liouville problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

3
38
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
9
1

Relationship

2
8

Authors

Journals

citations
Cited by 33 publications
(41 citation statements)
references
References 18 publications
3
38
0
Order By: Relevance
“…There are several more methods which have been applied to approximate the eigensolutions of the fourth order SLP (1) with general separated self-adjoint boundary conditions (2). These methods are shooting method [3], oscillation method [2], an efficient method based on the Adomian decomposition method (ADM) [4], and variational iteration methods [5]. In 2002, Chanane [6] applied Fliess series to compute the eigenvalues of the fourth-order Sturm-Liouville problems…”
Section: Introductionmentioning
confidence: 99%
“…There are several more methods which have been applied to approximate the eigensolutions of the fourth order SLP (1) with general separated self-adjoint boundary conditions (2). These methods are shooting method [3], oscillation method [2], an efficient method based on the Adomian decomposition method (ADM) [4], and variational iteration methods [5]. In 2002, Chanane [6] applied Fliess series to compute the eigenvalues of the fourth-order Sturm-Liouville problems…”
Section: Introductionmentioning
confidence: 99%
“…Fractional derivatives have many applications, such as diffusion problems, liquid crystals, proteins, mechanics structural control, and biosystems [1][2][3][4][5][6][7][8][9]. Several analytical and numerical methods are used to solve fractional boundary and initial value problems, such as generalized differential transform, the Adomian decomposition method, the homotopy perturbation technique, fractional multistep methods, the spline approximation method, and the collocation method [10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26].…”
Section: Introductionmentioning
confidence: 99%
“…For instance, Lesnic and Attili [33] used the Adomian decomposition method (ADM) whereas Greenberg and Marletta [30]- [32] developed their own code using Theta Matrices (SLEUTH). Syam and Siyyam [34] implemented the iterated variation method. The present work is motivated by approximating the eigenvalues of problem (1.1)-(1.2) using reproducing kernel method (RKM).…”
Section: Introductionmentioning
confidence: 99%