×

zbMATH — the first resource for mathematics

A proof of Trudinger’s inequality and its application to nonlinear Schrödinger equations. (English) Zbl 0715.35073
The author gives a new proof of a version of Trudinger’s inequality for unbounded domains in \({\mathbb{R}}^ 2\). This proof uses the properties of the free Schrödinger propagator. The obtained inequality is applied to prove the uniqueness of weak solutions to nonlinear Schrödinger equations.
Reviewer: C.Popa

MSC:
35Q55 NLS equations (nonlinear Schrödinger equations)
35K60 Nonlinear initial, boundary and initial-boundary value problems for linear parabolic equations
46E35 Sobolev spaces and other spaces of “smooth” functions, embedding theorems, trace theorems
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Adams, R.A., Sobolev spaces, (1975), Academic Press New York · Zbl 0186.19101
[2] Cazenave, T., Equations de Schrödinger non linéaires en dimension deux, Proc. R. soc. edinb., 84A, 327-346, (1979) · Zbl 0428.35021
[3] Gilbarg, D.; Trudinger, N., Elliptic partial differential equations of second order, (1983), Springer Berlin · Zbl 0562.35001
[4] Ginibre, J.; Velo, G., On a class of nonlinear Schrödinger equation I, the Cauchy problem, general case, J. funct. analysis, 32, 1-32, (1979) · Zbl 0396.35028
[5] Lions, J.L., Quelques méthodes de résolution des problémes aux limites non linéaires, (1969), Dunod Paris · Zbl 0189.40603
[6] Vladimirov, M.V., On the solvability of mixed problem for a nonlinear equation of Schrödinger type, Soviet math. dokl., 29, 281-284, (1984) · Zbl 0585.35019
[7] Yao, J-Q., Comportement à l’infini des solutions d’une équation de Schrödinger non linéaire dans un domaine extér, C.r. acad. sci. Paris, 294, 163-166, (1982) · Zbl 0511.35078
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.