2020 Proceedings of the SIAM Workshop on Combinatorial Scientific Computing 2020
DOI: 10.1137/1.9781611976229.3
|View full text |Cite
|
Sign up to set email alerts
|

Checkpointing Approaches for the Computation of Adjoints Covering Resilience Issues

Abstract: Adjoint methods are an efficient approach for computing gradient information. Together with the favorable temporal complexity result for the computation of adjoints, however, comes a memory requirement that is in essence proportional to the operation count of the underlying function, for example, if algorithmic differentiation is used to provide the adjoints. For this reason, several checkpointing approaches, including binomial checkpointing, have become popular. This paper analyzes an extension of checkpointi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2020
2020
2025
2025

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
references
References 7 publications
0
0
0
Order By: Relevance