arXiv Analytics

Sign in

arXiv:1712.04253 [math.OC]AbstractReferencesReviewsResources

Upper bounds for Z$_1$-eigenvalues of generalized Hilbert tensors

Juan Meng, Yisheng Song

Published 2017-12-12Version 1

In this paper, we introduce the concept of Z$_1$-eigenvalue to infinite dimensional generalized Hilbert tensors (hypermatrix) $\mathcal{H}_\lambda^{\infty}=(\mathcal{H}_{i_{1}i_{2}\cdots i_{m}})$, $$ \mathcal{H}_{i_{1}i_{2}\cdots i_{m}}=\frac{1}{i_{1}+i_{2}+\cdots i_{m}+\lambda},\ \lambda\in \mathbb{R}\setminus\mathbb{Z}^-;\ i_{1},i_{2},\cdots,i_{m}=0,1,2,\cdots,n,\cdots, $$ and proved that its $Z_1$-spectral radius is not larger than $\pi$ for $\lambda>\frac{1}{2}$, and is at most $\frac{\pi}{\sin{\lambda\pi}}$ for $\frac{1}{2}\geq \lambda>0$. Besides, the upper bound of $Z_1$-spectral radius of an $m$th-order $n$-dimensional generalized Hilbert tensor $\mathcal{H}_\lambda^n$ is obtained also, and such a bound only depends on $n$ and $\lambda$.

Related articles: Most relevant | Search more
arXiv:2010.04187 [math.OC] (Published 2020-10-08)
A new upper bound for the multiple knapsack problem
arXiv:1904.08828 [math.OC] (Published 2019-04-18)
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
arXiv:2301.10637 [math.OC] (Published 2023-01-25)
Bit-complexity estimates in geometric programming, and application to the polynomial-time computation of the spectral radius of nonnegative tensors