pub struct BmsLogslopeJacobian {
pub marginal_dense: Arc<Array2<f64>>,
pub logslope_dense: Arc<Array2<f64>>,
pub offset_m: Array1<f64>,
pub offset_s: Array1<f64>,
pub z: Arc<Array1<f64>>,
pub p_marginal: usize,
}Expand description
β-dependent Jacobian for the BMS logslope block.
∂η_i/∂β_s = (q_i · s²·g_i / c_i + s·z_i) · G[i,:] where q_i = M[i,:] · β_m + offset_m[i], g_i = G[i,:] · β_s + offset_s[i], c_i = sqrt(1 + (s·g_i)²), s = state.probit_frailty_scale.
probit_frailty_scale is read from the evaluation state at call time.
Designs are pre-densified at construction to avoid repeated materialisation.
Fields§
§marginal_dense: Arc<Array2<f64>>Dense marginal design: n × p_m.
logslope_dense: Arc<Array2<f64>>Dense logslope design: n × p_s.
offset_m: Array1<f64>§offset_s: Array1<f64>§z: Arc<Array1<f64>>§p_marginal: usizeNumber of marginal columns (= start of β_s in the full β vector).
Implementations§
Trait Implementations§
Source§impl BlockEffectiveJacobian for BmsLogslopeJacobian
impl BlockEffectiveJacobian for BmsLogslopeJacobian
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
Auto Trait Implementations§
impl Freeze for BmsLogslopeJacobian
impl RefUnwindSafe for BmsLogslopeJacobian
impl Send for BmsLogslopeJacobian
impl Sync for BmsLogslopeJacobian
impl Unpin for BmsLogslopeJacobian
impl UnsafeUnpin for BmsLogslopeJacobian
impl UnwindSafe for BmsLogslopeJacobian
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.