1999 | OriginalPaper | Buchkapitel
Applying the Checkpointing Routine treeverse to Discretizations of Burgers’ Equation*
verfasst von : A. Walther, A. Griewank
Erschienen in: High Performance Scientific and Engineering Computing
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We consider the inviscid Burgers’ equation augmented by a control term and its adjoint equation. For several discretization schemes of the inviscid Burgers’ equation the adjoint finite difference methods are derived. Applying these discretization methods and the checkpointing routine treeverse, approximations of the solution of both differential equations are calculated and compared.