pith. sign in

arxiv: 1702.03750 · v2 · pith:5AM4Q3NAnew · submitted 2017-02-13 · 🧮 math.NA · cs.IT· math.IT· math.OC

Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization

classification 🧮 math.NA cs.ITmath.ITmath.OC
keywords diagonalizationorthogonalsimultaneoussymmetricalgorithmalgorithmsconvergenceglobal
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.