Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
Not on the map. Why?
Abstract (arXiv)
In this paper, we consider a family of Jacobi-type algorithms for simultaneous orthogonal diagonalization problem of symmetric tensors. For the Jacobi-based algorithm of [SIAM J. Matrix Anal. Appl., 2(34):651--672, 2013], we prove its global convergence for simultaneous orthogonal diagonalization of symmetric matrices and 3rd-order tensors. We also propose a new Jacobi-based algorithm in the general setting and prove its global convergence for sufficiently smooth functions.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 13 Feb 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.