Cover Image

A Sherman--Morrison--Woodbury approach to solving least squares problems with low-rank updates

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Güttel, Stefan, Nakatsukasa, Yuji, Webb, Marcus, Riley, Alban Bloor
Format:	Preprint
Published:	2024
Subjects:	Numerical Analysis 65F20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A multilevel sketch-and-solve method for overdetermined least squares problems
by: Haas, Irina-Beatrice, et al.
Published: (2026)

Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers
by: Epperly, Ethan N., et al.
Published: (2024)

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

Instability of the Sherman-Morrison formula and stabilization by iterative refinement
by: Hashemi, Behnam, et al.
Published: (2025)

A Note on the Stability of the Sherman-Morrison-Woodbury Formula
by: Ma, Linkai, et al.
Published: (2025)

SubApSnap: Solving parameter-dependent linear systems with a snapshot and subsampling
by: Jones, Eleanor, et al.
Published: (2025)

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

The double splitting iteration method for solving the large indefinite least squares problem
by: Li, Jun, et al.
Published: (2026)

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

A computational study of low precision incomplete Cholesky factorization preconditioners for sparse linear least-squares problems
by: Scott, Jennifer, et al.
Published: (2025)

NR-SSOR right preconditioned RRGMRES for arbitrary singular systems and least squares problems
by: Sugihara, Kouta, et al.
Published: (2025)

Randomized flexible Krylov methods for $\ell_p$ regularization
by: Landman, Malena Sabaté, et al.
Published: (2025)

Krylov iterative methods for linear least squares problems with linear equality constraints
by: Li, Haibo
Published: (2025)

Fast and forward stable randomized algorithms for linear least-squares problems
by: Epperly, Ethan N.
Published: (2023)

Condition numbers for the Moore-Penrose inverse and the least squares problem involving rank-structured matrices
by: Ahmad, Sk. Safique, et al.
Published: (2023)

Superfast direct inversion of the nonuniform discrete Fourier transform via hierarchically semi-separable least squares
by: Wilber, Heather, et al.
Published: (2024)

GMRES with randomized sketching and deflated restarting
by: Burke, Liam, et al.
Published: (2023)

Approximating Sparse Matrices and their Functions using Matrix-vector products
by: Park, Taejun, et al.
Published: (2023)

Mixed precision iterative refinement for least squares with linear equality constraints and generalized least squares problems
by: Gao, Bowen, et al.
Published: (2024)

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

A sketch-and-select Arnoldi process
by: Güttel, Stefan, et al.
Published: (2023)

Stable algorithms for general linear systems by preconditioning the normal equations
by: Epperly, Ethan N., et al.
Published: (2025)

Finding accurate eigenvalues and eigenvectors of positive semi-definite matrices given a subspace
by: Nakatsukasa, Yuji, et al.
Published: (2026)

Inexact versions of several block-splitting preconditioners for indefinite least squares problems
by: Shaldehi, Mohaddese Kaveh, et al.
Published: (2026)

Randomized sketching of nonlinear eigenvalue problems
by: Güttel, Stefan, et al.
Published: (2022)

A parameterized block-splitting preconditioner for indefinite least squares problem
by: Salkuyeh, Davod Khojasteh
Published: (2025)

Preconditioned normal equations for solving discretised partial differential equations
by: Lazzarino, Lorenzo, et al.
Published: (2025)

Flexible GMRES converges in two phases
by: Güttel, Stefan, et al.
Published: (2026)

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

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

Accuracy and Stability of CUR decompositions with Oversampling
by: Park, Taejun, et al.
Published: (2024)

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

Recursive sparse LU decomposition based on nested dissection and low rank approximations
by: Xuanru, Zhu, et al.
Published: (2024)

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

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

Applications of AAA rational approximation
by: Nakatsukasa, Yuji, 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)

Numerical Stability of the Nyström Method
by: Bucci, Alberto, et al.
Published: (2025)

Two-dimensional greedy randomized Kaczmarz methods for solving large-scale linear systems
by: Li, Tao, et al.
Published: (2025)