Pages that link to "Item:Q3567013"
From MaRDI portal
The following pages link to MultiStage Approaches for Optimal Offline Checkpointing (Q3567013):
Displaying 10 items.
- Approximately uniform online checkpointing with bounded memory (Q378218) (← links)
- Reducing Memory Requirements in Scientific Computing and Optimal Control (Q2801814) (← links)
- Optimal Multistage Algorithm for Adjoint Computation (Q2815691) (← links)
- On evaluating higher-order derivatives of the QR decomposition of tall matrices with full column rank in forward and reverse mode algorithmic differentiation (Q2885486) (← links)
- Structure Exploiting Adjoints for Finite Element Discretizations (Q2961061) (← links)
- Adjoint Code Design Patterns (Q4960944) (← 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)
- A matrix-free exact Newton method (Q6498603) (← links)
