Computing Extreme Eigenvalues of Large Scale Hankel Tensors

  title={Computing Extreme Eigenvalues of Large Scale Hankel Tensors},
  author={Yannan Chen and Liqun Qi and Qun Wang},
  journal={Journal of Scientific Computing},
Large scale tensors, including large scale Hankel tensors, have many applications in science and engineering. In this paper, we propose an inexact curvilinear search optimization method to compute Z- and H-eigenvalues of mth order n dimensional Hankel tensors, where n is large. Owing to the fast Fourier transform, the computational cost of each iteration of the new method is about $$\mathcal {O}(mn\log (mn))$$O(mnlog(mn)). Using the Cayley transform, we obtain an effective curvilinear search… 
Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph
A first-order optimization algorithm for computing H- and Z-eigenvalues of these large scale sparse tensors (CEST) and it is proved that the sequence of iterates generated by CEST converges to an eigenvector of the tensor.
Computing Z-Eigenvalue Of Hankel Tensors
  • Xiang Liu, Jie Wen
  • Computer Science
    2019 16th International Computer Conference on Wavelet Active Media Technology and Information Processing
  • 2019
This paper proposes a conjugate gradient algorithm with simple line search (CGLS) for solving Z-eigenvalue of Hankel tensors and analyzes the convergence of the CGLS algorithm and adjusts suitable parameters in the algorithm.
On computing minimal H-eigenvalue of sign-structured tensors
A sum-of-squares (SOS) algorithm for computing the minimal H-eigenvalues of tensors with some sign structures called extended essentially non negative tensors (EEN-tensors), which includes nonnegative tensors as a subclass.
Computing the generalized eigenvalues of weakly symmetric tensors
Two convergent gradient projection methods for computing some generalized eigenvalues of weakly symmetric tensors and a spectral gradient projection method which is born from the combination of the BB method with the gradient projections method is superior to the GEAP, AG and AGP methods.
Tensor convolutions and Hankel tensors
Let A be an mth order n-dimensional tensor, where m, n are some positive integers and N:= m(n−1). Then A is called a Hankel tensor associated with a vector v ∈ ℝN+1 if Aσ = vk for each k = 0, 1,...,N
Finding the maximum eigenvalue of a class of tensors with applications in copositivity test and hypergraphs
A structured semi-definite program algorithm for computing the maximum eigenvalue of a class of tensors with sign structure called W-tensors, based on a new structured sums-of-squares decomposition result for a nonnegative homogeneous polynomial induced by a $W-tensor.
A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
This paper introduces a new class of structured tensors called W‐tensors, which not only extends the well‐studied nonnegative tensors by allowing negative entries but also covers several important tensors arising naturally from spectral hypergraph theory.
The Decomposition Algorithm of Hankel Tensors
  • Zhu Wenhuan, Wen Jie
  • Computer Science
    2018 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)
  • 2018
An algorithm is discussed that can compute the decomposition expression and the rank of the Hankel tensor by iterative method and the efficiency and accuracy of proposed method can be demonstrated through numerical examples.
An adaptive gradient method for computing generalized tensor eigenpairs
In this paper, an adaptive gradient (AG) method is presented for generalized tensor eigenpairs and global convergence and linear convergence rate are established under some suitable conditions.
A trust region algorithm for computing extreme eigenvalues of tensors
A trust region algorithm for the spherically constrained optimization of tensor eigenvalue problem to a nonlinear optimization with a spherical constraint is proposed in this paper.


Fast Hankel tensor–vector product and its application to exponential data fitting
A fast algorithm for Hankel tensor–vector products is obtained by embedding a Hankel Tensor into a larger anti-circulant tensor, and the computational complexity is about O(m2nlogmn) for a square Hanko tensor of order m and dimension n.
Shifted Power Method for Computing Tensor Eigenpairs
A shifted symmetric higher-order power method (SS-HOPM), which it is shown is guaranteed to converge to a tensor eigenpair, and a fixed point analysis is used to characterize exactly which eigenpairs can and cannot be found by the method.
A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors
The main idea of SSPM is to form a 2-dimensional subspace at the current point and then solve the original optimization problem in the subspace and the globalization strategy of random phase can be easily incorporated into S SPM, which promotes the ability to find extreme Z-eigenvalues.
Computing Tensor Eigenvalues via Homotopy Methods
An upper bound is derived for the number of equivalence classes of generalized tensor eigenpairs using mixed volume and an algorithm is introduced that combines a heuristic approach and a Newton homotopy method to extract real generalized eigpairs from the found complex generalized eigen pairs.
Efficient MATLAB Computations with Sparse and Factored Tensors
This paper considers how specially structured tensors allow for efficient storage and computation, and proposes storing sparse tensors using coordinate format and describes the computational efficiency of this scheme for various mathematical operations, including those typical to tensor decomposition algorithms.
On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
It is shown that a symmetric version of the above method converges under assumptions of convexity (or concavity) for the functional induced by the tensor in question, assumptions that are very often satisfied in practical applications.
Z-eigenvalue methods for a global polynomial optimization problem
This paper proposes some Z-eigenvalue methods for solving the problem of the best rank-one approximation to higher order tensors, and proposes a direct orthogonal transformation Z- eigenvalue method for this problem in the case of order three and dimension three.
Hankel Tensors: Associated Hankel Matrices and Vandermonde Decomposition
Hankel tensors arise from applications such as signal processing. In this paper, we make an initial study on Hankel tensors. For each Hankel tensor, we associate it with a Hankel matrix and a higher
Hankel tensors, Vandermonde tensors and their positivities☆
Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method
An approximation method is proposed to solve the TCLP by using a sequence of semidefinite programming problems, and it gives a numerical algorithm to compute the extreme Z-eigenvalue of an even order tensor with dimension larger than three, which improves the literature.