A Krylov-Schur-like method for computing the best rank-(r₁,r₂,r₃) approximation of large and sparse tensors
From MaRDI portal
Publication:2084262
Abstract: The paper is concerned with methods for computing the best low multilinear rank approximation of large and sparse tensors. Krylov-type methods have been used for this problem; here block versions are introduced. For the computation of partial eigenvalue and singular value decompositions of matrices the Krylov-Schur (restarted Arnoldi) method is used. We describe a generalization of this method to tensors, for computing the best low multilinear rank approximation of large and sparse tensors. In analogy to the matrix case, the large tensor is only accessed in multiplications between the tensor and blocks of vectors, thus avoiding excessive memory usage. It is proved that, if the starting approximation is good enough, then the tensor Krylov-Schur method is convergent. Numerical examples are given for synthetic tensors and sparse tensors from applications, which demonstrate that for most large problems the Krylov-Schur method converges faster and more robustly than higher order orthogonal iteration.
Recommendations
- Krylov-type methods for tensor computations.I
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
- A Newton-Grassmann method for computing the best multilinear rank-(r₁,r₂,r₃) approximation of a tensor
- The Best rank-\((R_1,R_2,R_3)\) approximation of tensors by means of a geometric Newton method
Cites work
- A Krylov--Schur algorithm for large eigenproblems
- A Multilinear Singular Value Decomposition
- A Newton-Grassmann method for computing the best multilinear rank-(r₁,r₂,r₃) approximation of a tensor
- Algorithm 862
- Algorithms for Separable Nonlinear Least Squares Problems
- ARPACK Users' Guide
- Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
- Block Krylov-Schur method for large symmetric eigenvalue problems
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Decomposition of quantics in sums of powers of linear forms
- Differential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensors
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Euclidean embedding of co-occurrence data
- Handwritten digit classification using higher order singular value decomposition
- scientific article; zbMATH DE number 5161643 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Krylov-type methods for tensor computations.I
- Low rank Tucker-type tensor approximation to classical potentials
- Matrix algorithms. Vol. 2: Eigensystems
- Most tensor problems are NP-hard
- Multigrid accelerated tensor approximation of function related multidimensional arrays
- On search directions for minimization algorithms
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Perturbation theory and optimality conditions for the best multilinear rank approximation of a tensor
- Quasi-Newton methods on Grassmannians and multilinear approximations of tensors
- Rank-one approximation to high order tensors
- Spectral partitioning of large and sparse 3‐tensors using low‐rank tensor approximation
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensors in computations
- The Geometry of Algorithms with Orthogonality Constraints
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
Cited in
(6)- Krylov-type methods for tensor computations.I
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
- Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
- Spectral partitioning of large and sparse 3‐tensors using low‐rank tensor approximation
- Tensor Golub-Kahan method based on Einstein product
- Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
This page was built for publication: A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084262)
