1983
DOI: 10.1016/0021-9991(83)90101-8
|View full text |Cite
|
Sign up to set email alerts
|

Computational procedure for Sturm-Liouville problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
24
1
1

Year Published

1986
1986
2014
2014

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 76 publications
(27 citation statements)
references
References 16 publications
1
24
1
1
Order By: Relevance
“…For general functional forms of u(z) and K(z), the solution of the eigenvalue problem could be obtained by using the semi-analytic sign-count method [22] or from algorithms for automatic computation of eigenvalue and eigenfunctions of Sturm-Liouville problems [23,24]. The procedure using the GITT given by Cotta [20], and Mikhailov & Cotta [16], is another alternative to solve the eigenvalue problem.…”
Section: Problem Formulationmentioning
confidence: 99%
“…For general functional forms of u(z) and K(z), the solution of the eigenvalue problem could be obtained by using the semi-analytic sign-count method [22] or from algorithms for automatic computation of eigenvalue and eigenfunctions of Sturm-Liouville problems [23,24]. The procedure using the GITT given by Cotta [20], and Mikhailov & Cotta [16], is another alternative to solve the eigenvalue problem.…”
Section: Problem Formulationmentioning
confidence: 99%
“…For the case λ 2 [19]. From the general Sturm-Liouville theory we know that the smallest eigenvalue gives rise to an eigenfunction with no zeros in the interval (0, L N ), see [20,Chap.…”
Section: Generalized Fourier Transformmentioning
confidence: 99%
“…A1-A4 in the Appendix and parameters k 1 and k 2 are the related thermal conductivities of the two layers (k = ρca). Positive numbers β n represent eigenvalues of the solution, and they can be found by the efficient and reliable "sign-count" method proposed by Mikhailov and Vulchanov [15]. According to that procedure, the number of eigenvalues N (β 0 , S) below an arbitrary value β 0 is equal to…”
Section: Mathematical Modelsmentioning
confidence: 99%