arXiv research

Graph poly-Laplacian method improves regression accuracy.

We consider the lower order eigenvalues of poly-Laplacian with any order on spherical domains. We obtain universal inequalities for them and show that our results are optimal.

Improved lower bounds for poly-Laplacian eigenvalues in arbitrary dimensions.

In this paper, we investigate the Dirchlet eigenvalue problems of poly-Laplacian with any order and quadratic polynomial operator of the Laplacian. We give some estimates for lower bounds of the sums of their first $k$ eigenvalues which improve the previous results.

In this paper, we study eigenvalues of the poly-Laplacian with arbitrary order on a bounded domain in an $n$-dimensional Euclidean space and obtain a lower bound for eigenvalues, which gives an important improvement of results due to Levine and Protter. In particular, the result of Melas is included here.

In this paper, we obtain a sharp upper bound for the sum of the first $k$-th eigenvalues for this Dirichlet problem of poly-Laplacian with any order, which is viewed as an extension of the result due to Cheng and Wei (Journal of Differential Equations, 255 (2013), 220-233). In particular, if $l=2$ and $k$ is large enou…

In this paper, we study eigenvalues of the poly-Laplacian with arbitrary order on a bounded domain in an n-dimensional Euclidean space and obtain a lower bound for eigenvalues, which generalizes the results due to Cheng-Wei [5] and gives an improvement of results due to Cheng- Qi-Wei [3].

We consider the higher order buckling eigenvalues of the following Dirichlet poly-Laplacian in the unit sphere $(-Δ)^p u=Λ(-Δ) u$ with order $p(\geq2)$. We obtain universal bounds on the $(k+1)$th eigenvalue in terms of the first $k$th eigenvalues independent of the domains. In particular, for $p=2$, our result is shar…