pub enum InputLocationDerivative<'a> {
Radial {
centers: ArrayView2<'a, f64>,
radial_kind: &'a RadialScalarKind,
},
Jet(ArrayView3<'a, f64>),
}Expand description
Carrier for the ∂Φ/∂t chain-rule input, dispatched on basis kind by
LatentCoordValues::design_gradient_wrt_t_dispatch.
InputLocationDerivative::Radialis the radial-kernel path: the caller supplies the radial kernel family together with the center coordinates, and the chain rule∂Φ/∂t = q(r) · (t − c)is applied internally. This covers every isotropic radial basis — Duchon (any nullspace order), Matérn (every supported half-integer ν), and anything else whose pointwise gradient is radial. Helpers:crate::basis::duchon_radial_first_derivative_nd,crate::basis::matern_radial_first_derivative_nd.InputLocationDerivative::Jetis the pre-computed jet path: the caller has already assembled a closed-form(N, K, d)tensor for a basis whose chain rule is not a simple radial scalar times a unit vector. Sphere kernels carry the tangent-direction timesK'(cos γ); periodic-cyclic B-splines carry the closed-form cardinal derivative; tensor-product B-splines carry the product-rule mix. Helpers:crate::basis::sphere_first_derivative_nd,crate::basis::periodic_bspline_first_derivative_nd,crate::basis::bspline_tensor_first_derivative.
The dispatch is an enum rather than a trait because each path’s arguments differ structurally (radial bases reuse scalar radial kernels shared with the kernel-shape chain machinery; jet bases ship the full tensor). All chain rules are analytic and closed-form; no autodiff, no finite differences.
Variants§
Radial
Radial-kernel chain rule. The chain rule (t − c)/r is reconstructed
internally from the finite q = φ'(r)/r scalar and the center coordinates.
Jet(ArrayView3<'a, f64>)
Pre-computed analytic (n_obs, n_centers, latent_dim) jet.
Auto Trait Implementations§
impl<'a> Freeze for InputLocationDerivative<'a>
impl<'a> RefUnwindSafe for InputLocationDerivative<'a>
impl<'a> Send for InputLocationDerivative<'a>
impl<'a> Sync for InputLocationDerivative<'a>
impl<'a> Unpin for InputLocationDerivative<'a>
impl<'a> UnsafeUnpin for InputLocationDerivative<'a>
impl<'a> UnwindSafe for InputLocationDerivative<'a>
Blanket Implementations§
impl<T> Allocation for T
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.