Abstract
It is well known that the dominant eigenvalue of a real essentially nonnegative matrix is a convex function of its diagonal entries. This convexity is of practical importance in population biology, graph theory, demography, analytic hierarchy process, and so on. In this paper, the concept of essentially nonnegativity is extended from matrices to higher-order tensors, and the convexity and log convexity of dominant eigenvalues for such a class of tensors are established. Particularly, for any nonnegative tensor, the spectral radius turns out to be the dominant eigenvalue and hence possesses these convexities. Finally, an algorithm is given to calculate the dominant eigenvalue, and numerical results are reported to show the effectiveness of the proposed algorithm.
Original language | English |
---|---|
Pages (from-to) | 929-941 |
Number of pages | 13 |
Journal | Numerical Linear Algebra with Applications |
Volume | 20 |
Issue number | 6 |
DOIs | |
Publication status | Published - 1 Dec 2013 |
Keywords
- Algorithm
- Convex function
- Dominant eigenvalue
- Essentially nonnegative tensor
- Spectral radius
ASJC Scopus subject areas
- Algebra and Number Theory
- Applied Mathematics