Krylov-type methods for tensor computations.I
From MaRDI portal
Abstract: Several Krylov-type procedures are introduced that generalize matrix Krylov methods for tensor computations. They are denoted minimal Krylov recursion, maximal Krylov recursion, contracted tensor product Krylov recursion. It is proved that the for a given tensor with low rank, the minimal Krylov recursion extracts the correct subspaces associated to the tensor within certain number of iterations. An optimized minimal Krylov procedure is described that gives a better tensor approximation for a given multilinear rank than the standard minimal recursion. The maximal Krylov recursion naturally admits a Krylov factorization of the tensor. The tensor Krylov methods are intended for the computation of low-rank approximations of large and sparse tensors, but they are also useful for certain dense and structured tensors for computing their higher order singular value decompositions or obtaining starting points for the best low-rank computations of tensors. A set of numerical experiments, using real life and synthetic data sets, illustrate some of the properties of the tensor Krylov methods.
Recommendations
- A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
- Krylov subspace methods for linear systems with tensor product structure
- Tensor Krylov subspace methods via the Einstein product with applications to image and video processing
- Deflated and restarted Krylov subspace methods for Sylvester tensor equations
Cites work
- scientific article; zbMATH DE number 1820149 (Why is no real title available?)
- scientific article; zbMATH DE number 5161643 (Why is no real title available?)
- scientific article; zbMATH DE number 3194988 (Why is no real title available?)
- A Krylov--Schur algorithm for large eigenproblems
- A Multilinear Singular Value Decomposition
- A Newton-Grassmann method for computing the best multilinear rank-\((r_1,r_2,r_3)\) approximation of a tensor
- ARPACK Users' Guide
- Algorithm 862
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Handwritten digit classification using higher order singular value decomposition
- Matrix algorithms. Vol. 2: Eigensystems
- Multigrid accelerated tensor approximation of function related multidimensional arrays
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Principal component analysis of three-mode data by means of alternating least squares algorithms
- Quasi-Newton methods on Grassmannians and multilinear approximations of tensors
- Rank-one approximation to high order tensors
- Taking a new look at the latent semantic analysis approach to information retrieval
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- 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
(22)- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- On computing the minimum singular value of a tensor sum
- Solving sparse non-negative tensor equations: algorithms and applications
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
- Tensor Arnoldi-Tikhonov and GMRES-type methods for ill-posed problems with a t-product structure
- Interval tensors and their application in solving multi-linear systems of equations
- Paige's algorithm for solving a class of tensor least squares problem
- Solution of linear systems in high spatial dimensions
- A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors
- A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors
- A literature survey of low-rank tensor approximation techniques
- Q-less QR decomposition in inner product spaces
- Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product
- Randomized algorithms for the low multilinear rank approximations of tensors
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Numerical tensor calculus
- Tensor neural network models for tensor singular value decompositions
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations
- Krylov Subspace Approach to Core Problems within Multilinear Approximation Problems: A Unifying Framework
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- A Lanczos-type procedure for tensors
This page was built for publication: Krylov-type methods for tensor computations.I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1931774)
