pub struct IntkambeResidual {
orders: Vec<i32>,
arguments: [Vec<Complex>; 2],
size: usize,
}Expand description
What intkambe_array saves for its pullback: the orders and the arguments. The
pullback uses the adjacent-order recurrence and the endpoint integrand.
Fields§
§orders: Vec<i32>§arguments: [Vec<Complex>; 2]§size: usizeImplementations§
Source§impl IntkambeResidual
impl IntkambeResidual
Sourcepub fn new(orders: Vec<i32>, arguments: [Vec<Complex>; 2]) -> Result<Self>
pub fn new(orders: Vec<i32>, arguments: [Vec<Complex>; 2]) -> Result<Self>
Keep the broadcast inputs needed by derivatives without evaluating values.
Sourcepub fn pushforward(&self, tangents: [&[Complex]; 2]) -> Result<Vec<Complex>>
pub fn pushforward(&self, tangents: [&[Complex]; 2]) -> Result<Vec<Complex>>
Directional derivative in z and eta. Inactive arguments do not evaluate
their derivative, so a direction in eta remains valid when only dz is singular.
Sourcepub fn pullback(&self, cotangent: &[Complex]) -> Result<[Vec<Complex>; 2]>
pub fn pullback(&self, cotangent: &[Complex]) -> Result<[Vec<Complex>; 2]>
The gradients with respect to z and eta, given the gradient cotangent with
respect to the values. At z = 0 the z gradient of orders n <= -3 is its
limit, zero. Orders n >= -2 have no z gradient at z = 0 and give an error.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for IntkambeResidual
impl RefUnwindSafe for IntkambeResidual
impl Send for IntkambeResidual
impl Sync for IntkambeResidual
impl Unpin for IntkambeResidual
impl UnwindSafe for IntkambeResidual
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> 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 more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.