Approximation of weak adjoints by reverse automatic differentiation of BDF methods

DOI10.1007/S00211-013-0570-4zbMATH Open1293.65101arXiv1109.3061OpenAlexW1987372335MaRDI QIDQ2454029FDOQ2454029

Authors: Dörte Beigel, M. S. Mommer, Leonard Wirsching, Hans Georg Bock 

Publication date: 12 June 2014

Published in: Numerische Mathematik (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1109.3061

Recommendations

• scientific article; zbMATH DE number 5353260
• On the discrete adjoints of adaptive time stepping algorithms
• Efficient goal-oriented global error estimation for BDF-type methods using discrete adjoints.
• Efficient goal-oriented global error estimators for BDF methods using discrete adjoints
• On the Properties of Runge-Kutta Discrete Adjoints

zbMATH Keywords

convergencenumerical resultBanach spaceHilbert spacesconstrained variational problemdiscrete adjointsPetrov-Galerkin discretizationbackward differentiation formula (BDF) methodsinfinite-dimensional constrained variational problemreverse automatic differentiation

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Sensitivity, stability, well-posedness (49K40) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Stability and convergence of numerical methods for ordinary differential equations (65L20) Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations (65L60)

Cites Work

• Title not available (Why is that?)
• Solving Ordinary Differential Equations I
• Error Estimates and Adaptive Time-Step Control for a Class of One-Step Methods for Stiff Ordinary Differential Equations
• Title not available (Why is that?)
• Automatic differentiation of explicit Runge-Kutta methods for optimal control
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ordinary differential equations.
• A Posteriori Error Estimation and Global Error Control for Ordinary Differential Equations by the Adjoint Method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal control theory
• Functional analysis
• Adjoint-based algorithms and numerical methods for sensitivity generation and optimization of large scale dynamic systems.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Global Error Estimation and Control for Initial Value Problems
• Numerical Solution of Ordinary Differential Equations
• Title not available (Why is that?)
• Convergence rates for adaptive approximation of ordinary differential equations
• Adjoint sensitivity analysis for differential-algebraic equations: algorithms and software

Cited In (6)

• Efficient goal-oriented global error estimators for BDF methods using discrete adjoints
• Discrete adjoint implicit peer methods in optimal control
• On the discrete adjoints of adaptive time stepping algorithms
• Implicit peer triplets in gradient-based solution algorithms for ODE constrained optimal control
• Efficient goal-oriented global error estimation for BDF-type methods using discrete adjoints.
• Variable-stepsize implicit peer triplets in ODE constrained optimal control

Uses Software

• DAESOL-II

This page was built for publication: Approximation of weak adjoints by reverse automatic differentiation of BDF methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454029)