Kronecker Approximations of Covariance Matrices for Solving Inverse Problems
From MaRDI portal
Cites work
- Computational methods for large-scale inverse problems: a survey on hybrid projection methods
- Efficient Krylov subspace methods for uncertainty quantification in large Bayesian linear inverse problems
- Estimating structured correlation matrices in smooth Gaussian random field models.
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems
- Inner Product Free Krylov Methods for Large-Scale Inverse Problems
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- Iterative Methods for Sparse Linear Systems
- Kronecker product and SVD approximations in image restoration
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Matrix Computations
- Modern regularization methods for inverse problems
- Optimal Kronecker product approximation of block Toeplitz matrices
- Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications
- Randomized and inner-product free Krylov methods for large-scale inverse problems
- Randomized block Krylov methods for approximating extreme eigenvalues
- Randomized Krylov methods for inverse problems
- Randomized Numerical Linear Algebra: Foundations & Algorithms
- Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations
- Structured Matrix Approximations via Tensor Decompositions
This page was built for publication: Kronecker Approximations of Covariance Matrices for Solving Inverse Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7452407)