pub trait QRTraits {
    type A: Scalar;

Show 16 methods fn column_id(&self) -> Result<ColumnID<Self::A>>; fn compute_from(arr: ArrayView2<'_, Self::A>) -> Result<QR<Self::A>>; fn compute_from_range_estimate<Op: ConjMatMat<A = Self::A>>(
        range: ArrayView2<'_, Self::A>,
        op: &Op
    ) -> Result<QR<Self::A>>; fn get_q(&self) -> ArrayView2<'_, Self::A>; fn get_r(&self) -> ArrayView2<'_, Self::A>; fn get_ind(&self) -> ArrayView1<'_, usize>; fn get_q_mut(&mut self) -> ArrayViewMut2<'_, Self::A>; fn get_r_mut(&mut self) -> ArrayViewMut2<'_, Self::A>; fn get_ind_mut(&mut self) -> ArrayViewMut1<'_, usize>; fn nrows(&self) -> usize { ... } fn ncols(&self) -> usize { ... } fn rank(&self) -> usize { ... } fn to_mat(&self) -> Array2<Self::A> { ... } fn compress_qr_rank(&self, max_rank: usize) -> Result<QR<Self::A>> { ... } fn compress_qr_tolerance(&self, tol: f64) -> Result<QR<Self::A>> { ... } fn compress(&self, compression_type: CompressionType) -> Result<QR<Self::A>> { ... }
}

Required Associated Types

Required Methods

Compute a column interpolative decomposition from the QR decomposition

Compute the QR decomposition from a given array

Compute a QR decomposition from a range estimate

Arguments
  • range: A matrix with orthogonal columns that approximates the range of the operator.
  • op: The underlying operator.

Return the Q matrix

Return the R matrix

Return the index vector

Provided Methods

Number of rows

Number of columns

Rank of the QR Decomposition

Convert the QR decomposition to a matrix

Compress by giving a target rank

Compress by specifying a relative tolerance

Compress the QR decomposition by rank or tolerance

Implementors