Computing extreme eigenvalues of large scale Hankel tensors
From MaRDI portal
Publication:2399200
DOI10.1007/s10915-015-0155-8zbMath1377.65046arXiv1504.07413OpenAlexW224542248MaRDI QIDQ2399200
Qun Wang, Yannan Chen, Liqun Qi
Publication date: 22 August 2017
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.07413
algorithmconvergencefast Fourier transformnumerical experimentCayley transformHankel tensorcurvilinear searchcomputational costextreme eigenvaluelarge scale tensorinexact steepest descent method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20) Multilinear algebra, tensor calculus (15A69)
Related Items (19)
A trust region algorithm for computing extreme eigenvalues of tensors ⋮ An adaptive gradient method for computing generalized tensor eigenpairs ⋮ Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors ⋮ Copositivity detection of tensors: theory and algorithm ⋮ The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning ⋮ An adaptive cubic regularization algorithm for computing H- and Z-eigenvalues of real even-order supersymmetric tensors ⋮ A family of gradient methods using Householder transformation with application to hypergraph partitioning ⋮ A Note on the Multidimensional Moment Problem ⋮ Hankel Tensor Decompositions and Ranks ⋮ Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems ⋮ Improved SVRG for finite sum structure optimization with application to binary classification ⋮ Inheritance properties and sum-of-squares decomposition of Hankel tensors: theory and algorithms ⋮ Computing the generalized eigenvalues of weakly symmetric tensors ⋮ On computing minimal \(H\)-eigenvalue of sign-structured tensors ⋮ Tensor convolutions and Hankel tensors ⋮ Unnamed Item ⋮ A derivative-free algorithm for spherically constrained optimization ⋮ Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph ⋮ Solving tensor E-eigenvalue problem faster
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors
- An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors
- Nonnegative diffusion orientation distribution function
- Spectra of uniform hypergraphs
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Z-eigenvalue methods for a global polynomial optimization problem
- Hankel tensors: associated Hankel matrices and Vandermonde decomposition
- Infinite and finite dimensional Hilbert tensors
- Eigenvalues of a real supersymmetric tensor
- On eigenvalue problems of real symmetric tensors
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- Computing Tensor Eigenvalues via Homotopy Methods
- Positive Semidefinite Generalized Diffusion Tensor Imaging via Quadratic Semidefinite Programming
- Geometric Measure of Entanglement and U-Eigenvalues of Tensors
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method
- Exploiting Symmetry in Tensors for High Performance: Multiplication with Symmetric Tensors
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors
- Frequency Domain Subspace Identification Using Nuclear Norm Minimization and Hankel Matrix Realizations
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A Curvilinear Search Method for p-Harmonic Flows on Spheres
- Shifted Power Method for Computing Tensor Eigenpairs
- Exponential data fitting using multilinear algebra: the single‐channel and multi‐channel case
- Efficient MATLAB Computations with Sparse and Factored Tensors
- The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
- Two-Point Step Size Gradient Methods
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Higher Order Tensor-Based Method for Delayed Exponential Fitting
- Hankel hyperdeterminants and Selberg integrals
- An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
- An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs
- All Real Eigenvalues of Symmetric Tensors
- Most Tensor Problems Are NP-Hard
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Generalized Tensor Eigenvalue Problems
- Fast Hankel tensor–vector product and its application to exponential data fitting
- Hankel tensors, Vandermonde tensors and their positivities
This page was built for publication: Computing extreme eigenvalues of large scale Hankel tensors
