The dominant eigenvalue of an essentially nonnegative tensor.
From MaRDI portal
Publication:2936741
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.
Recommendations
- Computing the dominant eigenpair of an essentially nonnegative tensor via a homotopy method
- On the largest eigenvalue of a symmetric nonnegative tensor.
- Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor.
- Essentially positive tensors
- Convexity and log convexity for the spectral radius
Cites work
- A generalization of the Motzkin-Straus theorem to hypergraphs
- Algebraic connectivity of an even uniform hypergraph
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- Conditions for strong ellipticity and M-eigenvalues
- Convex spectral functions
- Convexity and log convexity for the spectral radius
- D-eigenvalues of diffusion kurtosis tensors
- Derivatives of the Perron root of a positive reciprocal matrix: with application to the analytic hierarchy process
- Dominant eigenvalues under trace-preserving diagonal perturbations
- Eigenvalues of a real supersymmetric tensor
- Einschliessungssatz für die charakteristischen Zahlen von Matrizen
- Finding the largest eigenvalue of a nonnegative tensor
- Further results for Perron-Frobenius theorem for nonnegative tensors
- Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor.
- Linear convergence of the LZI algorithm for weakly positive tensors
- On eigenvalue problems of real symmetric tensors
- On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Perron-Frobenius theorem for nonnegative tensors
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- The number of eigenvalues of a tensor
Cited in
(14)- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- Strictly nonnegative tensors and nonnegative tensor partition
- Partially symmetric nonnegative rectangular tensors and copositive rectangular tensors
- Spectral inequalities for nonnegative tensors and their tropical analogues
- Dominant eigenvalue minimization with trace preserving diagonal perturbation: subset design problem
- Computing the dominant eigenpair of an essentially nonnegative tensor via a homotopy method
- Boundedness-below conditions for a general scalar potential of two real scalar fields and the Higgs boson
- The spectral theory of tensors and its applications
- A survey on the spectral theory of nonnegative tensors.
- Dominant eigenvalues under trace-preserving diagonal perturbations
- Solving tensor E-eigenvalue problem faster
- Generalized minimal Gershgorin set for tensors
- Positive definiteness for 4th order symmetric tensors and applications
This page was built for publication: The dominant eigenvalue of an essentially nonnegative tensor.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936741)
