pub struct CoupledNoise<N: RealField, D: Dim, QD: Dim>
where DefaultAllocator: Allocator<N, D, QD> + Allocator<N, QD>,
{ pub q: OVector<N, QD>, pub G: OMatrix<N, D, QD>, }
Expand description

Additive noise.

Noise represented as a noise variance vector and a noise coupling matrix. The noise covariance is G.q.G’.

Fields§

§q: OVector<N, QD>

Noise variance

§G: OMatrix<N, D, QD>

Noise coupling

Implementations§

source§

impl<N: Copy + RealField, D: Dim> CoupledNoise<N, D, D>
where DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>,

source

pub fn from_uncorrelated(uncorrelated: UncorrelatedNoise<N, D>) -> Self

Creates a CoupledNoise from an UncorrelatedNoise. The resulting ‘G’ is an identity matrix.

source

pub fn from_correlated( correlated: &CorrelatedNoise<N, D> ) -> Result<Self, &'static str>

Creates a CoupledNoise from the Cholesky factor of a CorrelatedNoise. The CorrelatedNoise must be PSD. The resulting ‘q’ is always a vector of 1s.

Auto Trait Implementations§

§

impl<N, D, QD> !RefUnwindSafe for CoupledNoise<N, D, QD>

§

impl<N, D, QD> !Send for CoupledNoise<N, D, QD>

§

impl<N, D, QD> !Sync for CoupledNoise<N, D, QD>

§

impl<N, D, QD> !Unpin for CoupledNoise<N, D, QD>

§

impl<N, D, QD> !UnwindSafe for CoupledNoise<N, D, QD>

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V