Treeverse / Revolve
Summary:
Revolve implements an efficient checkpointing algorithm for the exact computation of a gradient of a functional consisting of a (pseudo) time-stepping procedure.
URL: https://math.uni-paderborn.de/ag/mathematik-und-ihre-anwendungen/software/
Developers:
- Andrea Walther, Institut für Mathematik. Universität Paderborn
| Supported Language: |
C/C++ Fortran77 Fortran95 |
Reference:
Andreas Griewank, Andrea Walther
Algorithm 799: Revolve: An Implementation of Checkpoint for the Reverse or Adjoint Mode of Computational Differentiation
Article in ACM Transactions on Mathematical Software, 2000
Juan M. Restrepo, Gary K. Leaf, Andreas Griewank
Circumventing Storage Limitations in Variational Data Assimilation
Article in SIAM Journal on Scientific Computing, 1998
Algorithm 799: Revolve: An Implementation of Checkpoint for the Reverse or Adjoint Mode of Computational Differentiation
Article in ACM Transactions on Mathematical Software, 2000
Juan M. Restrepo, Gary K. Leaf, Andreas Griewank
Circumventing Storage Limitations in Variational Data Assimilation
Article in SIAM Journal on Scientific Computing, 1998
Features:
The package Revolve is an enhancement of the algorithm treeverse.
It allows a drastic reduction of the memory requirement whenever the reversal of a (pseudo) time-stepping procedure is required.
Licensing: free
Entries in our publication database that actually use Treeverse / Revolve in the numerical experiments: 3
The following diagram shows these entries versus the year of the publication.
|
|
|
|
|||
| '98 | '00 | '06 | ||||
| Year | ||||||
Selected Applications:
Related Research Groups: