×

zbMATH — the first resource for mathematics

On the existence of nodal domains for elliptic differential operators. (English) Zbl 0537.35027
A bounded domain G is a nodal domain of an elliptic partial differential equation \((1)\quad Au=0\) of order 2m if there exists a non-trivial solution of (1), \(u\in \overset \circ W^ m_ 2(G)\cap W^{2m}_{2,loc}(G).\) The main result is that a self adjoint elliptic differential equation has rectangular nodal domains if the quadratic form of the equation takes on negative values. If the smallest point of the spectrum of a second order self-adjoint differential operator with Dirichlet boundary conditions is an eigenvalue, then this eigenvalue is strictly increasing when the domain is shrinking.
Reviewer: S.Lenhart

MSC:
35J30 Higher-order elliptic equations
35P20 Asymptotic distributions of eigenvalues in context of PDEs
47B25 Linear symmetric and selfadjoint operators (unbounded)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Courant, Methoden der mathematischen Physik I (1968) · Zbl 0156.23201
[2] Chicco, Boll. Un. Mat. Ital. 5 pp 245– (1972)
[3] DOI: 10.1007/BF01343363 · Zbl 0104.07502
[4] Allegretto, Pacific J. Math. 55 pp 319– (1974) · Zbl 0279.35036
[5] DOI: 10.1007/BF00250476 · Zbl 0455.35046
[6] Dunford, Linear Operators (1963)
[7] Moss, Pacific J. Math. 75 pp 219– (1978) · Zbl 0381.35026
[8] Kato, Perturbation theory for linear operators (1966) · Zbl 0148.12601
[9] Hörmander, Linear partial differential operators (1963) · Zbl 0108.09301
[10] Glazman, Direct methods of qualitative spectral analysis of singular differential operators (1965) · Zbl 0143.36505
[11] DOI: 10.1002/mana.19800940104 · Zbl 0452.35027
[12] Reid, Pacific J. Math. 13 pp 665– (1963) · Zbl 0119.07401
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.