An efficient algorithm for computing the approximate t-URV and its applications (Q2162323)

scientific article

Language	Label	Description	Also known as
English	An efficient algorithm for computing the approximate t-URV and its applications	scientific article

Statements

instance of

scholarly article

0 references

title

An efficient algorithm for computing the approximate t-URV and its applications (English)

0 references

0 references

0 references

Journal of Scientific Computing

0 references

publication date

5 August 2022

0 references

zbMATH Keywords

tensor-tensor product

0 references

t-URV

0 references

approximate t-URV

0 references

compressed randomized t-URV

0 references

deterministic error

0 references

probabilistic error

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10915-022-01956-y

0 references

cites work

The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors

0 references

A Practical Randomized CP Tensor Decomposition

0 references

Randomized interpolative decomposition of separated representations

0 references

Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform

0 references

Optimal CUR Matrix Decompositions

0 references

Robust principal component analysis?

0 references

Exact matrix completion via convex optimization

0 references

Analysis of individual differences in multidimensional scaling via an $n$-way generalization of ``Eckart-Young'' decomposition

0 references

On Rank-Revealing Factorisations

0 references

Randomized algorithms for the approximations of Tucker and the tensor train decompositions

0 references

The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection

0 references

Randomized algorithms for the low multilinear rank approximations of tensors

0 references

Randomized algorithms for the computation of multilinear rank-$(\mu_1,\mu_2,\mu_3)$ approximations

0 references

Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions

0 references

Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives

0 references

Low-Rank Approximation and Regression in Input Sparsity Time

0 references

A Multilinear Singular Value Decomposition

0 references

Relative-Error $CUR$ Matrix Decompositions

0 references

UTV tools: Matlab templates for rank-revealing UTV decompositions

0 references

Q4917542

0 references

A literature survey of low-rank tensor approximation techniques

0 references

Hierarchical Singular Value Decomposition of Tensors

0 references

Subspace Iteration Randomization and Singular Value Problems

0 references

Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions

0 references

Facial Recognition Using Tensor-Tensor Decompositions

0 references

Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completion

0 references

Subspace-Orbit Randomized Decomposition for Low-Rank Matrix Approximations

0 references

Projection-Based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices

0 references

Tensor-tensor products with invertible linear transforms

0 references

Factorization strategies for third-order tensors

0 references

Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging

0 references

Tensor Decompositions and Applications

0 references

Tensor Q-rank: new data dependent definition of tensor rank

0 references

Recompression of Hadamard Products of Tensors in Tucker Format

0 references

Randomized Algorithms for Matrices and Data

0 references

Fast randomized matrix and tensor interpolative decomposition using countsketch

0 references

An Order-$p$ Tensor Factorization with Applications in Imaging

0 references

randUTV

0 references

Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression

0 references

Generalized tensor function via the tensor singular value decomposition based on the T-product

0 references

T-Jordan canonical form and T-Drazin inverse based on the T-product

0 references

Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format

0 references

Tensor-Train Decomposition

0 references

Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography

0 references

Robust tensor completion using transformed tensor singular value decomposition

0 references

Updating a Rank-Revealing ULV Decomposition

0 references

The QLP Approximation to the Singular Value Decomposition

0 references

Low-Rank Tucker Approximation of a Tensor from Streaming Data

0 references

Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data

0 references

Q2933911

0 references

Computational Advertising: Techniques for Targeting Relevant Ads

0 references

A fast randomized algorithm for the approximation of matrices

0 references

A randomized tensor singular value decomposition based on the t‐product

0 references

Exact Tensor Completion Using t-SVD

0 references

Identifiers

zbMATH Open document ID

1498.65062

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S10915-022-01956-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2162323