Randomized and inner-product free Krylov methods for large-scale inverse problems
From MaRDI portal
Cites work
- A new look at CMRH and its relation to GMRES
- Are sketch-and-precondition least squares solvers numerically stable?
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Computational Methods for Inverse Problems
- Discrete inverse problems. Insight and algorithms.
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- Faster least squares approximation
- H-CMRH: an inner product free hybrid Krylov method for large-scale inverse problems
- scientific article; zbMATH DE number 3181418 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Introduction to Bayesian Scientific Computing
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- Large-Scale Inverse Problems in Imaging
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems
- Randomized Gram-Schmidt process with application to GMRES
- Randomized numerical linear algebra: Foundations and algorithms
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
Cited in
(1)
This page was built for publication: Randomized and inner-product free Krylov methods for large-scale inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891557)
