For a general third-order tensor $\mathcal{A}\in\mathbb{R}^{n\times n\times n}$ the paper studies two closely related problems, an SVD-like tensor decomposition and an (approximate) tensor diagonalization. We develop a Jacobi-type algorithm that works on $2\times2\times2$ subtensors and, in each iteration, maximizes the sum of squares of its diagonal entries. We show how the rotation angles are calculated and prove convergence of the algorithm. Different initializations of the algorithm are discussed, as well as the special cases of symmetric and antisymmetric tensors. The algorithm can be generalized to work on higher-order tensors.
Globally Convergent Jacobi-Type Algorithms for Robust Approximate Diagonalization of Higher-Order Cumulant Tensors
School of Science, Sun Yat-sen University(中山大学理学院);Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong(香港理工大学系统工程及工程管理学系);Centre de Recherche en Automatique de Nancy (CRAN), Université de Lorraine, CNRS(洛林大学国家科学研究中心南西自动化研究中心)
Jacobi-type algorithm for low rank orthogonal approximation of symmetric tensors and its convergence analysis
本文提出了一种求解对称张量低秩正交逼近问题的Jacobi型算法。该算法包括著名的Jacobi CoM 2算法的一个特殊情况下,近似正交对角化问题的对称张量。首先证明了该算法的弱收敛性,即\textit{i.e.}的任何聚点都是一个平稳点。然后研究了该算法在梯度序下的整体收敛:三阶对称张量的最佳秩2正交逼近,并证明了在一定条件下聚点是唯一的极限点.数值实验表明了该算法的有效性。
Institute of Information Theory and Automation(信息与自动化研究所);Brain Science Institute, RIKEN(理化学研究所脑科学研究所);Systems Research Institute, Polish Academy of Sciences(波兰科学院系统研究所)
Convergence rates of spectral orthogonal projection approximation for functions of algebraic and logarithmatic regularities
基于雅可比多项式与Bessel函数之间的Hilb型公式,应用van der Corput型引理,导出了奇异函数Jacobi展开系数的最优衰减率,从而得到了Jacobi、Gegenbauer和Chebyshev正交投影上的最优收敛速度.有趣的是,对于边界奇点,随着$(α,β)$和$λ$的增加,可以在Jacobi或Gegenbauer投影上获得更快的收敛速度。参数值越大,可以实现越高的收敛速度。特别地,勒让德投影比切比雪夫投影高半阶。而且,当$\min\{α,β\}>0$和$λ>\frac{1}{2}$满足条件时,Jacobi和Gegenbauer正交投影的收敛阶数比Legendre投影的收敛阶数高.而对于内部奇异性,收敛阶与$(α,β)$和$λ$无关.