The dominant eigenvalue of an essentially nonnegative tensor.
DOI10.1002/NLA.1880zbMATH Open1313.65084arXiv1110.6261OpenAlexW1934106263MaRDI QIDQ2936741FDOQ2936741
Liqun Qi, Ziyan Luo, Liping Zhang, Yi Xu
Publication date: 6 January 2015
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.6261
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
numerical resultsalgorithmconvex functionspectral radiusdominant eigenvalueessentially nonnegative tensor
Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Positive matrices and their generalizations; cones of matrices (15B48)
Cites Work
- The number of eigenvalues of a tensor
- Eigenvalues of a real supersymmetric tensor
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- On eigenvalue problems of real symmetric tensors
- Further Results for Perron–Frobenius Theorem for Nonnegative Tensors
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- Finding the Largest Eigenvalue of a Nonnegative Tensor
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- Perron-Frobenius theorem for nonnegative tensors
- D-eigenvalues of diffusion kurtosis tensors
- A generalization of the Motzkin-Straus theorem to hypergraphs
- Algebraic connectivity of an even uniform hypergraph
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- Convexity and log convexity for the spectral radius
- Derivatives of the Perron root of a positive reciprocal matrix: with application to the analytic hierarchy process
- Linear Convergence of the LZI Algorithm for Weakly Positive Tensors
- Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor
- Convex spectral functions
- Einschliessungssatz für die charakteristischen Zahlen von Matrizen
- Conditions for strong ellipticity and M-eigenvalues
- On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
- Dominant eigenvalues under trace-preserving diagonal perturbations
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
- 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
- A survey on the spectral theory of nonnegative tensors
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)