×

zbMATH — the first resource for mathematics

Variational methods and semilinear elliptic equations. (English) Zbl 0656.35044
This work is devoted to obtaining non-resonance and resonance conditions for semilinear elliptic equations by means of variational methods.

MSC:
35J65 Nonlinear boundary value problems for linear elliptic equations
35J20 Variational methods for second-order elliptic equations
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] F. Clarke & I. Ekeland, Hamiltonian trajectories with prescribed minimal period, Comm. Pure Appl. Math. 33 (1980) 103–116. · Zbl 0403.70016
[2] D. G. de Figueiredo & J. P. Gossez, Nonlinear perturbations of a linear elliptic problem near its first eigenvalue, J. Diff. Equ. 30 (1978) 1–19. · Zbl 0357.35036
[3] A. Hammerstein, Nichtlineare Integralgleichungen nebst Anwendungen, Acta Math. 54 (1930) 117–176. · JFM 56.0343.03
[4] J. L. Kazdan & F. Warner, Remarks on some quasilinear elliptic equations, Comm. Pure Appl. Math. 28 (1975) 567–597. · Zbl 0325.35038
[5] K. Klingelhofer, Nonlinear boundary value problems with simple eigenvalue of the linear part, Arch. Rat. Mech. Anal. 37 (1970) 381–398. · Zbl 0212.13201
[6] J. Mawhin, Le rôle de la régularité dans les problèmes non-linéaires résonants, in ”Journics Analyse Non Linéaire”, Publications de l’ U.E.R. Mathematiques, Lille, 1983, 12 pp.
[7] J. Mawhin & J. Ward Jr., Periodic solutions of some forced Liénard differential equation at resonance, Arch. Math. (Basel) 41 (1983) 337–351. · Zbl 0537.34037
[8] J. Mawhin & M. Willem, Variational methods and boundary value problems for vector second order differential equations and applications to the pendulum equation, in ”Analisi non lineare e ottimizzazione, Bologna, 1982”, to appear.
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.