pub struct Householder<A: Scalar> { /* private fields */ }
Expand description
Iterative orthogonalizer using Householder reflection
Implementations§
source§impl<A: Scalar + Lapack> Householder<A>
impl<A: Scalar + Lapack> Householder<A>
sourcepub fn forward_reflection<S>(&self, a: &mut ArrayBase<S, Ix1>)where
S: DataMut<Elem = A>,
pub fn forward_reflection<S>(&self, a: &mut ArrayBase<S, Ix1>)where
S: DataMut<Elem = A>,
Take forward reflection P = P_l ... P_1
sourcepub fn backward_reflection<S>(&self, a: &mut ArrayBase<S, Ix1>)where
S: DataMut<Elem = A>,
pub fn backward_reflection<S>(&self, a: &mut ArrayBase<S, Ix1>)where
S: DataMut<Elem = A>,
Take backward reflection P = P_1 ... P_l
Trait Implementations§
source§impl<A: Clone + Scalar> Clone for Householder<A>
impl<A: Clone + Scalar> Clone for Householder<A>
source§fn clone(&self) -> Householder<A>
fn clone(&self) -> Householder<A>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<A: Scalar + Lapack> Orthogonalizer for Householder<A>
impl<A: Scalar + Lapack> Orthogonalizer for Householder<A>
type Elem = A
fn tolerance(&self) -> A::Real
source§fn decompose<S>(&self, a: &mut ArrayBase<S, Ix1>) -> Array1<A>where
S: DataMut<Elem = A>,
fn decompose<S>(&self, a: &mut ArrayBase<S, Ix1>) -> Array1<A>where
S: DataMut<Elem = A>,
Decompose given vector into the span of current basis and
its tangent space Read more
source§fn coeff<S>(&self, a: ArrayBase<S, Ix1>) -> Array1<A>where
S: Data<Elem = A>,
fn coeff<S>(&self, a: ArrayBase<S, Ix1>) -> Array1<A>where
S: Data<Elem = A>,
Calculate the coefficient to the current basis basis Read more
source§fn div_append<S>(&mut self, a: &mut ArrayBase<S, Ix1>) -> AppendResult<A>where
S: DataMut<Elem = A>,
fn div_append<S>(&mut self, a: &mut ArrayBase<S, Ix1>) -> AppendResult<A>where
S: DataMut<Elem = A>,
Add new vector if the residual is larger than relative tolerance,
and return the residual vector
source§fn append<S>(&mut self, a: ArrayBase<S, Ix1>) -> AppendResult<A>where
S: Data<Elem = A>,
fn append<S>(&mut self, a: ArrayBase<S, Ix1>) -> AppendResult<A>where
S: Data<Elem = A>,
Add new vector if the residual is larger than relative tolerance
fn is_empty(&self) -> bool
Auto Trait Implementations§
impl<A> Freeze for Householder<A>
impl<A> RefUnwindSafe for Householder<A>
impl<A> Send for Householder<A>
impl<A> Sync for Householder<A>
impl<A> Unpin for Householder<A>
impl<A> UnwindSafe for Householder<A>
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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)