Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/103703
DC FieldValue
dc.titleOn eigenvalue intervals and twin eigenfunctions of higher-order boundary value problems
dc.contributor.authorWong, P.J.Y.
dc.contributor.authorAgarwal, R.P.
dc.date.accessioned2014-10-28T02:40:23Z
dc.date.available2014-10-28T02:40:23Z
dc.date.issued1998-02-23
dc.identifier.citationWong, P.J.Y.,Agarwal, R.P. (1998-02-23). On eigenvalue intervals and twin eigenfunctions of higher-order boundary value problems. Journal of Computational and Applied Mathematics 88 (1) : 15-43. ScholarBank@NUS Repository.
dc.identifier.issn03770427
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/103703
dc.description.abstractIn this paper we shall consider the boundary value problem y(n) + λQ(t, y, y1, . . . , y(n-2)) = λP(t, y, y1, . . . , y(n-2)), n ≥ 2, t ∈ (0, 1), y(i)(0) = 0, 0 ≤ i ≤ n - 3, αy(n-2)(0) - βy(n-2)(0) = 0, γy(n-2)(1) + δy(n-1)(1) = 0, where λ > 0, α, α, γ and δ are constants satisfying αγ + αδ + βγ > 0, β, δ ≥ 0, β + α > 0 and δ + γ > 0. Intervals of λ are determined to ensure the existence of a positive solution of the boundary value problem. For λ = 1, we shall also offer criteria for the existence of two positive solutions of the boundary value problem. In addition, upper and lower bounds for these positive solutions are obtainsd for special cases. Several examples are included to dwell upon the importance of the results obtained. © 1998 Elsevier Science B.V. All rights reserved.
dc.sourceScopus
dc.subjectBoundary value problems
dc.subjectEigenfunctions
dc.subjectEigenvalues
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.sourcetitleJournal of Computational and Applied Mathematics
dc.description.volume88
dc.description.issue1
dc.description.page15-43
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.