#[non_exhaustive]pub struct PdaResult {
pub coefficients: Vec<Vec<f64>>,
pub order: usize,
pub residuals: Option<FdMatrix>,
}Expand description
Result of principal_differential_analysis.
Holds the recovered pointwise coefficient functions β₀(t), …, β_{m-1}(t)
of the order-m linear ODE:
D^m x(t) = -β₀(t)·x(t) - β₁(t)·Dx(t) - … - β_{m-1}(t)·D^{m-1}x(t).
§Fields
coefficients— Length-orderouter Vec;coefficients[k]is β_k(t) sampled atargvals(lengthn_pts).order— ODE order m.residuals— Optional residual matrix (currently alwaysNone; can be computed fromLfd::applywith the recovered coefficients).
Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional
Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.coefficients: Vec<Vec<f64>>Recovered coefficient functions.
coefficients[k] is β_k(t) sampled at the evaluation grid supplied to
principal_differential_analysis. Length of outer Vec is order;
each inner Vec has length n_pts.
order: usizeOrder of the estimated ODE.
residuals: Option<FdMatrix>Optional residuals matrix (not computed by default; kept for extensibility).
Trait Implementations§
impl StructuralPartialEq for PdaResult
Auto Trait Implementations§
impl Freeze for PdaResult
impl RefUnwindSafe for PdaResult
impl Send for PdaResult
impl Sync for PdaResult
impl Unpin for PdaResult
impl UnsafeUnpin for PdaResult
impl UnwindSafe for PdaResult
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> 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,
impl<T> Scalar for T
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.