An efficient algorithm for computing the approximate t-URV and its applications
From MaRDI portal
Publication:2162323
DOI10.1007/s10915-022-01956-yzbMath1498.65062OpenAlexW4288441230MaRDI QIDQ2162323
Publication date: 5 August 2022
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-022-01956-y
deterministic errortensor-tensor productapproximate t-URVcompressed randomized t-URVprobabilistic errort-URV
Related Items
An efficient randomized QLP algorithm for approximating the singular value decomposition, The Moore-Penrose inverse of tensors via the M-product, Random Double Tensors Integrals, Nonsymmetric Algebraic Riccati Equations under the Tensor Product, A fixed point iterative method for third-order tensor linear complementarity problems, Dual core generalized inverse of third-order dual tensor based on the T-product
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Factorization strategies for third-order tensors
- Randomized interpolative decomposition of separated representations
- Tensor-tensor products with invertible linear transforms
- A fast randomized algorithm for the approximation of matrices
- UTV tools: Matlab templates for rank-revealing UTV decompositions
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- Tensor Q-rank: new data dependent definition of tensor rank
- Generalized tensor function via the tensor singular value decomposition based on the T-product
- Randomized algorithms for the low multilinear rank approximations of tensors
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Exact matrix completion via convex optimization
- T-Jordan canonical form and T-Drazin inverse based on the T-product
- A literature survey of low-rank tensor approximation techniques
- Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform
- Facial Recognition Using Tensor-Tensor Decompositions
- Computational Advertising: Techniques for Targeting Relevant Ads
- Optimal CUR Matrix Decompositions
- Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
- Robust principal component analysis?
- Hierarchical Singular Value Decomposition of Tensors
- Randomized Algorithms for Matrices and Data
- Low-Rank Approximation and Regression in Input Sparsity Time
- Robust tensor completion using transformed tensor singular value decomposition
- Relative-Error $CUR$ Matrix Decompositions
- The QLP Approximation to the Singular Value Decomposition
- On Rank-Revealing Factorisations
- A Multilinear Singular Value Decomposition
- A randomized tensor singular value decomposition based on the t‐product
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives
- Exact Tensor Completion Using t-SVD
- Subspace-Orbit Randomized Decomposition for Low-Rank Matrix Approximations
- A Practical Randomized CP Tensor Decomposition
- An Order-$p$ Tensor Factorization with Applications in Imaging
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Low-Rank Tucker Approximation of a Tensor from Streaming Data
- Projection-Based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices
- Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completion
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data
- randUTV
- Subspace Iteration Randomization and Singular Value Problems
- Updating a Rank-Revealing ULV Decomposition
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Recompression of Hadamard Products of Tensors in Tucker Format
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations
