All Real Eigenvalues of Symmetric Tensors

This paper studies how to compute all real eigenvalues, associated to real eigenvectors, of a symmetric tensor. As is well known, the largest or smallest eigenvalue can be found by solving a polynomial optimization problem, while the other middle ones cannot. We propose a new approach for computing...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on matrix analysis and applications 2014-01, Vol.35 (4), p.1582-1601
Main Authors: Cui, Chun-Feng, Dai, Yu-Hong, Nie, Jiawang
Format: Article
Language:English
Subjects:
Computation
Eigenvalues
Hierarchies
Jacobians
Mathematical analysis
Optimization
Polynomials
Tensors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies how to compute all real eigenvalues, associated to real eigenvectors, of a symmetric tensor. As is well known, the largest or smallest eigenvalue can be found by solving a polynomial optimization problem, while the other middle ones cannot. We propose a new approach for computing all real eigenvalues sequentially, from the largest to the smallest. It uses Jacobian semidefinite relaxations in polynomial optimization. We show that each eigenvalue can be computed by solving a finite hierarchy of semidefinite relaxations. Numerical experiments are presented to show how to do this.
ISSN:0895-4798
1095-7162
DOI:10.1137/140962292