A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors
From MaRDI portal
Publication:2948100
DOI10.1002/nla.1949zbMath1363.65063OpenAlexW1824940946MaRDI QIDQ2948100
Chunlin Hao, Chunfeng Cui, Yu-Hong Dai
Publication date: 29 September 2015
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.1949
global convergencenumerical resultslinear convergenceMatlabGloptiPolysupersymmetric tensorextreme Z-eigenvaluesequential subspace projection methodZ-eigenvectors
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Multilinear algebra, tensor calculus (15A69)
Related Items (26)
An adaptive gradient method for computing generalized tensor eigenpairs ⋮ Newton Correction Methods for Computing Real Eigenpairs of Symmetric Tensors ⋮ Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors ⋮ Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors ⋮ Computing extreme eigenvalues of large scale Hankel tensors ⋮ Greedy Approaches to Symmetric Orthogonal Tensor Decomposition ⋮ A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors ⋮ A nonmonotone accelerated Levenberg–Marquardt method for the ‐eigenvalues of symmetric tensors ⋮ 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 ⋮ Feasible Newton methods for symmetric tensor Z-eigenvalue problems ⋮ Positive definiteness for 4th order symmetric tensors and applications ⋮ Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method ⋮ Globally maximizing the sum of squares of quadratic forms over the unit sphere ⋮ Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems ⋮ Computing the generalized eigenvalues of weakly symmetric tensors ⋮ A hybrid second-order method for homogenous polynomial optimization over unit sphere ⋮ Computing Tensor Eigenvalues via Homotopy Methods ⋮ Computing tensor Z-eigenvalues via shifted inverse power method ⋮ Symmetric rank-1 approximation of symmetric high-order tensors ⋮ A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for \(\mathcal{B} \)-eigenvalues of symmetric tensors ⋮ Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement ⋮ Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph ⋮ 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 ⋮ A generalization of inverse power method for computing eigenpairs of symmetric tensors
Uses Software
Cites Work
- An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors
- Eigenvalues and invariants of tensors
- The degree of the E-characteristic polynomial of an even order tensor
- Z-eigenvalue methods for a global polynomial optimization problem
- Multivariate polynomial minimization and its application in signal processing
- Eigenvalues of a real supersymmetric tensor
- Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines
- Rank-One Approximation to High Order Tensors
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- A SEQUENTIAL SUBSPACE PROJECTION METHOD FOR LINEAR SYMMETRIC EIGENVALUE PROBLEM
- Shifted Power Method for Computing Tensor Eigenpairs
- Multigrid Accelerated Tensor Approximation of Function Related Multidimensional Arrays
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
- An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
- Fast Algorithms for Projection on an Ellipsoid
- Higher Order Positive Semidefinite Diffusion Tensor Imaging
This page was built for publication: A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors
