REVIEW
Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.