Monte Carlo strategies in scientific computing (Q5940705)

From MaRDI portal
scientific article; zbMATH DE number 1634768
Language Label Description Also known as
English
Monte Carlo strategies in scientific computing
scientific article; zbMATH DE number 1634768

    Statements

    Monte Carlo strategies in scientific computing (English)
    0 references
    0 references
    20 August 2001
    0 references
    This recent addition to the Monte Carlo literature is divided into 13 chapters and an Appendix. It provides both the methodology and the underlying theory for applying Monte Carlo techniques to a broad range of problems. After a short discussion (Chapters 1 and 2) covering basic Monte Carlo techniques (including the exact sampling method for chain-structured models), the author moves (Chapters 3 and 4) to more advanced subjects as sequential Monte Carlo and its use in different applied fields as molecular simulation, population genetics, computational biology, Bayesian missing data problems, and signal processing problems. In the next chapters the author focuses his attention on Markov chain based dynamic Monte Carlo strategies: the Metropolis algorithm (Chapter 5), the Gibbs sampler (Chapter 6), cluster algorithms for the Ising model (Chapter 7), conditional sampling (Chapter 8), molecular dynamics and the method of hybrid Monte Carlo (Chapter 9), efficient Monte Carlo sampling (Chapters 10 and 11), Markov chains and their convergence (Chapter 12). At the end of the book (Chapter 13) the author discusses some theoretical topics related to MCMC. In the Appendix the author outlines the basics in probability theory and statistical inference procedures. As indicated by the author, this book is intended to serve three audiences: researchers specializing in the study of Monte Carlo algorithms, scientists who are interested in using advanced Monte Carlo techniques, and graduate students in statistics, computational biology, and computer sciences who want to learn about Monte Carlo computations. Overall, this book is a valuable and recommended reference to Monte Carlo methods; particularly it draws the attention to recent work in sequential Monte Carlo.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    textbook
    0 references
    Monte Carlo
    0 references
    sequential Monte Carlo
    0 references
    Metropolis algorithm
    0 references
    Gibbs sampler
    0 references
    Ising model
    0 references
    Markov Monte Carlo
    0 references
    exact sampling method
    0 references
    chain-structured models
    0 references
    molecular simulation
    0 references
    population genetics
    0 references
    computational biology
    0 references
    Bayesian missing data problems
    0 references
    signal processing
    0 references
    cluster algorithms
    0 references
    molecular dynamics
    0 references
    Markov chains
    0 references
    convergence
    0 references