Skip to main content

AdjointRhs

Struct AdjointRhs 

Source
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>,

Source

pub fn new( eqn: &'a Eqn, context: Rc<RefCell<AdjointContext<'a, Eqn, Method>>>, with_out: bool, ) -> Self

Trait Implementations§

Source§

impl<'a, Eqn, Method> NonLinearOp for AdjointRhs<'a, Eqn, Method>
where Eqn: OdeEquationsAdjoint, Method: OdeSolverMethod<'a, Eqn>,

Source§

fn call_inplace(&self, lambda: &Self::V, t: Self::T, y: &mut Self::V)

F(λ, x, t) = -f^T_x(x, t) λ - g^T_x(x,t)

Source§

fn call(&self, x: &Self::V, t: Self::T) -> Self::V

Compute the operator F(x, t) at a given state and time, and return the result. Use [Self::call_inplace] to for a non-allocating version.
Source§

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, )

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)

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>

Return sparsity information (if available)
Source§

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

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)

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>,

Source§

type T = <Eqn as Op>::T

Source§

type V = <Eqn as Op>::V

Source§

type M = <Eqn as Op>::M

Source§

type C = <Eqn as Op>::C

Source§

fn nstates(&self) -> usize

Return the number of input states of the operator.
Source§

fn nout(&self) -> usize

Return the number of outputs of the operator.
Source§

fn nparams(&self) -> usize

Return the number of parameters of the operator.
Source§

fn context(&self) -> &Self::C

return the context of the operator
Source§

fn statistics(&self) -> OpStatistics

Return statistics about the operator (e.g. how many times it was called, how many times the jacobian was computed, etc.)

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>
where <Eqn as Op>::V: Unpin,

§

impl<'a, Eqn, Method> UnsafeUnpin for AdjointRhs<'a, Eqn, Method>
where <Eqn as Op>::V: UnsafeUnpin,

§

impl<'a, Eqn, Method> !UnwindSafe for AdjointRhs<'a, Eqn, Method>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> ByRef<T> for T

Source§

fn by_ref(&self) -> &T

Source§

impl<T> DistributionExt for T
where T: ?Sized,

Source§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> NonLinearOpTimePartial for T
where T: NonLinearOp,

Source§

fn time_derive_inplace(&self, x: &Self::V, t: Self::T, y: &mut Self::V)

Compute the partial time derivative ∂F/∂t(x, t) and store it in y. Read more
Source§

fn time_derive(&self, x: &Self::V, t: Self::T) -> Self::V

Compute the partial time derivative ∂F/∂t(x, t) and return it.
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,