A-optimal encoding weights for nonlinear inverse problems, with application to the Helmholtz inverse problem

A-optimal encoding weights for nonlinear inverse problems, with application to the Helmholtz inverse problem
复制标题

非线性反问题的 A 最优编码权重,及其在亥姆霍兹反问题中的应用

DOI:
10.1088/1361-6420/aa6d8e
复制
发表时间:
2017
期刊:
影响因子:
2.1
通讯作者:
Ghattas, Omar
Ghattas, Omar
中科院分区:
数学2区
文献类型:
--
作者:
Crestel, Benjamin;Alexanderian, Alen;Stadler, Georg;Ghattas, Omar

文献摘要

参考文献

被引文献

相似文献

使用多个实验解决由偏微分方程控制的反问题的计算成本随着实验的数量线性增加。最近提出的一种方法,以减少这种成本只使用少量的随机线性组合的所有实验来解决反问题。这种方法适用于PDE解线性依赖于模拟实验的右侧函数的反问题。由于这种方法本质上是随机的,因此所获得的重建的质量可能会变化,特别是当仅使用少量组合时。我们开发了一个贝叶斯公式的定义和计算的编码权重,导致参数重建的不确定性最小。我们称这些权重为A-最优编码权重。我们的框架适用于逆问题的偏微分方程是非线性的反演参数场。我们制定的问题,在无限维,并遵循优化,然后离散化的方法,特别注意离散化和数值方法的选择,以实现计算成本是独立的参数离散化。我们阐述了我们的方法的亥姆霍兹逆问题,并推导出基于伴随的表达式的梯度的优化问题的目标函数,找到A-最优编码权重。所提出的方法对于实时监控应用是潜在的有吸引力的,在实时监控应用中,人们可以投入精力离线计算最佳权重,以便以后随着时间的推移以初始成本的一小部分重复地解决逆问题。
The computational cost of solving an inverse problem governed by PDEs, using multiple experiments, increases linearly with the number of experiments. A recently proposed method to decrease this cost uses only a small number of random linear combinations of all experiments for solving the inverse problem. This approach applies to inverse problems where the PDE solution depends linearly on the right-hand side function that models the experiment. As this method is stochastic in essence, the quality of the obtained reconstructions can vary, in particular when only a small number of combinations are used. We develop a Bayesian formulation for the definition and computation of encoding weights that lead to a parameter reconstruction with the least uncertainty. We call these weights A-optimal encoding weights. Our framework applies to inverse problems where the governing PDE is nonlinear with respect to the inversion parameter field. We formulate the problem in infinite dimensions and follow the optimize-then-discretize approach, devoting special attention to the discretization and the choice of numerical methods in order to achieve a computational cost that is independent of the parameter discretization. We elaborate our method for a Helmholtz inverse problem, and derive the adjoint-based expressions for the gradient of the objective function of the optimization problem for finding the A-optimal encoding weights. The proposed method is potentially attractive for real-time monitoring applications, where one can invest the effort to compute optimal weights offline, to later solve an inverse problem repeatedly, over time, at a fraction of the initial cost.
针对赤道和双峰替代方案的方向随机性测试
DOI: --
发表时间: 1972
期刊:
影响因子: --
作者:
T. W. Anderson;M. Stephens
通讯作者: M. Stephens
贝叶斯实验设计
DOI: --
发表时间: 2014
期刊:
影响因子: --
作者:
W. Linden;V. Dose;U. Toussaint
通讯作者: U. Toussaint
DOI: 10.1088/0266-5611/24/5/055012
发表时间: 2008-10-01
期刊: INVERSE PROBLEMS
影响因子: 2.1
作者:
Haber, E.;Horesh, L.;Tenorio, L.
通讯作者: Tenorio, L.
DOI: --
发表时间: 2010
期刊:
影响因子: --
作者:
W. Symes
通讯作者: W. Symes
DOI: --
发表时间: 2015
期刊:
影响因子: --
作者:
E. Haber;K. van den Doel;L. Horesh
通讯作者: L. Horesh