Struct recless::Rls [] [src]

pub struct Rls<F> { /* fields omitted */ }

The parameters of recursive least squares algorithm.

This struct contains all parameters involved in a recursive least squares algorithm with exponential forgetting. For a review see [Haykin's Adaptive Filter Theory][http://www.isbnsearch.org/isbn/9780132671453]. The implementation here does not implicitly take time into account. By making a choice of the forgetting factor λ < 1 and shifting down old values of the input vector manually, the user can get this algorithm to behave accordingly.

Methods

impl<F: NdFloat> Rls<F>
[src]

Constructs a new Rls object with initialization factor δ and a weight vector of length n.

Constructs a new Rls object with initialization factor δ and pre-defined weight w.

impl Rls<f32>
[src]

Performs a recursive update of inverse correlation matrix and weight vector.

impl Rls<f64>
[src]

Performs a recursive update of inverse correlation matrix and weight vector.

impl<T> Rls<T>
[src]

Returns a reference to the gain vector.

Returns a reference to the inverse correlation matrix.

Returns a reference to the inverse forgetting factor.

Returns a reference to the (tap) weight vector.

Returns a refernce to the prior error.

Trait Implementations

impl<F: Clone> Clone for Rls<F>
[src]

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

impl<F: Debug> Debug for Rls<F>
[src]

Formats the value using the given formatter.