Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

416
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
416
Parallel Processing01:20

Parallel Processing

928
The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
928
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

929
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
929
Multimachine Stability01:25

Multimachine Stability

633
Multimachine stability analysis is crucial for understanding the dynamics and stability of power systems with multiple synchronous machines. The objective is to solve the swing equations for a network of M machines connected to an N-bus power system.
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
633
Area Computation by the Alternative Coordinate Method01:24

Area Computation by the Alternative Coordinate Method

832
The alternative coordinate method, also known as the Shoelace Formula, is a technique for determining the area of a traverse using Cartesian coordinates. This method relies on the sequential arrangement of x and y coordinates for each point of the shape, ensuring accuracy and ease of application.In this approach, each corner's x and y coordinates are listed as fractions, with the x-coordinate as the numerator and the y-coordinate as the denominator. These coordinates are arranged sequentially...
832
Optimization Problems01:26

Optimization Problems

199
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
199

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Bayesian Statistical Inference in Ion-Channel Models with Exact Missed Event Correction.

Biophysical journal·2016
Same author

Science hackathons for developing interdisciplinary research and collaborations.

eLife·2015
Same author

Ten simple rules for a successful cross-disciplinary collaboration.

PLoS computational biology·2015
Same author

Hamiltonian Monte Carlo methods for efficient parameter estimation in steady state dynamical systems.

BMC bioinformatics·2014
Same author

Ten simple rules for effective computational research.

PLoS computational biology·2014
Same author

Bayesian approaches for mechanistic ion channel modeling.

Methods in molecular biology (Clifton, N.J.)·2013
Same journal

The TaMYB55-TaSnRK1α1-TabZIP9 module confers heat stress tolerance in wheat.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Superstatistics approach to turbulent circulation fluctuations.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

A molecular timescale for evolution of cobamide biosynthesis.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Pierre Chambon, a pioneer of molecular biology and gene regulation in eukaryotes.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Granulosa cell glycogen fuels the avascular corpus luteum.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Synthetic essentiality of TRAIL/TNFSF10 in VHL-deficient renal cell carcinoma.

Proceedings of the National Academy of Sciences of the United States of America·2026
See all related articles

Related Experiment Video

Updated: Apr 20, 2026

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

8.9K

A general construction for parallelizing Metropolis-Hastings algorithms.

Ben Calderhead1

  • 1Department of Mathematics, Imperial College London, London SW7 2AZ, United Kingdom b.calderhead@imperial.ac.uk.

Proceedings of the National Academy of Sciences of the United States of America
|November 26, 2014
PubMed
Summary
This summary is machine-generated.

This study introduces a parallelized Markov chain Monte Carlo (MCMC) method, enhancing computational speed and statistical efficiency for complex problems. The new approach generalizes existing algorithms, improving accuracy and robustness.

Keywords:
Bayesian inferenceHamiltonian dynamicsMarkov chain Monte Carloparallel computation

More Related Videos

Author Spotlight: Enhancing Cryo-Electron Microscopy by Automated Data Collection and Analysis Techniques
07:52

Author Spotlight: Enhancing Cryo-Electron Microscopy by Automated Data Collection and Analysis Techniques

Published on: December 1, 2023

1.7K
ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

12.1K

Related Experiment Videos

Last Updated: Apr 20, 2026

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

8.9K
Author Spotlight: Enhancing Cryo-Electron Microscopy by Automated Data Collection and Analysis Techniques
07:52

Author Spotlight: Enhancing Cryo-Electron Microscopy by Automated Data Collection and Analysis Techniques

Published on: December 1, 2023

1.7K
ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

12.1K

Area of Science:

  • Computational Statistics
  • Statistical Algorithms
  • Markov Chain Monte Carlo Methods

Background:

  • Markov chain Monte Carlo (MCMC) methods are crucial for statistical and computational tasks.
  • A key limitation of MCMC is their sequential processing, hindering parallelization.
  • Existing MCMC algorithms often require significant computational resources and time.

Purpose of the Study:

  • To develop a generalized Metropolis-Hastings algorithm for parallelizing single MCMC chains.
  • To enhance the computational speed and statistical efficiency of MCMC methods.
  • To provide a robust and accurate method for Monte Carlo estimation.

Main Methods:

  • Proposed a generalization of the Metropolis-Hastings algorithm for parallel MCMC.
  • Constructed and sampled from a finite-state Markov chain on proposed points.
  • Applied the method to Metropolis-Adjusted Langevin Algorithms and Adaptive MCMC.

Main Results:

  • Demonstrated increased computational speed and statistical efficiency for various MCMC methods.
  • Showcased principled integration of Hamiltonian Monte Carlo steps.
  • Achieved increased accuracy of Monte Carlo estimates with minimal extra cost.

Conclusions:

  • The proposed parallel MCMC approach is generally applicable and easy to implement.
  • This method enhances robustness to algorithmic parameter choices.
  • Significant improvements in computational performance and accuracy for MCMC methods were observed.