Struct ForrestTomlin 

pub struct ForrestTomlin<T: Real> { /* private fields */ }

Forrest & Tomlin (1972): row etas and a permuted, modified U (Algorithm U).

Trait Implementations

impl<T: Real> BasisUpdate<T> for ForrestTomlin<T>

fn update( &mut self, f: &mut Factors<T>, opts: &LuOptions, r: usize, alpha_r: T, ) -> Result<UpdateOutcome, LuError>

Algorithm U. Errors: LuError::Singular if the new basis is singular, LuError::NoSpike without a recorded spike, LuError::NotFactorized on an invalid factor, LuError::Structure if r ≥ m. On every error, and on RefactorReason::Unstable, the factor is left unchanged.

fn apply_ftran(&self, y: &mut [T])

Step F2.

fn apply_btran(&self, w: &mut [T])

Step B2.

fn apply_ftran_hyper( &self, y: &mut [T], list: &mut Vec<u32>, mark: &mut [u32], stamp: u32, queued: &mut [bool], )

Step HF4: the row etas in creation order through a min-queue.

fn apply_btran_hyper( &self, w: &mut [T], list: &mut Vec<u32>, mark: &mut [u32], stamp: u32, queued: &mut [bool], )

Step HB4: the row etas in reverse creation order through a max-queue.

fn reset(&mut self, m: usize, update_growth: f64)

Forgets every update: called after each factorization of an m × m basis, with the update growth of the fresh factors (0 after a failed factorization).

fn stats(&self) -> &UpdateStats

The counters since the last factorization.

fn name(&self) -> &'static str

A short name for logs ("forrest-tomlin").

impl<T: Clone + Real> Clone for ForrestTomlin<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug + Real> Debug for ForrestTomlin<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Real> Default for ForrestTomlin<T>

fn default() -> Self

Returns the “default value” for a type.