Iterative algorithms for computing US- and U-eigenpairs of complex tensors
DOI10.1016/J.CAM.2016.12.022zbMATH Open1357.65042OpenAlexW2565564369MaRDI QIDQ508028FDOQ508028
Authors: Liqun Qi, Mao-Lin Che, Yimin Wei 
Publication date: 9 February 2017
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2016.12.022
Recommendations
- A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors
- Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
- Newton correction methods for computing real eigenpairs of symmetric tensors
- Shifted power method for computing tensor eigenpairs
- Spherical optimization with complex variables for computing US-eigenpairs
numerical examplesiterative algorithmscomplex symmetric matricesTakagi factorizationcomplex symmetric tensorscomplex tensorspower-type methodU-eigenpairsUS-eigenpairs
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Vector and tensor algebra, theory of invariants (15A72)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tensor Decompositions and Applications
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Eigenvalues of a real supersymmetric tensor
- Z-eigenvalue methods for a global polynomial optimization problem
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Hankel tensors: associated Hankel matrices and Vandermonde decomposition
- Exponential data fitting using multilinear algebra: the single‐channel and multi‐channel case
- Fast Hankel tensor–vector product and its application to exponential data fitting
- Application of the Newton iteration algorithm to the parameter estimation for dynamical systems
- A novel parameter separation based identification algorithm for Hammerstein systems
- Best rank one approximation of real symmetric tensors can be chosen symmetric
- Hierarchical gradient parameter estimation algorithm for Hammerstein nonlinear systems using the key term separation principle
- Iterative algorithm for parameter identification of Hammerstein systems with two-segment nonlinearities
- Novel data filtering based parameter identification for multiple-input multiple-output systems using the auxiliary model
- Kalman state filtering based least squares iterative parameter estimation for observer canonical state space systems using decomposition
- On the best rank-1 approximation to higher-order symmetric tensors
- Semidefinite relaxations for best rank-1 tensor approximations
- On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors
- Block tensors and symmetric embeddings
- Finding the extreme \(Z\)-eigenvalues of tensors via a sequential semidefinite programming method.
- Unconstrained Optimization of Real Functions in Complex Variables
- Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
- Geometric measure of entanglement and U-eigenvalues of tensors
- A complex-valued neural dynamical optimization approach and its stability analysis
Cited In (6)
- Pseudospectra localizations for generalized tensor eigenvalues to seek more positive definite tensors
- Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method
- Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
- $U$-Eigenvalues’ Inclusion Sets of Complex Tensors
- An alternating shifted higher order power method based algorithm for rank-\(R\) Hermitian approximation and solving Hermitian CP-decomposition problems
- A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors
Uses Software
This page was built for publication: Iterative algorithms for computing US- and U-eigenpairs of complex tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508028)
