Jump to ContentJump to Main Navigation
Bayesian Theory and Applications$
Users without a subscription are not able to see the full content.

Paul Damien, Petros Dellaportas, Nicholas G. Polson, and David A. Stephens

Print publication date: 2013

Print ISBN-13: 9780199695607

Published to Oxford Scholarship Online: May 2013

DOI: 10.1093/acprof:oso/9780199695607.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 22 August 2019

Inverse problems

Inverse problems

Chapter:
(p.619) 31 Inverse problems
Source:
Bayesian Theory and Applications
Author(s):

Fox Colin

Haario Heikki

Christen J Andrés

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199695607.003.0031

This chapter discusses the features that are characteristic for the problems most typically treated under the umbrella of inverse problems. It begins by listing representative examples of inverse problems followed by a discussion of the key mathematical property of ill-posedness. It then discusses deterministic and regularization methods, and presents some history of Bayesian analysis, as viewed from physics. Next, it provides the framework for current methodology and describes some of the recent advances in Markov chain Monte Carlo (MCMC) algorithms. The chapter concludes with a glimpse of future directions.

Keywords:   inverse problems, Bayesian analysis, Markov chain Monte Carlo algorithms

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .