pub struct AdjointRhs<'a, Eqn, Method>where
Eqn: OdeEquations,
Method: OdeSolverMethod<'a, Eqn>,{ /* private fields */ }Expand description
Right-hand side of the adjoint equations is:
F(λ, x, t) = -f^T_x(x, t) λ - g^T_x(x,t)
f_x is the partial derivative of the right-hand side with respect to the state vector. g_x is the partial derivative of the functional g with respect to the state vector.
We need the current state x(t), which is obtained from the checkpointed forward solve at the current time step.
Implementations§
Source§impl<'a, Eqn, Method> AdjointRhs<'a, Eqn, Method>where
Eqn: OdeEquations,
Method: OdeSolverMethod<'a, Eqn>,
impl<'a, Eqn, Method> AdjointRhs<'a, Eqn, Method>where
Eqn: OdeEquations,
Method: OdeSolverMethod<'a, Eqn>,
Trait Implementations§
Source§impl<'a, Eqn, Method> NonLinearOp for AdjointRhs<'a, Eqn, Method>where
Eqn: OdeEquationsAdjoint,
Method: OdeSolverMethod<'a, Eqn>,
impl<'a, Eqn, Method> NonLinearOp for AdjointRhs<'a, Eqn, Method>where
Eqn: OdeEquationsAdjoint,
Method: OdeSolverMethod<'a, Eqn>,
Source§impl<'a, Eqn, Method> NonLinearOpJacobian for AdjointRhs<'a, Eqn, Method>where
Eqn: OdeEquationsAdjoint,
Method: OdeSolverMethod<'a, Eqn>,
impl<'a, Eqn, Method> NonLinearOpJacobian for AdjointRhs<'a, Eqn, Method>where
Eqn: OdeEquationsAdjoint,
Method: OdeSolverMethod<'a, Eqn>,
Source§fn jac_mul_inplace(
&self,
_x: &Self::V,
t: Self::T,
v: &Self::V,
y: &mut Self::V,
)
fn jac_mul_inplace( &self, _x: &Self::V, t: Self::T, v: &Self::V, y: &mut Self::V, )
Compute the product of the Jacobian with a given vector
J(x, t) * v.Source§fn jacobian_inplace(&self, _x: &Self::V, t: Self::T, y: &mut Self::M)
fn jacobian_inplace(&self, _x: &Self::V, t: Self::T, y: &mut Self::M)
Compute the Jacobian matrix
J(x, t) of the operator and store it in the matrix y.
y should have been previously initialised using the output of Self::jacobian_sparsity.
The default implementation of this method computes the Jacobian using Self::jac_mul_inplace,
but it can be overriden for more efficient implementations.Source§fn jacobian_sparsity(&self) -> Option<<Self::M as Matrix>::Sparsity>
fn jacobian_sparsity(&self) -> Option<<Self::M as Matrix>::Sparsity>
Return sparsity information (if available)
Source§fn jac_mul(&self, x: &Self::V, t: Self::T, v: &Self::V) -> Self::V
fn jac_mul(&self, x: &Self::V, t: Self::T, v: &Self::V) -> Self::V
Compute the product of the Jacobian with a given vector
J(x, t) * v, and return the result.
Use [Self::jac_mul_inplace] to for a non-allocating version.Source§fn jacobian(&self, x: &Self::V, t: Self::T) -> Self::M
fn jacobian(&self, x: &Self::V, t: Self::T) -> Self::M
Compute the Jacobian matrix
J(x, t) of the operator and return it.
See Self::jacobian_inplace for a non-allocating version.Source§fn _default_jacobian_inplace(&self, x: &Self::V, t: Self::T, y: &mut Self::M)
fn _default_jacobian_inplace(&self, x: &Self::V, t: Self::T, y: &mut Self::M)
Default implementation of the Jacobian computation (this is the default for Self::jacobian_inplace).
Source§impl<'a, Eqn, Method> Op for AdjointRhs<'a, Eqn, Method>where
Eqn: OdeEquations,
Method: OdeSolverMethod<'a, Eqn>,
impl<'a, Eqn, Method> Op for AdjointRhs<'a, Eqn, Method>where
Eqn: OdeEquations,
Method: OdeSolverMethod<'a, Eqn>,
Auto Trait Implementations§
impl<'a, Eqn, Method> !Freeze for AdjointRhs<'a, Eqn, Method>
impl<'a, Eqn, Method> !RefUnwindSafe for AdjointRhs<'a, Eqn, Method>
impl<'a, Eqn, Method> !Send for AdjointRhs<'a, Eqn, Method>
impl<'a, Eqn, Method> !Sync for AdjointRhs<'a, Eqn, Method>
impl<'a, Eqn, Method> Unpin for AdjointRhs<'a, Eqn, Method>
impl<'a, Eqn, Method> UnsafeUnpin for AdjointRhs<'a, Eqn, Method>
impl<'a, Eqn, Method> !UnwindSafe for AdjointRhs<'a, Eqn, Method>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> NonLinearOpTimePartial for Twhere
T: NonLinearOp,
impl<T> NonLinearOpTimePartial for Twhere
T: NonLinearOp,
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.