Struct rusty_compression::qr::LQ
source · [−]Fields
l: Array2<A>
The Q matrix from the LQ Decomposition
q: Array2<A>
The Q matrix from the LQ Decomposition
ind: Array1<usize>
An index array. If ind[j] = k then the jth row of L * Q is identical to the kth row of the original matrix A.
Trait Implementations
sourceimpl LQTraits for LQ<f32>
impl LQTraits for LQ<f32>
type A = f32
sourcefn get_q(&self) -> ArrayView2<'_, Self::A>
fn get_q(&self) -> ArrayView2<'_, Self::A>
Return the Q matrix
sourcefn get_l(&self) -> ArrayView2<'_, Self::A>
fn get_l(&self) -> ArrayView2<'_, Self::A>
Return the L matrix
sourcefn get_ind(&self) -> ArrayView1<'_, usize>
fn get_ind(&self) -> ArrayView1<'_, usize>
Return the index vector
fn get_q_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_l_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_ind_mut(&mut self) -> ArrayViewMut1<'_, usize>
sourcefn compute_from(arr: ArrayView2<'_, Self::A>) -> Result<LQ<Self::A>>
fn compute_from(arr: ArrayView2<'_, Self::A>) -> Result<LQ<Self::A>>
Compute the LQ decomposition from a given array
sourcefn row_id(&self) -> Result<RowID<Self::A>>
fn row_id(&self) -> Result<RowID<Self::A>>
Compute a row interpolative decomposition from the LQ decomposition
sourcefn compress_lq_rank(&self, max_rank: usize) -> Result<LQ<Self::A>>
fn compress_lq_rank(&self, max_rank: usize) -> Result<LQ<Self::A>>
Compress by giving a target rank
sourceimpl LQTraits for LQ<f64>
impl LQTraits for LQ<f64>
type A = f64
sourcefn get_q(&self) -> ArrayView2<'_, Self::A>
fn get_q(&self) -> ArrayView2<'_, Self::A>
Return the Q matrix
sourcefn get_l(&self) -> ArrayView2<'_, Self::A>
fn get_l(&self) -> ArrayView2<'_, Self::A>
Return the L matrix
sourcefn get_ind(&self) -> ArrayView1<'_, usize>
fn get_ind(&self) -> ArrayView1<'_, usize>
Return the index vector
fn get_q_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_l_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_ind_mut(&mut self) -> ArrayViewMut1<'_, usize>
sourcefn compute_from(arr: ArrayView2<'_, Self::A>) -> Result<LQ<Self::A>>
fn compute_from(arr: ArrayView2<'_, Self::A>) -> Result<LQ<Self::A>>
Compute the LQ decomposition from a given array
sourcefn row_id(&self) -> Result<RowID<Self::A>>
fn row_id(&self) -> Result<RowID<Self::A>>
Compute a row interpolative decomposition from the LQ decomposition
sourcefn compress_lq_rank(&self, max_rank: usize) -> Result<LQ<Self::A>>
fn compress_lq_rank(&self, max_rank: usize) -> Result<LQ<Self::A>>
Compress by giving a target rank
sourceimpl LQTraits for LQ<c32>
impl LQTraits for LQ<c32>
type A = Complex<f32>
sourcefn get_q(&self) -> ArrayView2<'_, Self::A>
fn get_q(&self) -> ArrayView2<'_, Self::A>
Return the Q matrix
sourcefn get_l(&self) -> ArrayView2<'_, Self::A>
fn get_l(&self) -> ArrayView2<'_, Self::A>
Return the L matrix
sourcefn get_ind(&self) -> ArrayView1<'_, usize>
fn get_ind(&self) -> ArrayView1<'_, usize>
Return the index vector
fn get_q_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_l_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_ind_mut(&mut self) -> ArrayViewMut1<'_, usize>
sourcefn compute_from(arr: ArrayView2<'_, Self::A>) -> Result<LQ<Self::A>>
fn compute_from(arr: ArrayView2<'_, Self::A>) -> Result<LQ<Self::A>>
Compute the LQ decomposition from a given array
sourcefn row_id(&self) -> Result<RowID<Self::A>>
fn row_id(&self) -> Result<RowID<Self::A>>
Compute a row interpolative decomposition from the LQ decomposition
sourcefn compress_lq_rank(&self, max_rank: usize) -> Result<LQ<Self::A>>
fn compress_lq_rank(&self, max_rank: usize) -> Result<LQ<Self::A>>
Compress by giving a target rank
sourceimpl LQTraits for LQ<c64>
impl LQTraits for LQ<c64>
type A = Complex<f64>
sourcefn get_q(&self) -> ArrayView2<'_, Self::A>
fn get_q(&self) -> ArrayView2<'_, Self::A>
Return the Q matrix
sourcefn get_l(&self) -> ArrayView2<'_, Self::A>
fn get_l(&self) -> ArrayView2<'_, Self::A>
Return the L matrix
sourcefn get_ind(&self) -> ArrayView1<'_, usize>
fn get_ind(&self) -> ArrayView1<'_, usize>
Return the index vector
fn get_q_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_l_mut(&mut self) -> ArrayViewMut2<'_, Self::A>
fn get_ind_mut(&mut self) -> ArrayViewMut1<'_, usize>
sourcefn compute_from(arr: ArrayView2<'_, Self::A>) -> Result<LQ<Self::A>>
fn compute_from(arr: ArrayView2<'_, Self::A>) -> Result<LQ<Self::A>>
Compute the LQ decomposition from a given array
sourcefn row_id(&self) -> Result<RowID<Self::A>>
fn row_id(&self) -> Result<RowID<Self::A>>
Compute a row interpolative decomposition from the LQ decomposition
sourcefn compress_lq_rank(&self, max_rank: usize) -> Result<LQ<Self::A>>
fn compress_lq_rank(&self, max_rank: usize) -> Result<LQ<Self::A>>
Compress by giving a target rank
Auto Trait Implementations
impl<A> RefUnwindSafe for LQ<A> where
A: RefUnwindSafe,
impl<A> Send for LQ<A> where
A: Send,
impl<A> Sync for LQ<A> where
A: Sync,
impl<A> Unpin for LQ<A>
impl<A> UnwindSafe for LQ<A> where
A: RefUnwindSafe,
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