:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Zhang, Yifan, Fornace, Mark, Lindsey, Michael
Format:	Preprint
Published:	2025
Subjects:	Numerical Analysis 15A69, 65F55, 68W20
Online Access:	https://arxiv.org/abs/2503.18921
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Randomized algorithms for streaming low-rank approximation in tree tensor network format
by: Bucci, Alberto, et al.
Published: (2024)

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

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

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

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

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

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

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

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

Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number
by: Koiran, Pascal, et al.
Published: (2024)

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

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

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

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

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

Randomized coupled decompositions
by: Begovic, Erna, et al.
Published: (2024)

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

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

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

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

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

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

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

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

Optimal Sensor Placement in Gaussian Processes via Column Subset Selection
by: Chen, Jessie, et al.
Published: (2026)

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

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

Efficient error estimators for Generalized Nyström
by: Lazzarino, Lorenzo, et al.
Published: (2026)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
by: Cai, HanQin, et al.
Published: (2023)

Robust, randomized preconditioning for kernel ridge regression
by: Díaz, Mateo, et al.
Published: (2023)

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

Matrix-free stochastic calculation of operator norms without using adjoints
by: Bresch, Jonas, et al.
Published: (2024)

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

Beyond Low Rank: Fast Low-Rank + Diagonal Decomposition with a Spectral Approach
by: Yeon, Kingsley, et al.
Published: (2025)

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

On a randomized small-block Lanczos method for large-scale null space computations
by: Kressner, Daniel, et al.
Published: (2024)

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

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

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

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