2017
DOI: 10.1063/1.4985359
|View full text |Cite
|
Sign up to set email alerts
|

Probabilistic numerical methods for PDE-constrained Bayesian inverse problems

Abstract: This paper develops meshless methods for probabilistically describing discretisation error in the numerical solution of partial differential equations. This construction enables the solution of Bayesian inverse problems while accounting for the impact of the discretisation of the forward problem. In particular, this drives statistical inferences to be more conservative in the presence of significant solver error. Theoretical results are presented describing rates of convergence for the posteriors in both the f… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
83
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 79 publications
(85 citation statements)
references
References 56 publications
2
83
0
Order By: Relevance
“…Remark 3. Similar to our approach, Probabilistic Numerical Methods (PNMs) [63,64,65] take a statistical point of view of classical numerical methods (e.g. a finite element solver) that treat the output as a point estimate of the true solution.…”
Section: Probabilistic Surrogates With Reverse Kl Formulationmentioning
confidence: 99%
“…Remark 3. Similar to our approach, Probabilistic Numerical Methods (PNMs) [63,64,65] take a statistical point of view of classical numerical methods (e.g. a finite element solver) that treat the output as a point estimate of the true solution.…”
Section: Probabilistic Surrogates With Reverse Kl Formulationmentioning
confidence: 99%
“…For treatment of PDEs possible choices of index variables in (4) or (6) include separation constants of analytical solutions, or the frequency variable of an integral transform. In accordance with [10], using basis functions that satisfy the underlying PDE, a probabilistic meshless method (PMM) is constructed. In particular, if ζ ζ ζ parameterizes positions of sources, and φ (x, ζ ζ ζ ) = G(x, ζ ζ ζ ) in (6) is chosen to be a fundamental solution / Green's function G(x, ζ ζ ζ ) of the PDE, one may call the resulting scheme a probabilistic method of fundamental solutions (pMFS).…”
Section: Construction Of Kernels For Pdesmentioning
confidence: 99%
“…In particular, if ζ ζ ζ parameterizes positions of sources, and φ (x, ζ ζ ζ ) = G(x, ζ ζ ζ ) in (6) is chosen to be a fundamental solution / Green's function G(x, ζ ζ ζ ) of the PDE, one may call the resulting scheme a probabilistic method of fundamental solutions (pMFS). In [10] sources are placed across the whole computational domain, and the resulting kernel is called natural. Here we will instead place sources in the exterior to fulfill the homogeneous interior problem, as in the classical MFS [6,7,8].…”
Section: Construction Of Kernels For Pdesmentioning
confidence: 99%
See 2 more Smart Citations