Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization
From MaRDI portal
Publication:2107286
Abstract: For a general third-order tensor the paper studies two closely related problems, an SVD-like tensor decomposition and an (approximate) tensor diagonalization. We develop a Jacobi-type algorithm that works on subtensors and, in each iteration, maximizes the sum of squares of its diagonal entries. We show how the rotation angles are calculated and prove convergence of the algorithm. Different initializations of the algorithm are discussed, as well as the special cases of symmetric and antisymmetric tensors. The algorithm can be generalized to work on higher-order tensors.
Recommendations
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
Cites work
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- A Multilinear Singular Value Decomposition
- A new truncation strategy for the higher-order singular value decomposition
- Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
- Finding the closest normal structured matrix
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- Hierarchical Singular Value Decomposition of Tensors
- Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
- Structure-preserving low multilinear rank approximation of antisymmetric tensors
- Tensor Decompositions and Applications
- Tensor spaces and numerical tensor calculus
Cited in
(8)- Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
- ST-SVD factorization and s-diagonal tensors
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- A locally convergent Jacobi iteration for the tensor singular value problem
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- Trace maximization algorithm for the approximate tensor diagonalization
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
This page was built for publication: Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107286)