Lines Matching refs:adjoint

1091 state $u$, a boolean flag indicating forward solve (1) or adjoint
1109 The `TS` library provides a framework based on discrete adjoint models
1117 ### Using the discrete adjoint methods
1143 To perform the discrete adjoint sensitivity analysis one first sets up
1234 without having to use the adjoint solvers.
1236 To provide a better understanding of the use of the adjoint solvers, we
1290 In the adjoint run, $\lambda$ and $\mu$ are initialized as
1311 - discrete adjoint sensitivity using explicit and implicit time stepping methods for an ODE problem
1313 - an optimization problem using the discrete adjoint models of the ERK (for nonstiff ODEs)
1318 - an ODE-constrained optimization using the discrete adjoint models of the
1321 - discrete adjoint sensitivity using the Crank-Nicolson methods for DAEs with discontinuities
1323 - a DAE-constrained optimization problem using the discrete adjoint models of the Crank-Nicolson
1326 - discrete adjoint sensitivity using the Crank-Nicolson methods for a PDE problem
1331 The discrete adjoint model requires the states (and stage values in the
1333 matrices during the adjoint (backward) run. By default, PETSc stores the
1362   the progress of the adjoint work flow,