Markov chain Monte Carlo algorithms for optimizing grazing incidence optics for wide-field x-ray survey imaging

Peter W.A. Roming, John C. Liechty, David H. Sohn, Jared R. Shoemaker, David N. Burrows, Gordon P. Garmire

Research output: Contribution to journalConference article

7 Citations (Scopus)

Abstract

The Markov chain Monte Carlo (MCMC) algorithms as a method for optimizing the multi-dimensional coefficient space were investigated. Although MCMC algorithms were traditionally used to explore probability densities that result from a particular model specification, they can be used to create irreducible algorithms for optimizing arbitrary, bounded functions. The irreducible nature of the MCMC algorithm combined with the ability to adapt MCMC algorithms offers a promising framework for optimizing the multi-dimensional complex function.

Original languageEnglish (US)
Pages (from-to)146-153
Number of pages8
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume4496
DOIs
StatePublished - Jan 1 2002
EventX-Ray Optics for Astronomy: Telescopes, Multilayers, Spectrometers, and Missions - San Diego, CA, United States
Duration: Jul 30 2001Jul 30 2001

Fingerprint

Markov Chain Monte Carlo Algorithms
Markov chains
Wide-field
grazing incidence
Markov processes
Optics
Incidence
Imaging
optics
Imaging techniques
X rays
x rays
Model Specification
Complex Functions
Probability Density
specifications
Arbitrary
Specifications
Coefficient
coefficients

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

@article{af260d0b875141ffa332173e5baf2398,
title = "Markov chain Monte Carlo algorithms for optimizing grazing incidence optics for wide-field x-ray survey imaging",
abstract = "The Markov chain Monte Carlo (MCMC) algorithms as a method for optimizing the multi-dimensional coefficient space were investigated. Although MCMC algorithms were traditionally used to explore probability densities that result from a particular model specification, they can be used to create irreducible algorithms for optimizing arbitrary, bounded functions. The irreducible nature of the MCMC algorithm combined with the ability to adapt MCMC algorithms offers a promising framework for optimizing the multi-dimensional complex function.",
author = "Roming, {Peter W.A.} and Liechty, {John C.} and Sohn, {David H.} and Shoemaker, {Jared R.} and Burrows, {David N.} and Garmire, {Gordon P.}",
year = "2002",
month = "1",
day = "1",
doi = "10.1117/12.454361",
language = "English (US)",
volume = "4496",
pages = "146--153",
journal = "Proceedings of SPIE - The International Society for Optical Engineering",
issn = "0277-786X",
publisher = "SPIE",

}

Markov chain Monte Carlo algorithms for optimizing grazing incidence optics for wide-field x-ray survey imaging. / Roming, Peter W.A.; Liechty, John C.; Sohn, David H.; Shoemaker, Jared R.; Burrows, David N.; Garmire, Gordon P.

In: Proceedings of SPIE - The International Society for Optical Engineering, Vol. 4496, 01.01.2002, p. 146-153.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Markov chain Monte Carlo algorithms for optimizing grazing incidence optics for wide-field x-ray survey imaging

AU - Roming, Peter W.A.

AU - Liechty, John C.

AU - Sohn, David H.

AU - Shoemaker, Jared R.

AU - Burrows, David N.

AU - Garmire, Gordon P.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - The Markov chain Monte Carlo (MCMC) algorithms as a method for optimizing the multi-dimensional coefficient space were investigated. Although MCMC algorithms were traditionally used to explore probability densities that result from a particular model specification, they can be used to create irreducible algorithms for optimizing arbitrary, bounded functions. The irreducible nature of the MCMC algorithm combined with the ability to adapt MCMC algorithms offers a promising framework for optimizing the multi-dimensional complex function.

AB - The Markov chain Monte Carlo (MCMC) algorithms as a method for optimizing the multi-dimensional coefficient space were investigated. Although MCMC algorithms were traditionally used to explore probability densities that result from a particular model specification, they can be used to create irreducible algorithms for optimizing arbitrary, bounded functions. The irreducible nature of the MCMC algorithm combined with the ability to adapt MCMC algorithms offers a promising framework for optimizing the multi-dimensional complex function.

UR - http://www.scopus.com/inward/record.url?scp=0036396620&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036396620&partnerID=8YFLogxK

U2 - 10.1117/12.454361

DO - 10.1117/12.454361

M3 - Conference article

AN - SCOPUS:0036396620

VL - 4496

SP - 146

EP - 153

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

ER -