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

通过BDF方法的反向自动微分逼近弱伴随

Approximation of weak adjoints by reverse automatic differentiation of BDF methods

Interdisciplinary Center for Scientific Computing (IWR), Heidelberg University(海德堡大学跨学科科学计算中心)

Dörte Beigel, Mario S. Mommer, Leonard Wirsching, Hans Georg Bock

AI总结:

本文通过约束变分问题框架,揭示了多步向后微分公式(BDF)方法的离散伴随与伴随微分方程解之间的关系,提出了弱伴随解的概念,并证明了离散伴随方案对弱伴随的有限元逼近及其渐近收敛性。

摘要:

通过本文,我们揭示了多步向后微分公式(BDF)方法的离散伴随与伴随微分方程解之间的关系。为此,我们建立了一个基于约束变分问题的泛函分析框架,并引入了弱伴随解的概念。我们设计了BDF方法的有限元Petrov-Galerkin解释及其通过反向内部数值微分得到的离散伴随格式。我们展示了如何通过离散伴随格式计算弱伴随的有限元逼近,并证明了其在有界变差归一化函数空间中的渐近收敛性。我们还得到了在内时间区间上离散伴随到经典伴随的渐近收敛性。最后,我们给出了非自适应和完全自适应BDF格式的数值结果。所提出的框架为将有限元方法中的全局误差估计技术推广到BDF方法开辟了道路。

英文摘要:

With this contribution, we shed light on the relation between the discrete adjoints of multistep backward differentiation formula (BDF) methods and the solution of the adjoint differential equation. To this end, we develop a functional-analytic framework based on a constrained variational problem and introduce the notion of weak adjoint solutions. We devise a finite element Petrov-Galerkin interpretation of the BDF method together with its discrete adjoint scheme obtained by reverse internal numerical differentiation. We show how the finite element approximation of the weak adjoint is computed by the discrete adjoint scheme and prove its asymptotic convergence in the space of normalized functions of bounded variation. We also obtain asymptotic convergence of the discrete adjoints to the classical adjoints on the inner time interval. Finally, we give numerical results for non-adaptive and fully adaptive BDF schemes. The presented framework opens the way to carry over the existing theory on global error estimation techniques from finite element methods to BDF methods.

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

↑