Approximation of weak adjoints by reverse automatic differentiation of BDF methods (Q2454029)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Approximation of weak adjoints by reverse automatic differentiation of BDF methods
scientific article

    Statements

    Approximation of weak adjoints by reverse automatic differentiation of BDF methods (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 June 2014
    0 references
    The authors discuss the approximation of weak adjoints by reverse automatic differentiation of backward differentiation formula (BDF) methods. They first recall the adjoint differential equation as part of optimality conditions of an infinite-dimensional constrained variational problem in Hilbert spaces. They embed the constrained variational problem into the Banach space of continuously differentiable functions and extend the settings to the space of all functions that are continuous and piecewise continuously differentiable. They prove the convergence of the discrete adjoints to the classical solution of the adjoint differential equation on the inner time interval. Numerical results are provided.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete adjoints
    0 references
    Petrov-Galerkin discretization
    0 references
    reverse automatic differentiation
    0 references
    backward differentiation formula (BDF) methods
    0 references
    infinite-dimensional constrained variational problem
    0 references
    Hilbert spaces
    0 references
    constrained variational problem
    0 references
    Banach space
    0 references
    convergence
    0 references
    numerical result
    0 references
    0 references
    0 references