arXiv Analytics

Sign in

arXiv:2005.04079 [math.AP]AbstractReferencesReviewsResources

Upper bounds of nodal sets for eigenfunctions of eigenvalue problems

Fanghua Lin, Jiuyi Zhu

Published 2020-05-08Version 1

We aim to provide a uniform way to obtain the sharp upper bounds of nodal sets of eigenfunctions for different types of eigenvalue problems in real analytic domains. The exemplary examples include biharmonic Steklov eigenvalue problems, buckling eigenvalue problems and champed-plate eigenvalue problems. The nodal sets of eigenfunctions are derived from doubling inequalities and a complex growth lemma. The novel idea is to obtain the doubling inequalities in an extended domain by a real analytic continuation and Carleman estimates.

Related articles: Most relevant | Search more
arXiv:1304.7143 [math.AP] (Published 2013-04-26, updated 2013-10-29)
The size of the nodal sets for the eigenfunctions of the smooth laplacian
arXiv:1808.03342 [math.AP] (Published 2018-08-09)
Local and global analysis of nodal sets
arXiv:1010.4579 [math.AP] (Published 2010-10-21, updated 2010-11-01)
A Remark on Recent Lower Bounds for Nodal Sets