# Approximate matrix and tensor diagonalization by unitary   transformations: convergence of Jacobi-type algorithms

**Authors:** Konstantin Usevich (CRAN), Jianze Li (SRIBD), Pierre Comon, (GIPSA-CICS, GIPSA-GAIA)

arXiv: 1905.12295 · 2020-07-13

## TL;DR

This paper introduces a gradient-based Jacobi algorithm for approximate diagonalization of matrices and tensors using unitary transformations, proving its convergence properties including local linear convergence.

## Contribution

It presents a novel Jacobi algorithm with proven convergence for complex and real tensors, advancing methods for matrix and tensor diagonalization.

## Key findings

- Weak convergence results established
- Local linear convergence proved
- Applicable to complex and real tensors

## Abstract

We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence results, and prove local linear convergence of this algorithm.The convergence results also apply to the case of real-valued tensors.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1905.12295/full.md

## Figures

12 figures with captions in the complete paper: https://tomesphere.com/paper/1905.12295/full.md

## References

48 references — full list in the complete paper: https://tomesphere.com/paper/1905.12295/full.md

---
Source: https://tomesphere.com/paper/1905.12295