Advantages of Binomial Checkpointing for Memory-reduced Adjoint Calculations

Andrea Walther () and Andreas Griewank ()
Additional contact information
Andrea Walther: Technische Universität, Institute of Scientific Computing
Andreas Griewank: Humboldt University, Institute of Mathematics

A chapter in Numerical Mathematics and Advanced Applications, 2004, pp 834-843 from Springer

Abstract: Summary Checkpointing techniques become more and necessary for the computation of adjoints. This paper presents the more common multi-level checkpointing as well as the less known binomial checkpointing. The checkpointing approaches are compared with respect to the number of time steps the adjoint of which can be calculated, the run-time needed for the adjoint calculation and the memory requirement. Some examples illustrate the shown results

Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-18775-9_82

Ordering information: This item can be ordered from
http://www.springer.com/9783642187759

DOI: 10.1007/978-3-642-18775-9_82

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().