Computing tensor eigenvalues via homotopy methods
From MaRDI portal
Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to systems of equations (65H10) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Abstract: We introduce the concept of mode-k generalized eigenvalues and eigenvectors of a tensor and prove some properties of such eigenpairs. In particular, we derive an upper bound for the number of equivalence classes of generalized tensor eigenpairs using mixed volume. Based on this bound and the structures of tensor eigenvalue problems, we propose two homotopy continuation type algorithms to solve tensor eigenproblems. With proper implementation, these methods can find all equivalence classes of isolated generalized eigenpairs and some generalized eigenpairs contained in the positive dimensional components (if there are any). We also introduce an algorithm that combines a heuristic approach and a Newton homotopy method to extract real generalized eigenpairs from the found complex generalized eigenpairs. A MATLAB software package TenEig has been developed to implement these methods. Numerical results are presented to illustrate the effectiveness and efficiency of TenEig for computing complex or real generalized eigenpairs.
Recommendations
- Linear homotopy method for computing generalized tensor eigenpairs
- Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors
- An adaptive shifted power method for computing generalized tensor eigenpairs
- Noda iteration for computing generalized tensor eigenpairs
- Shifted power method for computing tensor eigenpairs
Cites work
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- A survey on the spectral theory of nonnegative tensors.
- Algorithm 795
- All real eigenvalues of symmetric tensors
- An adaptive shifted power method for computing generalized tensor eigenpairs
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors
- D-eigenvalues of diffusion kurtosis tensors
- Eigenvalues of a real supersymmetric tensor
- Eigenvectors of tensors and algorithms for Waring decomposition
- Finding All Solutions to a System of Polynomial Equations
- Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method.
- Finding the largest eigenvalue of a nonnegative tensor
- Further results for Perron-Frobenius theorem for nonnegative tensors
- Further Results for Perron–Frobenius Theorem for Nonnegative Tensors II
- Higher order positive semidefinite diffusion tensor imaging
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Homotopy techniques for tensor decomposition and perfect identifiability
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- scientific article; zbMATH DE number 2109418 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 3082712 (Why is no real title available?)
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Linear convergence of the LZI algorithm for weakly positive tensors
- Most tensor problems are NP-hard
- Nonnegative diffusion orientation distribution function
- Numerical multilinear algebra and its applications
- Numerically solving polynomial systems with Bertini
- On eigenvalue problems of real symmetric tensors
- On the largest eigenvalue of a symmetric nonnegative tensor.
- On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Perron-Frobenius theorem for nonnegative tensors
- PHoM -- a polyhedral homotopy continuation method for polynomial systems
- Semidefinite relaxations for best rank-1 tensor approximations
- Shifted power method for computing tensor eigenpairs
- Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
- Spectra of uniform hypergraphs
- The Z-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- The BKK root count in $\mathbf {C}^n$
- The number of eigenvalues of a tensor
- The number of roots of a system of equations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Using Algebraic Geometry
- Z-eigenvalue methods for a global polynomial optimization problem
Cited in
(64)- Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors
- Tensor decomposition and homotopy continuation
- A modified Newton iteration for finding nonnegative \(Z\)-eigenpairs of a nonnegative tensor
- A continuation method for tensor complementarity problems
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- Numerical ranges of even-order tensor
- Computing tensor Z-eigenvalues via shifted inverse power method
- Direct methods to compute all \(Z\)-eigenpairs of a tensor with dimension 2 or 3
- Z-eigenvalue intervals of even-order tensors with application to judge the strong ellipticity of an elasticity tensor
- The geometric measure of entanglement of multipartite states and the \(Z\)-eigenvalue of tensors
- Calculating \(C\)-eigenpairs of piezoelectric-type tensors via a \(Z\)-eigenpair method
- Spectra of weighted uniform hypertrees
- Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
- Z-eigenvalue inclusion theorem of tensors and the geometric measure of entanglement of multipartite pure states
- A combinatorial method for computing characteristic polynomials of starlike hypergraphs
- Positive definiteness for 4th order symmetric tensors and applications
- Tensor complementarity problems. II: Solution methods
- Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
- \(Z\)-eigenvalues based structured tensors: \(\mathcal{M}_Z\)-tensors and strong \(\mathcal{M}_Z\)-tensors
- Solving tensor E-eigenvalue problem faster
- An adaptive gradient method for computing generalized tensor eigenpairs
- Computing extreme eigenvalues of large scale Hankel tensors
- Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems
- Unmixing the mixed volume computation
- A homotopy method for computing the largest eigenvalue of an irreducible nonnegative tensor
- TenEig
- New Z-eigenvalue inclusion theorem of tensors with application to the geometric measure of entanglement
- Shifted power method for computing tensor H-eigenpairs.
- Computing eigenvalues of large scale sparse tensors arising from a hypergraph
- Newton correction methods for computing real eigenpairs of symmetric tensors
- Eigenvectors of tensors and algorithms for Waring decomposition
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- Computing the dominant eigenpair of an essentially nonnegative tensor via a homotopy method
- Perturbation bounds for the largest C-eigenvalue of piezoelectric-type tensors
- An adaptive cubic regularization algorithm for computing H- and Z-eigenvalues of real even-order supersymmetric tensors
- On the stability of discrete-time homogeneous polynomial dynamical systems
- A family of gradient methods using Householder transformation with application to hypergraph partitioning
- A projection method based on discrete normalized dynamical system for computing C-eigenpairs
- On Best Low Rank Approximation of Positive Definite Tensors
- Noda iteration for computing generalized tensor eigenpairs
- Bounded homotopy path approach to the solution of linear complementarity problems
- Calculations for D-eigenvalues of a diffusion kurtosis tensor
- Locally Optimal Eigenpairs of Orthogonally Decomposable Tensors: A Generalized Proof
- A criterion for the positive semidefiniteness of a diffusivity function
- Calculation for all D-eigenvalues of a diffusion kurtosis tensor
- Direct methods of B(D)-eigenpairs of tensors and application in diffusion kurtosis imaging
- Boundedness-below conditions for a general scalar potential of two real scalar fields and the Higgs boson
- Modified Z-eigenvalue inclusion intervals for tensors with applications
- Calculations for D-eigenpairs of a diffusion kurtosis tensor
- Accelerating the computation of tensor Z-eigenvalues
- Positivity of GCD tensors and their determinants
- A derivative-free spectral residual method for computing generalized eigenpairs of weakly symmetric tensors
- Criteria for positive definiteness of diffusion kurtosis imaging
- Moore-Penrose inverse-based methods for computing all D-eigenpairs of a diffusion kurtosis tensor
- Geršhgorin-type theorems for Z₁-eigenvalues of tensors with applications
- Bounds for Z_p-eigenpairs of a tensor with application to geometric measure of entanglement
- Rayleigh quotient iteration, cubic convergence, and second covariant derivative
- Positive definiteness of a class of cyclic symmetric tensors
- Linear homotopy method for computing generalized tensor eigenpairs
- A feasible conjugate gradient method for calculating \(\mathcal{B}\)-eigenpairs of symmetric tensors
- Positive definiteness and differential results for generalized Hilbert tensors
- Computation of all D-eigenpairs for a weakly symmetric tensor
- A trust region algorithm for computing extreme eigenvalues of tensors
- Further results for \(Z\)-eigenvalue localization theorem for higher-order tensors and their applications
This page was built for publication: Computing tensor eigenvalues via homotopy methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2797103)
