Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization
From MaRDI portal
Publication:2107286
DOI10.1007/S10092-022-00498-XzbMATH Open1503.15034arXiv2109.03722OpenAlexW4310481811MaRDI QIDQ2107286FDOQ2107286
Authors: Erna Begović Kovač
Publication date: 1 December 2022
Published in: Calcolo (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2109.03722
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
Multilinear algebra, tensor calculus (15A69) Orthogonalization in numerical linear algebra (65F25) Diagonalization, Jordan forms (15A20)
Cites Work
- Tensor Decompositions and Applications
- Hierarchical Singular Value Decomposition of Tensors
- A Multilinear Singular Value Decomposition
- Tensor spaces and numerical tensor calculus
- Title not available (Why is that?)
- Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
- A new truncation strategy for the higher-order singular value decomposition
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
- Finding the closest normal structured matrix
- Structure-preserving low multilinear rank approximation of antisymmetric tensors
Cited In (8)
- ST-SVD factorization and s-diagonal tensors
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- Trace maximization algorithm for the approximate tensor diagonalization
- A locally convergent Jacobi iteration for the tensor singular value problem
- Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
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)