Pages that link to "Item:Q3084406"
From MaRDI portal
The following pages link to New Algorithms for Optimal Online Checkpointing (Q3084406):
Displaying 9 items.
- Approximately uniform online checkpointing with bounded memory (Q378218) (← links)
- Reducing Memory Requirements in Scientific Computing and Optimal Control (Q2801814) (← links)
- Algorithmic Differentiation of Numerical Methods (Q2828155) (← links)
- Structure Exploiting Adjoints for Finite Element Discretizations (Q2961061) (← links)
- Online Checkpointing with Improved Worst-Case Guarantees (Q3458748) (← links)
- Randomized Sketching Algorithms for Low-Memory Dynamic Optimization (Q4989933) (← links)
- PETSc TSAdjoint: A Discrete Adjoint ODE Solver for First-Order and Second-Order Sensitivity Analysis (Q5022486) (← links)
- Automated Calculation of Higher Order Partial Differential Equation Constrained Derivative Information (Q5194601) (← links)
- Periodicity in optimal hierarchical checkpointing schemes for adjoint computations (Q5268940) (← links)