Struct linfa_linalg::bidiagonal::BidiagonalDecomp
source · [−]pub struct BidiagonalDecomp<A, S: DataMut<Elem = A>> { /* private fields */ }
Expand description
Full bidiagonal decomposition
Implementations
sourceimpl<A: NdFloat, S: DataMut<Elem = A>> BidiagonalDecomp<A, S>
impl<A: NdFloat, S: DataMut<Elem = A>> BidiagonalDecomp<A, S>
sourcepub fn is_upper_diag(&self) -> bool
pub fn is_upper_diag(&self) -> bool
Whether B
is upper-bidiagonal or not
sourcepub fn generate_u(&self) -> Array2<A>
pub fn generate_u(&self) -> Array2<A>
Generates U
matrix, which is R x min(R, C), where R and C are dimensions of the original
matrix
sourcepub fn generate_vt(&self) -> Array2<A>
pub fn generate_vt(&self) -> Array2<A>
Generates Vt
matrix, which is min(R, C) x C, where R and C are dimensions of the original
matrix
Trait Implementations
sourceimpl<A: Clone, S: DataMut<Elem = A> + RawDataClone> Clone for BidiagonalDecomp<A, S>
impl<A: Clone, S: DataMut<Elem = A> + RawDataClone> Clone for BidiagonalDecomp<A, S>
Auto Trait Implementations
impl<A, S> RefUnwindSafe for BidiagonalDecomp<A, S> where
A: RefUnwindSafe,
S: RefUnwindSafe,
impl<A, S> Send for BidiagonalDecomp<A, S> where
A: Send,
S: Send,
impl<A, S> Sync for BidiagonalDecomp<A, S> where
A: Sync,
S: Sync,
impl<A, S> Unpin for BidiagonalDecomp<A, S> where
S: Unpin,
impl<A, S> UnwindSafe for BidiagonalDecomp<A, S> where
A: RefUnwindSafe,
S: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more