Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:P4IPRNVNrecord.jsonopen to challenge →
classification
math.OC
cs.NAmath.NA
keywords
convergenceunitaryalgorithmapproximatediagonalizationresultstensorstransformations
read the original 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.
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.