A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors

DOI10.1007/s11075-022-01303-0zbMath1500.65016arXiv2012.07595OpenAlexW3112172152WikidataQ114224274 ScholiaQ114224274MaRDI QIDQ2084262

Lars Eldén, Maryam Dehghan

Publication date: 18 October 2022

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.07595

zbMATH Keywords

Grassmann manifoldsymmetric tensorsparse tensorbest rank approximationblock Krylov-type methodKrylov-Schur algorithmmultilinear rank tensors

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Uses Software

• eigs
• TensorToolbox
• ARPACK
• Algorithm 862

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handwritten digit classification using higher order singular value decomposition
• Block Krylov-Schur method for large symmetric eigenvalue problems
• Differential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensors
• Decomposition of quantics in sums of powers of linear forms
• Krylov-type methods for tensor computations.I
• Low rank Tucker-type tensor approximation to classical potentials
• Matrix Algorithms
• Rank-One Approximation to High Order Tensors
• A Krylov--Schur Algorithm for Large Eigenproblems
• Wedderburn Rank Reduction and Krylov Subspace Method for Tensor Approximation. Part 1: Tucker Case
• Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
• Perturbation Theory and Optimality Conditions for the Best Multilinear Rank Approximation of a Tensor
• Algorithm 862
• A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor
• Multigrid Accelerated Tensor Approximation of Function Related Multidimensional Arrays
• Efficient MATLAB Computations with Sparse and Factored Tensors
• Algorithms for Separable Nonlinear Least Squares Problems
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• The Geometry of Algorithms with Orthogonality Constraints
• ARPACK Users' Guide
• A Multilinear Singular Value Decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
• Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Most Tensor Problems Are NP-Hard
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• On search directions for minimization algorithms
• Spectral partitioning of large and sparse 3‐tensors using low‐rank tensor approximation
• Tensors in computations