Iterative algorithms for computing US- and U-eigenpairs of complex tensors

DOI10.1016/j.cam.2016.12.022zbMath1357.65042OpenAlexW2565564369MaRDI QIDQ508028

Liqun Qi, Yi-Min Wei, Mao-Lin Che

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

zbMATH Keywords

numerical examplesiterative algorithmsTakagi factorizationcomplex symmetric matricescomplex symmetric tensorscomplex tensorspower-type methodU-eigenpairsUS-eigenpairs

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Vector and tensor algebra, theory of invariants (15A72)

Related Items (5)

$U$-Eigenvalues’ Inclusion Sets of Complex 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 ⋮ A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors ⋮ Pseudospectra localizations for generalized tensor eigenvalues to seek more positive definite tensors

Uses Software

• Complex Optimization Toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• A novel parameter separation based identification algorithm for Hammerstein systems
• Hierarchical gradient parameter estimation algorithm for Hammerstein nonlinear systems using the key term separation principle
• Novel data filtering based parameter identification for multiple-input multiple-output systems using the auxiliary model
• A complex-valued neural dynamical optimization approach and its stability analysis
• Z-eigenvalue methods for a global polynomial optimization problem
• Block tensors and symmetric embeddings
• Best rank one approximation of real symmetric tensors can be chosen symmetric
• Hankel tensors: associated Hankel matrices and Vandermonde decomposition
• Application of the Newton iteration algorithm to the parameter estimation for dynamical systems
• Eigenvalues of a real supersymmetric tensor
• On the best rank-1 approximation to higher-order symmetric tensors
• On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
• Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors
• 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
• On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors
• Exponential data fitting using multilinear algebra: the single‐channel and multi‐channel case
• Iterative algorithm for parameter identification of Hammerstein systems with two-segment nonlinearities
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Unconstrained Optimization of Real Functions in Complex Variables
• Fast Hankel tensor–vector product and its application to exponential data fitting
• Kalman state filtering based least squares iterative parameter estimation for observer canonical state space systems using decomposition

This page was built for publication: Iterative algorithms for computing US- and U-eigenpairs of complex tensors