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č Edit this on Wikidata


Publication date: 1 December 2022

Published in: Calcolo (Search for Journal in Brave)

Abstract: For a general third-order tensor mathcalAinmathbbRnimesnimesn 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 2imes2imes2 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




Cites Work


Cited In (8)





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)