Cover Image

On a randomized small-block Lanczos method for large-scale null space computations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kressner, Daniel, Shao, Nian
Format:	Preprint
Published:	2024
Subjects:	Numerical Analysis 65F15, 65F50, 68W20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Accelerating a restarted Krylov method for matrix functions with randomization
by: Guidotti, Nicolas L., et al.
Published: (2025)

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

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

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

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

Sketched and truncated polynomial Krylov methods: Evaluation of matrix functions
by: Palitta, Davide, et al.
Published: (2023)

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

On finite precision block Lanczos computations
by: Šimonová, Dorota, et al.
Published: (2025)

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

Sketched and Truncated Polynomial Krylov Subspace Methods: Matrix Sylvester Equations
by: Palitta, Davide, et al.
Published: (2023)

A structural bound for cluster robustness of randomized small-block Lanczos
by: Shao, Nian
Published: (2025)

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

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

Numerical Instabilities in the Kaczmarz Method and Stabilization by Iterative Refinement
by: Dereziński, Michał, et al.
Published: (2026)

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

A mixed precision LOBPCG algorithm
by: Kressner, Daniel, et al.
Published: (2023)

Lanczos with compression for symmetric eigenvalue problems
by: Casulli, Angelo A., et al.
Published: (2026)

Randomized Nyström approximation of non-negative self-adjoint operators
by: Persson, David, et al.
Published: (2024)

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

Lanczos with compression for symmetric matrix Lyapunov equations
by: Casulli, Angelo A., et al.
Published: (2025)

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

The Detection and Correction of Silent Errors in Pipelined Krylov Subspace Methods
by: Carson, Erin Claire, et al.
Published: (2024)

Sharp analysis of sketched least squares and randomized low-rank approximation
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)

A general framework for Krylov ODE residuals with applications to randomized Krylov methods
by: Krieger, Emil, et al.
Published: (2025)

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

Relaxed Greedy Randomized Kaczmarz with Signal Averaging for Solving Doubly-Noisy Linear Systems
by: Zhang, Lu, et al.
Published: (2026)

Stochastic Rounding Implicitly Regularizes Tall-and-Thin Matrices
by: Dexter, Gregory, et al.
Published: (2024)

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

On a shrink-and-expand technique for symmetric block eigensolvers
by: Liu, Yuqi, et al.
Published: (2024)

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

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

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

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

Make the most of what you have: Resource-efficient randomized algorithms for matrix computations
by: Epperly, Ethan N.
Published: (2025)

Hybrid hierarchical matrices with adaptive mixed precision storage
by: Khan, Ritesh, et al.
Published: (2026)

Anderson acceleration with approximate calculations: applications to scientific computing
by: Pasini, Massimiliano Lupo, et al.
Published: (2022)

Scalable Multilevel Monte Carlo Methods Exploiting Parallel Redistribution on Coarse Levels
by: Fairbanks, Hillary R., et al.
Published: (2024)

Nearly Optimal Approximation of Matrix Functions by the Lanczos Method
by: Amsel, Noah, et al.
Published: (2023)

Variants of thick-restart Lanczos for the Bethe-Salpeter eigenvalue problem
by: Alvarruiz, Fernando, et al.
Published: (2025)