pub struct SmoothDesign {
pub term_designs: Vec<DesignMatrix>,
pub penalties: Vec<BlockwisePenalty>,
pub nullspace_dims: Vec<usize>,
pub penaltyinfo: Vec<PenaltyBlockInfo>,
pub dropped_penaltyinfo: Vec<DroppedPenaltyBlockInfo>,
pub terms: Vec<SmoothTerm>,
pub coefficient_lower_bounds: Option<Array1<f64>>,
pub linear_constraints: Option<LinearInequalityConstraints>,
}Fields§
§term_designs: Vec<DesignMatrix>§penalties: Vec<BlockwisePenalty>Per-term block-local penalties. Each col_range is relative to the
smooth block (i.e. indexing into the concatenation of term_designs).
nullspace_dims: Vec<usize>§penaltyinfo: Vec<PenaltyBlockInfo>§dropped_penaltyinfo: Vec<DroppedPenaltyBlockInfo>§terms: Vec<SmoothTerm>§coefficient_lower_bounds: Option<Array1<f64>>Optional smooth-block lower bounds in smooth coefficient coordinates.
Length equals total_smooth_cols() when present.
linear_constraints: Option<LinearInequalityConstraints>Optional smooth-block inequality constraints:
A_smooth * beta_smooth >= b.
Implementations§
Source§impl SmoothDesign
impl SmoothDesign
Source§impl SmoothDesign
impl SmoothDesign
Sourcepub fn map_term_coefficients(
unconstrained: &Array1<f64>,
shape: ShapeConstraint,
) -> Result<Array1<f64>, BasisError>
pub fn map_term_coefficients( unconstrained: &Array1<f64>, shape: ShapeConstraint, ) -> Result<Array1<f64>, BasisError>
Map an unconstrained term coefficient vector to its constrained shape space. This is useful for nonlinear fits that optimize unconstrained parameters.
Trait Implementations§
Source§impl Clone for SmoothDesign
impl Clone for SmoothDesign
Source§fn clone(&self) -> SmoothDesign
fn clone(&self) -> SmoothDesign
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for SmoothDesign
impl Debug for SmoothDesign
Source§impl From<RawSmoothDesign> for SmoothDesign
impl From<RawSmoothDesign> for SmoothDesign
Source§fn from(value: RawSmoothDesign) -> Self
fn from(value: RawSmoothDesign) -> Self
Converts to this type from the input type.
Auto Trait Implementations§
impl !RefUnwindSafe for SmoothDesign
impl !UnwindSafe for SmoothDesign
impl Freeze for SmoothDesign
impl Send for SmoothDesign
impl Sync for SmoothDesign
impl Unpin for SmoothDesign
impl UnsafeUnpin for SmoothDesign
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.