arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1612.09210math.NAcs.NA
收藏

高效的时间域分解算法用于抛物型PDE约束优化问题

Efficient Time Domain Decomposition Algorithms for Parabolic PDE-Constrained Optimization Problems

Southern Illinois University Edwardsville(南伊利诺伊大学爱德华兹维尔分校);University of South Carolina(南卡罗来纳大学)

Jun Liu, Zhu Wang

AI总结:

本文提出时间域分解算法提升一次性方法的计算效率,通过将优化系统分解为多个小子系统并行求解,证明了一级非重叠算法的收敛性,并通过1D和2D数值实验验证了所提算法的可扩展性。

摘要:

带有时间依赖偏微分方程(PDE)作为约束的优化问题在许多科学和工程应用中出现。相关的一阶必要最优系统由一个正向和一个反向的时间依赖PDE以及最优性条件组成。使用一次性方法进行优化过程可同时确定最优控制、状态和伴随状态,但需要求解大规模的全离散最优系统,这在时间跨度长或时间步长小时会变得计算上不可行。为克服这一困难,本文提出几种时间域分解算法以提高一次性方法的计算效率。在这些算法中,将最优系统分解为多个小子系统,覆盖更短的时间区间,并通过适当的连续匹配条件进行耦合。开发了一级和二级乘法和加法Schrödinger算法,用于迭代并行求解分解后的子系统。特别地,证明了一级非重叠算法的收敛性。通过1D和2D数值实验验证了所提算法的有效性,其中开发的二级算法显示出与子域数量可扩展的收敛率。

英文摘要:

Optimization with time-dependent partial differential equations (PDEs) as constraints {appears} in many science and engineering applications. The associated first-order necessary optimality system consists of one forward and one backward time-dependent PDE coupled with optimality conditions. An optimization process by using the one-shot method determines the optimal control, state and adjoint state at once, with the cost of solving a large scale, fully discrete optimality system. Hence, such {a} one-shot method could easily become computationally prohibitive when the time span is long or time step is small. To overcome this difficulty, we propose several time domain decomposition algorithms for improving the {computational efficiency of the one-shot method}. In these algorithms, the optimality system is split into many small subsystems over a much smaller time interval, which are coupled by appropriate continuity matching conditions. Both one-level and two-level multiplicative and additive Schwarz algorithms are developed for iteratively solving the decomposed subsystems in parallel. In particular, the convergence of the one-level, non-overlapping algorithms is proved. The effectiveness of our proposed algorithms is demonstrated by both 1D and 2D numerical experiments, where the developed two-level algorithms {show convergence rates that are scalable} with respect to the number of subdomains.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑