Regularized Computation of Approximate Pseudoinverse of Large Matrices Using Low-Rank Tensor Train Decompositions

DOI10.1137/15M1028479zbMath1338.65108arXiv1506.01959WikidataQ60486483 ScholiaQ60486483MaRDI QIDQ2806190

Namgil Lee, Andrzej Cichocki

Publication date: 17 May 2016

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

regularizationpreconditioningill-posednesscurse of dimensionalitynumerical resultbig dataalternating least squaresMoore-Penrose pseudoinversetensor networksdensity matrix renormalization groupmatrix product stateslow-rank tensor approximationmatrix product operatorstensor train decompositiongeneralized inverse of huge matricessolving of huge system of linear equations

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Preconditioners for iterative methods (65F08)

Related Items (7)

Tensor-based dynamic mode decomposition ⋮ A fast computational algorithm for computing outer pseudo-inverses with numerical experiments ⋮ Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD ⋮ A continuous analogue of the tensor-train decomposition ⋮ Block tensor train decomposition for missing data estimation ⋮ Hybrid tensor decomposition in neural network compression ⋮ Fundamental tensor operations for large-scale data analysis using tensor network formats

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Tensor-Train Decomposition
• The density-matrix renormalization group in the age of matrix product states
• \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
• Fundamental tensor operations for large-scale data analysis using tensor network formats
• Tensor-structured preconditioners and approximate inverse of elliptic operators in \(\mathbb R^{d}\)
• A trace inequality of John von Neumann
• A comparative study of sparse approximate inverse preconditioners
• Superfast Fourier transform using QTT approximation
• A new scheme for the tensor representation
• Generalized approximate inverse preconditioners for least squares problems
• On manifolds of tensors of fixed TT-rank
• Tensor-train ranks for matrices and their inverses
• Optimal regularized low rank inverse approximation
• A literature survey of low-rank tensor approximation techniques
• The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
• An efficient approach for computing optimal low-rank regularized inverse matrices
• Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions
• Low-Rank Tensor Methods with Subspace Correction for Symmetric Eigenvalue Problems
• Hierarchical Singular Value Decomposition of Tensors
• Tensor Spaces and Numerical Tensor Calculus
• Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
• IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
• Parallel Preconditioning with Sparse Approximate Inverses
• A Multilinear Singular Value Decomposition
• Numerical operator calculus in higher dimensions
• A trace inequality for matrix product
• Low-Rank Explicit QTT Representation of the Laplace Operator and Its Inverse
• Solution of Linear Systems and Matrix Inversion in the TT-Format
• TT-GMRES: solution to a linear system in the structured tensor format
• Estimating a Few Extreme Singular Values and Vectors for Large-Scale Matrices in Tensor Train Format
• Preconditioned Low-Rank Methods for High-Dimensional Elliptic PDE Eigenvalue Problems
• Approximation of 1/x by exponential sums in [1, ∞)

This page was built for publication: Regularized Computation of Approximate Pseudoinverse of Large Matrices Using Low-Rank Tensor Train Decompositions