pub struct AdditiveBlockJacobian {
pub design: Array2<f64>,
pub own_output: usize,
pub n_family_outputs: usize,
}Expand description
A BlockEffectiveJacobian for any block that contributes linearly to
exactly one output of a multi-output family.
own_output is the zero-based output index that this block drives.
n_family_outputs is the total number of outputs (e.g. 2 for location-scale).
design is the block’s effective design matrix (n × p_block).
The returned Jacobian has shape (n_family_outputs * n, p_block):
rows own_output * n .. (own_output + 1) * n contain design,
all other rows are zero.
Fields§
§design: Array2<f64>§own_output: usize§n_family_outputs: usizeTrait Implementations§
Source§impl BlockEffectiveJacobian for AdditiveBlockJacobian
impl BlockEffectiveJacobian for AdditiveBlockJacobian
Source§fn effective_jacobian_rows(
&self,
state: &FamilyLinearizationState<'_>,
rows: Range<usize>,
) -> Result<Array2<f64>, String>
fn effective_jacobian_rows( &self, state: &FamilyLinearizationState<'_>, rows: Range<usize>, ) -> Result<Array2<f64>, String>
Stacked multi-output Jacobian for a contiguous observation row range. Read more
Source§fn effective_jacobian_at(
&self,
state: &FamilyLinearizationState<'_>,
) -> Result<Array2<f64>, String>
fn effective_jacobian_at( &self, state: &FamilyLinearizationState<'_>, ) -> Result<Array2<f64>, String>
Stacked multi-output Jacobian at the current β. Read more
Auto Trait Implementations§
impl Freeze for AdditiveBlockJacobian
impl RefUnwindSafe for AdditiveBlockJacobian
impl Send for AdditiveBlockJacobian
impl Sync for AdditiveBlockJacobian
impl Unpin for AdditiveBlockJacobian
impl UnsafeUnpin for AdditiveBlockJacobian
impl UnwindSafe for AdditiveBlockJacobian
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
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.