Approximate Bayesian Computation and Nested Sampling Algorithm for Source-Term Identification in a Type of Time Fractional Advection Diffusion Equation

Identifying unknown source terms of anomalous transport processes described by a one-dimensional time fractional advection diffusion equation from sparse concentration measurements is a typical ill-posed inverse problem. However, it is hard to obtain a credible likelihood of the measurement error model. This paper therefore casts the source identification problem as a likelihood-free Bayesian inference problem and solves it with approximate Bayesian computation and nested sampling (ABC-NS) algorithm. To improve the ABC-NS algorithm, a sliced-Wasserstein discrepancy is introduced as an alternative to the relative root-mean-square error, and the ellipsoidal proposal is replaced by a bounding multi-ellipsoid rule with a fixed enlargement. The main algorithmic additions are the SWD, the two-cluster multi-ellipsoid rule and joint inference of the source strengths and α; the L1/upwind forward solver is classical. The forward problem is discretised with the L1 scheme in time and an implicit finite difference scheme in space, and the unconditional stability and convergence of the finite difference scheme are proved. Several numerical experiments are reported, and the results show that the ABC-NS algorithm recovers the source strengths with quantified uncertainty, that the acceptance rate decay of rejection-based ABC is drastically alleviated, that the ellipsoidal sampler reaches the noise-matched tolerance with an order of magnitude fewer forward solves than ABC-SMC needs merely to approach it, and that the fractional order can be inferred jointly with the source strengths from the same data, which is not possible within the deterministic regularization framework. The sliced-Wasserstein discrepancy is slightly less sharp than the residual norm when used alone, but it yields higher empirical coverage, although still below nominal, once it is combined with the multi-ellipsoid proposal, which raises the coverage of the nominal 95% intervals from 0.62 to 0.75 at a cost of about one fifth more forward solves than the single-ellipsoid version.

Authors

Institutions

Publication Details

Journal
Fractal and Fractional
Published
2026-11-19
DOI
https://doi.org/10.3390/fractalfract10110817
Primary Topic
Markov Chains and Monte Carlo Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Approximate Bayesian Computation and Nested Sampling Algorithm for Source-Term Identification in a Type of Time Fractional Advection Diffusion Equation

Wei Gu, Chaoqin Yi
Fractal and Fractional
Markov Chains and Monte Carlo Methods
article

Approximate Bayesian Computation and Nested Sampling Algorithm for Source-Term Identification in a Type of Time Fractional Advection Diffusion Equation

Wei Gu, Chaoqin Yi
article en

Abstract

Identifying unknown source terms of anomalous transport processes described by a one-dimensional time fractional advection diffusion equation from sparse concentration measurements is a typical ill-posed inverse problem. However, it is hard to obtain a credible likelihood of the measurement error model. This paper therefore casts the source identification problem as a likelihood-free Bayesian inference problem and solves it with approximate Bayesian computation and nested sampling (ABC-NS) algorithm. To improve the ABC-NS algorithm, a sliced-Wasserstein discrepancy is introduced as an alternative to the relative root-mean-square error, and the ellipsoidal proposal is replaced by a bounding multi-ellipsoid rule with a fixed enlargement. The main algorithmic additions are the SWD, the two-cluster multi-ellipsoid rule and joint inference of the source strengths and α; the L1/upwind forward solver is classical. The forward problem is discretised with the L1 scheme in time and an implicit finite difference scheme in space, and the unconditional stability and convergence of the finite difference scheme are proved. Several numerical experiments are reported, and the results show that the ABC-NS algorithm recovers the source strengths with quantified uncertainty, that the acceptance rate decay of rejection-based ABC is drastically alleviated, that the ellipsoidal sampler reaches the noise-matched tolerance with an order of magnitude fewer forward solves than ABC-SMC needs merely to approach it, and that the fractional order can be inferred jointly with the source strengths from the same data, which is not possible within the deterministic regularization framework. The sliced-Wasserstein discrepancy is slightly less sharp than the residual norm when used alone, but it yields higher empirical coverage, although still below nominal, once it is combined with the multi-ellipsoid proposal, which raises the coverage of the nominal 95% intervals from 0.62 to 0.75 at a cost of about one fifth more forward solves than the single-ellipsoid version.

Fractal and FractionalVol. 10(11)
Zhongnan University of Economics and Law (CN), Shanghai Urban Construction Vocational College (CN)
Markov Chains and Monte Carlo Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon