Search arXiv⌕ Search

arXiv · 2610.39783

PDE-based Bayesian Inverse Problems in All-at-once Framework

Abstract

We propose a modern all-at-once framework for PDE-based Bayesian inversion by introducing the PDE residual as probabilistic information. In this framework, the PDE residual is treated as a soft constraint with a residual covariance and is directly incorporated into the likelihood function. The new hybrid likelihood function eliminates PDE solves, thus reducing expensive computational costs, while performing rigorous Bayesian inference. Theoretically, we establish the well-posedness of the posterior with uncertainty quantification, and numerically, we propose two efficiency inversion algorithms based on two posterior sampling methods. In particular, one algorithm is based on Metropolis-within-Gibbs MCMC method with a PDE-informed block- diagonal Gaussian prior, and the other is based on a joint sampling strategy. Numerical experiments for a semiconductor inverse problem confirm that the proposed Bayesian all-at-once approach yields a speedup of approximately a factor of two, while having a comparable reconstruction quality as the conventional reduced-based setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tram Thi Ngoc Nguyen, Fabian Schneider, Leila Taghizadeh. 2026-10-29. PDE-based Bayesian Inverse Problems in All-at-once Framework. https://arxiv.org/abs/2610.39783

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

KEEP EXPLORING

Related papers

A continuous scale space of diffeomorphisms

In this paper, we define and study a nested family of reproducing kernel Hilbert spaces of vector fields that is indexed by a range of scales, from which we construct a reproducing kernel Hilbert space of scale-dependent vector fields. We provide a characterization of the reproducing kernel of that space, with numerical approximations ensuring quick evaluations when this kernel does not have a closed form. We then introduce a multiscale version of the large deformation diffeomorphic metric mapping (LDDMM) problem and prove the existence of solutions. Finally, we provide numerical experiments performing landmark matching using multiscale LDDMM.

math.NA↗

Hierarchical Matrices with Tucker Blocks: Construction and Forward Evaluation

In this paper, we introduce hierarchical matrices with Tucker blocks (HMTB) for data-sparse approximation of matrices arising from nonoscillatory and mildly oscillatory kernels. Building on the hierarchical matrix framework, HMTB matrices replace conventional low-rank blocks with Tucker representations. Using high-dimensional interpolation and tensor compression and contractions, we develop algorithms for constructing HMTB matrices and performing matrix-vector multiplication. For an $N \times N$ matrix, these algorithms have linear and quasi-linear complexities in $N$, respectively. Numerical comparisons with an interpolation-based $\mathcal{H}$-matrix implementation demonstrate storage savings and, in several cases, reduced construction times, while maintaining competitive forward-evaluation costs. The framework is also applicable to quasi-uniform grids.

math.NA↗

Data-driven model order reduction for wave propagation in materials with damage and nonlinearities

In this work, we consider wave propagation in materials characterized by nonlinear properties or damage. To accelerate the simulations of the resulting high-dimensional problems, we apply model order reduction methods. Depending on the knowledge of the underlying equations and the availability of their discrete operators, intrusive methods (here projection-based approaches based on proper orthogonal decomposition (POD)) or non-instrusive methods (here data-driven approaches including dynamic mode decomposition (DMD) and operator inference (OpInf)) can be used. We recall the theoretical foundations of the methods and apply them to the problem of wave propagation. In three different numerical examples, we evaluate the performance of the reduction techniques.

math.NA↗