Preconditioning without a preconditioner using randomized block Krylov subspace methods
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3633705 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 783550 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- A block conjugate gradient method applied to linear systems with multiple right-hand sides
- A deflated conjugate gradient method for multiple right hand sides and multiple shifts
- A fast randomized algorithm for overdetermined linear least-squares regression
- A posteriori error bounds for the block-Lanczos method for matrix function approximation
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
- Algorithm 971
- An adaptive factorized Nyström preconditioner for regularized kernel matrices
- Assessing approximate inference for binary Gaussian process classification.
- Bayesian image restoration, with two applications in spatial statistics (with discussion)
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Block CG algorithms revisited
- Block Gram-Schmidt algorithms and their stability properties
- Efficient and stable Arnoldi restarts for matrix functions based on quadrature
- Enlarged Krylov subspace conjugate gradient methods for reducing communication
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Error Bounds for Lanczos-Based Matrix Function Approximation
- Error bounds in the simple Lanczos procedure for computing functions of symmetric matrices and eigenvalues
- Error norm estimates for the block conjugate gradient algorithms
- Fast CG-Based Methods for Tikhonov--Phillips Regularization
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- Fast estimation of \(\mathrm{tr}(f(A))\) via stochastic Lanczos quadrature
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Fine-grained analysis and faster algorithms for iteratively solving linear systems
- Krylov-Aware Stochastic Trace Estimation
- Low rank approximation and regression in input sparsity time
- MCMC-based image reconstruction with uncertainty quantification
- Methods of conjugate gradients for solving linear systems
- Monotonicity, bounds and acceleration of block Gauss and Gauss-Radau quadrature for computing B^T (A)B
- Near instance optimality of the Lanczos method for Stieltjes and related matrix functions
- On finite precision block Lanczos computations
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- On the construction of deflation-based preconditioners
- On the likelihood that one unkrown probability exeeds another in view of the evidence of two samples.
- On the unreasonable effectiveness of single vector Krylov methods for low-rank approximation
- Polynomial preconditioning for the action of the matrix square root and inverse square root
- Preconditioned Krylov subspace methods for sampling multivariate Gaussian distributions
- Randomized Kaczmarz methods with beyond-Krylov convergence
- Randomized Nyström Preconditioning
- Randomized block Gram-Schmidt process for the solution of linear systems and eigenvalue problems
- Randomized numerical linear algebra: Foundations and algorithms
- Scalable linear solvers based on enlarged Krylov subspaces with dynamic reduction of search directions
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
- Sharp Estimates for Complete Elliptic Integrals
- Single-pass Nyström approximation in mixed precision
- Spectral deflation in Krylov solvers: a theory of coordinate space based methods
- Stability of the Lanczos method for matrix function approximation
- The Lanczos Algorithm With Partial Reorthogonalization
- The Lanczos Algorithm with Selective Orthogonalization
- The Lanczos and Conjugate Gradient Algorithms
- The block conjugate gradient algorithm and related methods
- The block preconditioned conjugate gradient method on vector computers
- Tikhonov regularization of large symmetric problems
- XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation
This page was built for publication: Preconditioning without a preconditioner using randomized block Krylov subspace methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7240692)
