Krylov-type methods for tensor computations.I

DOI10.1016/J.LAA.2011.12.007zbMath1258.65032arXiv1005.0683OpenAlexW2049878767MaRDI QIDQ1931774

Berkant Savas, Lars Eldén

Publication date: 16 January 2013

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

tensornumerical experimentsmultilinear algebrasingular value decompositionstensor approximationTucker modelinformation scienceKrylov-type methodmultilinear ranksparse tensor

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Vector and tensor algebra, theory of invariants (15A72) Iterative numerical methods for linear systems (65F10)

Related Items (16)

Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ Solution of linear systems in high spatial dimensions ⋮ Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations ⋮ Paige's algorithm for solving a class of tensor least squares problem ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ Randomized algorithms for the low multilinear rank approximations of tensors ⋮ Interval tensors and their application in solving multi-linear systems of equations ⋮ Numerical tensor calculus ⋮ Tensor neural network models for tensor singular value decompositions ⋮ Tensor Arnoldi-Tikhonov and GMRES-type methods for ill-posed problems with a t-product structure ⋮ 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 ⋮ Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching ⋮ Solving sparse non-negative tensor equations: algorithms and applications

Uses Software

• TensorToolbox
• ARPACK
• Algorithm 862

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Handwritten digit classification using higher order singular value decomposition
• Principal component analysis of three-mode data by means of alternating least squares algorithms
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• 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
• 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
• 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
• Calculating the Singular Values and Pseudo-Inverse of a Matrix

This page was built for publication: Krylov-type methods for tensor computations.I