Search arXivSearch

arXiv · 2604.01121

A comparison of Markov Chain Monte Carlo algorithms for Bayesian inference of constitutive models

Abstract

Employing Bayesian inference to calibrate constitutive model parameters has grown substantially in recent years. Among the available techniques, Markov Chain Monte Carlo (MCMC) sampling remains one of the most widely used approaches for estimating the posterior distribution. Nevertheless, the selection of a specific MCMC algorithm is often driven by practical considerations, such as software availability or prior user experience. To support sampler selection, we present a comparison of three prominent samplers in the context of two distinct physical systems: a thermal conduction system and a viscous flow system. Calibration data are obtained through tailor-made experimental setups. We use the Kullback-Leibler (KL) divergence, which quantifies the statistical distance between the sampled posterior and the reference ('true') posterior, as a measure of convergence to compare the performance of the following MCMC sampling methods: the Metropolis-Hastings (MH) sampler, the Affine Invariant Stretch Move (AISM) sampler, and the No-U-Turn Sampler (NUTS). We study how this metric correlates to heuristic indicators such as the Gelman-Rubin diagnostic and the effective sample size. In addition, we assess the samplers' computational effort in terms of required number of model evaluations. Based on the results, we find that the heuristic convergence and performance indicators provide a good qualitative measure for KL-divergence for both systems. Regarding computational effort, the NUTS is net beneficial for the viscous flow system, as the high effective sample size outweighs the additional effort required for gradient-based proposal generation. For the thermal conduction system, which involves more expensive model evaluations, the NUTS is not advantageous. Thus, the computational efficiency of gradient evaluations is an important argument in sampler selection.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aricia Rinkens, Rodrigo L. S. Silva, Erik Quaeghebeur, Nick Jaensson, Clemens Verhoosel. 2026-04-01. A comparison of Markov Chain Monte Carlo algorithms for Bayesian inference of constitutive models. https://arxiv.org/abs/2604.01121

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Synthetic Human Mobility Data Generation: A Structured Review of Representations, Methods, and Practical Capabilities

Human mobility data has become an increasingly important component of urban analytics. Although the range of available mobility data sources has expanded substantially, access remains highly constrained by commercial restrictions, privacy concerns, and institutional barriers. Data protection procedures also often reduce the analytical value of released datasets. Synthetic mobility data has emerged as a promising solution, but existing methods differ substantially in their underlying mechanisms, the information they preserve, the outputs they generate, and the analytical questions they can support. Their comparative strengths and trade-offs remain insufficiently understood for urban analytics. This paper presents a structured review of synthetic human mobility data generation from an urban analytics perspective. We review the literature by methodological family and index it by the mobility outputs each family generates natively and the analytical capabilities those outputs enable. We first provide a taxonomy of synthetic data products, including population and persona representations, activity schedules, trip and tour records, trajectories, and aggregate mobility patterns. We then review the major methodological families, spanning mechanistic models, survey-driven population synthesis, activity- and agent-based simulation, deep generative models, transformer-based mobility language models, and LLM-agentic systems. Building on this synthesis, we introduce a Meaning-Population-Autonomy framework that characterises these methods along three dimensions: behavioural meaning, population grounding and scale, and generation autonomy. We consider these dimensions the principal requirements for downstream urban analytics. Few methods deliver behavioural meaning, population grounding and autonomous generation at once, and fewer still with generation constrained to feasible trajectories.

cs.CE

TERRA-NG v1.0: Extreme-Scale, GPU-accelerated Mantle Convection

We present TERRA-NG, a portable, GPU-accelerated, matrix-free mantle-convection code. A single Kokkos C++ implementation runs at scale on NVIDIA, AMD, and Intel GPU supercomputers. TERRA-NG has a deliberately narrow design: built on a radially extruded mesh of spherical wedges, tailored to the spherical shell geometry, which enables domain-specific optimizations like single quadrature-point integral-evaluations, radial coordinate storage compression and radial shared-memory tiling. The corresponding low-order $W_1$-iso-$W_2/W_1$ wedge-based Stokes--energy discretisation is verified against the Zhong et al.(2008) spherical-shell convection benchmark suite. We showcase TERRA-NG through strong- and weak-scaling on the JUWELS Booster (NVIDIA A100), MareNostrum 5 (NVIDIA H100), LUMI-G (AMD MI250X), Hunter (AMD MI300A APU), and SuperMUC-NG Phase 2 (Intel PVC) supercomputers. Coupled mantle convection simulations at $\sim\!11$ km and $\sim\!5.6$ km radial spacing ($\sim 2.8$ B and $\sim 22$ B DoFs) can be run routinely on standard node partitions of all considered systems. Global $\sim\!1$ km-per-gridpoint mantle convection ($\sim 1.4$ T DoFs) is feasible on an extreme-scale allocation, and a sub-km hero-run at $\sim\!0.7$ km grid spacing scaling up to $\sim 11,000$ GPUs of LUMI-G ($\sim 11$ T DoFs) shows the potential of the code on future, larger machines.

cs.CE

FireDataForge: A Unified Framework for Multi-Source Wildfire Data Retrieval and Integration

Wildfire research, modeling, and education require geospatial data from multiple sources that vary in formats, coordinate systems, spatial resolutions, and temporal cadences. This preprocessing burden limits reproducible reuse. We present FireDataForge, an open-source Python framework that automates retrieval and harmonization of 11 wildfire-related sources spanning fire behavior, weather, land cover, vegetation, elevation, built environment, wildland-urban interface, fire history, and satellite imagery. Given an MTBS Event ID, FireDataForge retrieves relevant datasets, aligns them to a common grid, and outputs analysis-ready NumPy arrays with embedded metadata. Batch processing of historical fires demonstrates support for fire behavior simulation, educational visualization, machine learning, and AI-assisted wildfire analysis.

cs.CE