Advection-diffusion processes;
Alternating direction method of multipliers;
Inverse models;
Spatio-temporal processes;
D O I:
10.1080/00401706.2023.2181222
中图分类号:
O21 [概率论与数理统计];
C8 [统计学];
学科分类号:
020208 ;
070103 ;
0714 ;
摘要:
Inverse problems involve making inference about unknown parameters of a physical process using observational data. This article investigates an important class of inverse problems-the estimation of the initial condition of a spatio-temporal advection-diffusion process using spatially sparse data streams. Three spatial sampling schemes are considered, including irregular, nonuniform and shifted uniform sampling. The irregular sampling scheme is the general scenario, while computationally efficient solutions are available in the spectral domain for nonuniform and shifted uniform sampling. For each sampling scheme, the inverse problem is formulated as a regularized convex optimization problem that minimizes the distance between forward model outputs and observations. The optimization problem is solved by the Alternating Direction Method of Multipliers algorithm, which also handles the situation when a linear inequality constraint (e.g., non-negativity) is imposed on the model output. Numerical examples are presented, code is made available on GitHub, and discussions are provided to generate some useful insights of the proposed inverse modeling approaches.
机构:
Univ Roma La Sapienza, INFOCOM Dept, Via Eudossiana 18, I-00184 Rome, ItalyUniv Roma La Sapienza, INFOCOM Dept, Via Eudossiana 18, I-00184 Rome, Italy
Sardellitti, S.
Giona, M.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Roma La Sapienza, Dept Chem Engn, Via Eudossiana 18, I-00184 Rome, ItalyUniv Roma La Sapienza, INFOCOM Dept, Via Eudossiana 18, I-00184 Rome, Italy
Giona, M.
Barbarossa, S.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Roma La Sapienza, INFOCOM Dept, Via Eudossiana 18, I-00184 Rome, ItalyUniv Roma La Sapienza, INFOCOM Dept, Via Eudossiana 18, I-00184 Rome, Italy
Barbarossa, S.
2008 IEEE SENSOR ARRAY AND MULTICHANNEL SIGNAL PROCESSING WORKSHOP,
2008,
: 266
-
+