2014/11/07 by Kim Batselier, Batselier, Kim, Ngai Wong +1
Computer Science · Mathematics · #Algorithms and Data Compression #FOS: Mathematics #Numerical Analysis (math.NA) #Parallel Computing and Optimization Techniques #Tensor decomposition and applications
paper · pdf · doi:10.48550/arxiv.1411.1926
openalex publication_date 2014/11/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We extend the celebrated QR algorithm for matrices to symmetric tensors. The algorithm, named QR algorithm for symmetric tensors (QRST), exhibits similar properties to its matrix version, and allows the derivation of a shifted implementation with faster convergence. We further show that multiple tensor eigenpairs can be found from a local permutation heuristic which is effectively a tensor similarity transform, resulting in the permuted version of QRST called PQRST. Examples demonstrate the remarkable effectiveness of the proposed schemes for finding stable and unstable eigenpairs not found by previous tensor power methods.