×

Positive solutions of asymptotically linear elliptic eigenvalue problems. (English) Zbl 0433.35026


MSC:

35J65 Nonlinear boundary value problems for linear elliptic equations
35A05 General existence and uniqueness theorems (PDE) (MSC2000)
55M25 Degree, winding number
35B32 Bifurcations in context of PDEs
Full Text: DOI

References:

[1] Amann, H., Fixed point equations and nonlinear eigenvalue problems in ordered Banach spaces, SIAM Rev., 18, 620-709 (1976) · Zbl 0345.47044
[2] Amann, H., Nonlinear eigenvalue problems having precisely two solutions, Math. Z., 150, 27-37 (1976) · Zbl 0329.35027
[3] Amann, H.; Laetsch, T., Positive solutions of convex nonlinear eigenvalue problems, Indiana Univ. Math. J., 25, 259-270 (1976) · Zbl 0329.35028
[5] Brown, K. J.; Budin, H., Multiple positive solutions for a class of nonlinear boundary value problems, J. Math. Anal. Appl., 60, 329-338 (1977) · Zbl 0361.35023
[6] Hess, P., Multiple solutions of asymptotically linear elliptic boundary value problems, (Proc. Equadiff IV. Proc. Equadiff IV, Prague. Proc. Equadiff IV. Proc. Equadiff IV, Prague, Lecture Notes in Mathematics (1977), Springer-Verlag: Springer-Verlag Berlin/New York), in press · Zbl 0421.35024
[7] Keener, J. P.; Keller, H. B., Positive solutions of convex nonlinear eigenvalue problems, J. Differential Equations, 16, 103-125 (1974) · Zbl 0287.35074
[8] Rabinowitz, P. H., Some global results for nonlinear eigenvalue problems, J. Functional Analysis, 7, 487-513 (1971) · Zbl 0212.16504
[9] Rabinowitz, P. H., Théorie du degré topologique et applications à des problèmes aux limites non linéaires, Notes Univ. Paris VI et CNRS (1975), (rédigés par H. Berestycki)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.