Efficient Krylov subspace methods for uncertainty quantification in large Bayesian linear inverse problems
From MaRDI portal
Recommendations
- Fast algorithms for Bayesian uncertainty quantification in large-scale linear inverse problems based on low-rank partial Hessian approximations
- Efficient generalized Golub-Kahan based methods for dynamic inverse problems
- Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems
- Efficient iterative methods for hyperparameter estimation in large-scale linear inverse problems
- A stochastic collocation approach to Bayesian inference in inverse problems
Cited in
(6)- Weighted tensor Golub-Kahan-Tikhonov-type methods applied to image processing using a t-product
- A computational framework for edge-preserving regularization in dynamic inverse problems
- Efficient iterative methods for hyperparameter estimation in large-scale linear inverse problems
- Projected Newton method for large-scale Bayesian linear inverse problems
- Distributed Tikhonov regularization for ill-posed inverse problems from a Bayesian perspective
- Efficient sampling approaches based on generalized Golub-Kahan methods for large-scale hierarchical Bayesian inverse problems
This page was built for publication: Efficient Krylov subspace methods for uncertainty quantification in large Bayesian linear inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140450)
