Iterative algorithms for computing US- and U-eigenpairs of complex tensors
From MaRDI portal
Publication:508028
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
Cites work
- scientific article; zbMATH DE number 1820149 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A complex-valued neural dynamical optimization approach and its stability analysis
- A novel parameter separation based identification algorithm for Hammerstein systems
- Application of the Newton iteration algorithm to the parameter estimation for dynamical systems
- Best rank one approximation of real symmetric tensors can be chosen symmetric
- Block tensors and symmetric embeddings
- Eigenvalues of a real supersymmetric tensor
- 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.
- Finding the extreme \(Z\)-eigenvalues of tensors via a sequential semidefinite programming method.
- Geometric measure of entanglement and U-eigenvalues of tensors
- Hankel tensors: associated Hankel matrices and Vandermonde decomposition
- 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
- Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
- Kalman state filtering based least squares iterative parameter estimation for observer canonical state space systems using decomposition
- Novel data filtering based parameter identification for multiple-input multiple-output systems using the auxiliary model
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the best rank-1 approximation to higher-order symmetric tensors
- On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors
- Semidefinite relaxations for best rank-1 tensor approximations
- Tensor Decompositions and Applications
- Unconstrained Optimization of Real Functions in Complex Variables
- Z-eigenvalue methods for a global polynomial optimization problem
Cited in
(7)- $U$-Eigenvalues’ Inclusion Sets of Complex Tensors
- Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method
- Pseudospectra localizations for generalized tensor eigenvalues to seek more positive definite tensors
- 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
- Spherical optimization with complex variables for computing US-eigenpairs
- An alternating shifted higher order power method based algorithm for rank-\(R\) Hermitian approximation and solving Hermitian CP-decomposition problems
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)
