Copertina

Randomized algorithms for streaming low-rank approximation in tree tensor network format

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bucci, Alberto, Verzella, Gianfranco
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Numerical Analysis 15A69, 65F55, 68W20
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
di: Bucci, Alberto, et al.
Pubblicazione: (2024)

Randomized algorithms for computing the tensor train approximation and their applications
di: Che, Maolin, et al.
Pubblicazione: (2024)

A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format
di: Bucci, Alberto, et al.
Pubblicazione: (2023)

Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts
di: Che, Maolin, et al.
Pubblicazione: (2025)

Fast and Accurate Interpolative Decompositions for General, Sparse, and Structured Tensors
di: Zhang, Yifan, et al.
Pubblicazione: (2025)

Low-rank approximation of parameter-dependent matrices via CUR decomposition
di: Park, Taejun, et al.
Pubblicazione: (2024)

Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
di: Persson, David, et al.
Pubblicazione: (2025)

Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation
di: Cortinovis, Alice, et al.
Pubblicazione: (2024)

Sharp analysis of sketched least squares and randomized low-rank approximation
di: Epperly, Ethan N., et al.
Pubblicazione: (2026)

Linear-Scaling Tensor Train Sketching
di: Cazeaux, Paul, et al.
Pubblicazione: (2026)

HOSCF: Efficient decoupling algorithms for finding the best rank-one approximation of higher-order tensors
di: Xiao, Chuanfu, et al.
Pubblicazione: (2024)

Randomized Flexible LSQR and LSMR with applications to inverse problems
di: Bucci, Alberto, et al.
Pubblicazione: (2026)

Efficient Sketching-Based Summation of Tucker Tensors
di: Smith, Rudi, et al.
Pubblicazione: (2026)

Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding
di: He, Haoze, et al.
Pubblicazione: (2024)

Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations
di: Lok, Jackie, et al.
Pubblicazione: (2025)

Randomized sketched TT-GMRES for linear systems with tensor structure
di: Bucci, Alberto, et al.
Pubblicazione: (2024)

Randomized coupled decompositions
di: Begovic, Erna, et al.
Pubblicazione: (2024)

Row-aware Randomized SVD with applications
di: Palitta, Davide, et al.
Pubblicazione: (2024)

Fast Rank Adaptive CUR via a Recycled Small Sketch
di: Pritchard, Nathaniel, et al.
Pubblicazione: (2025)

Randomized Large-Scale Quaternion Matrix Approximation: Practical Rangefinders and One-Pass Algorithm
di: Chang, Chao, et al.
Pubblicazione: (2024)

Algorithm-agnostic low-rank approximation of operator monotone matrix functions
di: Persson, David, et al.
Pubblicazione: (2023)

Randomized methods for dynamical low-rank approximation
di: Carrel, Benjamin
Pubblicazione: (2024)

Fast randomized numerical rank estimation for numerically low-rank matrices
di: Meier, Maike, et al.
Pubblicazione: (2021)

The Pseudoinverse of $A=CR$ is $A^+=R^+C^+$ (?)
di: Karpowicz, Michał P., et al.
Pubblicazione: (2023)

Randomized low-rank Runge-Kutta methods
di: Lam, Hei Yin, et al.
Pubblicazione: (2024)

Improving Sketching Algorithms for Low-Rank Matrix Approximation via Sketch-Power Iterations
di: Chang, Chao, et al.
Pubblicazione: (2026)

A chiseling algorithm for low-rank Grassmann decomposition of skew-symmetric tensors
di: Vannieuwenhoven, Nick
Pubblicazione: (2024)

Quasi-optimal hierarchically semi-separable matrix approximation
di: Amsel, Noah, et al.
Pubblicazione: (2025)

A randomized algorithm for simultaneously diagonalizing symmetric matrices by congruence
di: He, Haoze, et al.
Pubblicazione: (2024)

Fast, High-Accuracy, Randomized Nullspace Computations for Tall Matrices
di: Epperly, Ethan N., et al.
Pubblicazione: (2026)

Parallelization Strategies for the Randomized Kaczmarz Algorithm on Large-Scale Dense Systems
di: Ferreira, Inês, et al.
Pubblicazione: (2024)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
di: Matti, Fabio, et al.
Pubblicazione: (2025)

Sharp error bounds for approximate eigenvalues and singular values from subspace methods
di: Haas, Irina-Beatrice, et al.
Pubblicazione: (2025)

Matrix perturbation analysis of methods for extracting singular values from approximate singular subspaces
di: Lazzarino, Lorenzo, et al.
Pubblicazione: (2024)

Inexact subspace projection methods for low-rank tensor eigenvalue problems
di: Dektor, Alec, et al.
Pubblicazione: (2025)

Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations
di: Dong, Yijun, et al.
Pubblicazione: (2022)

Survey of a Class of Iterative Row-Action Methods: The Kaczmarz Method
di: Ferreira, Inês A., et al.
Pubblicazione: (2024)

Trace maximization algorithm for the approximate tensor diagonalization
di: Begovic, Erna, et al.
Pubblicazione: (2021)

Tensor Deli: Tensor Completion for Low CP-Rank Tensors via Random Sampling
di: Haselby, Cullen, et al.
Pubblicazione: (2024)

Goal-Oriented Low-Rank Tensor Decompositions for Numerical Simulation Data
di: Dunlavy, Daniel M., et al.
Pubblicazione: (2025)