面向PDE约束优化且应用于数据同化的增量数据压缩方法
Incremental data compression for PDE-constrained optimization with a data assimilation application
AI总结:
本文提出基于增量本征正交分解(iPOD)的不精确梯度方法,用于解决时间依赖PDE约束优化中的数据存储难题,并通过数据同化问题验证其理论收敛性与实际效果。
摘要:
我们提出并分析了一种基于增量本征正交分解(iPOD)的不精确梯度方法,以解决时间依赖的PDE约束优化中的数据存储困难,特别是以数据同化问题作为关键思想的详细演示。通过严格分析,所提方法被证明具有鲁棒性。我们首先借助Hilbert-Schmidt算子推导出iPOD的尖锐数据压缩误差估计。然后,我们展示了一种数值PDE分析,以说明如何适当选择用于iPOD数据压缩的Hilbert空间,从而使梯度误差得到控制。我们进一步证明,对于梯度误差适当有界的凸问题,不精确梯度方法能够达到最优解的精度水平,同时与通常的梯度方法相比不会损害收敛速度。最后,提供了数值实验来验证理论结果并验证所提方法的有效性。
英文摘要:
We propose and analyze an inexact gradient method based on incremental proper orthogonal decomposition (iPOD) to address the data storage difficulty in time-dependent PDE-constrained optimization, particularly for a data assimilation problem as a detailed demonstration for the key ideas. The proposed method is proved robust by rigorous analysis. We first derive a sharp data compression error estimate of the iPOD with the help of Hilbert-Schmidt operators. Then we demonstrate a numerical PDE analysis to show how to properly choose the Hilbert space for the iPOD data compression so that the gradient error is under control. We further prove that for a convex problem with appropriately bounded gradient error, the inexact gradient method achieves the accuracy level of the optimal solution while not hurting the convergence rate compared with the usual gradient method. Finally, numerical experiments are provided to verify the theoretical results and validate the proposed method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。