Computing tensor eigenvalues via homotopy methods. 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.
Keywords for this software
References in zbMATH (referenced in 6 articles , 1 standard article )
Showing results 1 to 6 of 6.
- Chang, Jingya; Ding, Weiyang; Qi, Liqun; Yan, Hong: Computing the $p$-spectral radii of uniform hypergraphs with applications (2018)
- Che, Maolin; Li, Guoyin; Qi, Liqun; Wei, Yimin: Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems (2017)
- Chen, Yannan; Qi, Liqun; Zhang, Xiaoyan: The Fiedler vector of a Laplacian tensor for hypergraph partitioning (2017)
- Chang, Jingya; Chen, Yannan; Qi, Liqun: Computing eigenvalues of large scale sparse tensors arising from a hypergraph (2016)
- Chen, Liping; Han, Lixing; Zhou, Liangmin: Computing tensor eigenvalues via homotopy methods (2016)
- Chen, Yannan; Qi, Liqun; Wang, Qun: Computing extreme eigenvalues of large scale Hankel tensors (2016)