Image de couverture de livre

Structured Sketching for Linear Systems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Brust, Johannes J, Saunders, Michael A
Format:	Preprint
Publié:	2024
Sujets:	Numerical Analysis Mathematical Software Computation 15A06, 15B52, 65F10, 68W20, 65Y20, 90C20
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations
par: Lok, Jackie, et autres
Publié: (2025)

Parallelization Strategies for the Randomized Kaczmarz Algorithm on Large-Scale Dense Systems
par: Ferreira, Inês, et autres
Publié: (2024)

Survey of a Class of Iterative Row-Action Methods: The Kaczmarz Method
par: Ferreira, Inês A., et autres
Publié: (2024)

A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear Systems
par: Bergou, El Houcine, et autres
Publié: (2023)

Linear-Scaling Tensor Train Sketching
par: Cazeaux, Paul, et autres
Publié: (2026)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
par: Matti, Fabio, et autres
Publié: (2025)

Where Have All the Kaczmarz Iterates Gone?
par: Bergou, El Houcine, et autres
Publié: (2025)

Fast and Accurate SVD-Type Updating in Streaming Data
par: Brust, Johannes J., et autres
Publié: (2025)

Randomized Flexible LSQR and LSMR with applications to inverse problems
par: Bucci, Alberto, et autres
Publié: (2026)

Relaxed Greedy Randomized Kaczmarz with Signal Averaging for Solving Doubly-Noisy Linear Systems
par: Zhang, Lu, et autres
Publié: (2026)

Fast, High-Accuracy, Randomized Nullspace Computations for Tall Matrices
par: Epperly, Ethan N., et autres
Publié: (2026)

Adaptive finite element methods with optimally preconditioned GMRES guarantee optimal complexity
par: Führer, Thomas, et autres
Publié: (2026)

Efficient Sketching-Based Summation of Tucker Tensors
par: Smith, Rudi, et autres
Publié: (2026)

Fast and Accurate Interpolative Decompositions for General, Sparse, and Structured Tensors
par: Zhang, Yifan, et autres
Publié: (2025)

On a randomized small-block Lanczos method for large-scale null space computations
par: Kressner, Daniel, et autres
Publié: (2024)

Analysis of an Idealized Stochastic Polyak Method and its Application to Black-Box Model Distillation
par: Gower, Robert M., et autres
Publié: (2025)

Fast Rank Adaptive CUR via a Recycled Small Sketch
par: Pritchard, Nathaniel, et autres
Publié: (2025)

Improving Sketching Algorithms for Low-Rank Matrix Approximation via Sketch-Power Iterations
par: Chang, Chao, et autres
Publié: (2026)

Acceleration and restart for the randomized Bregman-Kaczmarz method
par: Tondji, Lionel, et autres
Publié: (2023)

A randomized algorithm for simultaneously diagonalizing symmetric matrices by congruence
par: He, Haoze, et autres
Publié: (2024)

Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models
par: Chen, Guan-Yu, et autres
Publié: (2025)

OBK-RCM: Accelerated Orthogonal Block Kaczmarz Algorithm via RCM Reordering and Dynamic Grouping for Sparse Linear Systems
par: Liang, Yu-Fang, et autres
Publié: (2024)

MoMo: Momentum Models for Adaptive Learning Rates
par: Schaipp, Fabian, et autres
Publié: (2023)

FlexTrace: Exchangeable Randomized Trace Estimation for Matrix Functions
par: Madhavan, Madhusudan, et autres
Publié: (2026)

Sharp error bounds for approximate eigenvalues and singular values from subspace methods
par: Haas, Irina-Beatrice, et autres
Publié: (2025)

Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations
par: Dong, Yijun, et autres
Publié: (2022)

Matrix perturbation analysis of methods for extracting singular values from approximate singular subspaces
par: Lazzarino, Lorenzo, et autres
Publié: (2024)

Randomized algorithms for streaming low-rank approximation in tree tensor network format
par: Bucci, Alberto, et autres
Publié: (2024)

A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
par: Bucci, Alberto, et autres
Publié: (2024)

Matrix-free stochastic calculation of operator norms without using adjoints
par: Bresch, Jonas, et autres
Publié: (2024)

Low-rank approximation of parameter-dependent matrices via CUR decomposition
par: Park, Taejun, et autres
Publié: (2024)

Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding
par: He, Haoze, et autres
Publié: (2024)

Cutting Some Slack for SGD with Adaptive Polyak Stepsizes
par: Gower, Robert M., et autres
Publié: (2022)

Stochastic Trace Optimization of Parameter Dependent Matrices Based on Statistical Learning Theory
par: Saibaba, Arvind K., et autres
Publié: (2025)

Randomized algorithms for computing the tensor train approximation and their applications
par: Che, Maolin, et autres
Publié: (2024)

Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts
par: Che, Maolin, et autres
Publié: (2025)

The Pseudoinverse of $A=CR$ is $A^+=R^+C^+$ (?)
par: Karpowicz, Michał P., et autres
Publié: (2023)

High-performance matrix-free unfitted finite element operator evaluation
par: Bergbauer, Maximilian, et autres
Publié: (2024)

Matrix-Free Evaluation of High-Order Shifted Boundary Finite Element Operators
par: Wichrowski, Michał
Publié: (2025)

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization
par: Tondji, Lionel, et autres
Publié: (2025)