Complexity analysis of accelerated MCMC methods for Bayesian inversion
The Bayesian approach to inverse problems, in which the posterior probability distribution on an unknown field is sampled for the purposes of computing posterior expectations of quantities of interest, is starting to become computationally feasible for partial differential equation (PDE) inverse pr...
Saved in:
Main Authors: | Hoang, Viet Ha., Schwab, Christoph., Stuart, Andrew M. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/101372 http://hdl.handle.net/10220/18708 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On the complexity of information spreading in dynamic networks
by: Dutta, Chinmoy, et al.
Published: (2015) -
Pareto stable matchings : an empirical study
by: Le, Truc Viet
Published: (2013) -
Efficient implementations of the BP heuristic for the shortest linear program (SLP) problem
by: Liu, Shuqing
Published: (2021) -
Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure
by: Yen, Sung-Ming, et al.
Published: (2014) -
Enforcing efficient equilibria in network design games via subsidies
by: Augustine, John, et al.
Published: (2013)