Struct extendr_api::prelude::sparse::solvers::Qr

pub struct Qr<E>
where
    E: Entity,
{
    pub(crate) factors: Mat<E>,
    householder: Mat<E>,
}

QR decomposition.

Fields

factors: Mat<E>

householder: Mat<E>

Implementations

impl<E> Qr<E>

where E: ComplexField,

pub fn new<ViewE>(matrix: MatRef<'_, ViewE>) -> Qr<E>

where ViewE: Conjugate<Canonical = E>,

Returns the QR decomposition of the input matrix without pivoting.

The factorization is such that $A = QR$, where $R$ is upper trapezoidal and $Q$ is unitary.

pub fn compute_r(&self) -> Mat<E>

Returns the factor $R$ of the QR decomposition.

pub fn compute_q(&self) -> Mat<E>

Returns the factor $Q$ of the QR decomposition.

pub fn compute_thin_r(&self) -> Mat<E>

Returns the top $r$ rows of the factor $R$ of the QR decomposition, where $r = \min(\text{nrows}(A), \text{ncols}(A))$.

pub fn compute_thin_q(&self) -> Mat<E>

Returns the leftmost $r$ columns of the factor $Q$ of the QR decomposition, where $r = \min(\text{nrows}(A), \text{ncols}(A))$.

Trait Implementations

impl<E> Debug for Qr<E>

where E: Debug + Entity,

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

Formats the value using the given formatter.

impl<E> SolverCore<E> for Qr<E>

where E: ComplexField,

fn reconstruct(&self) -> Mat<E>

Reconstructs the original matrix using the decomposition.

fn inverse(&self) -> Mat<E>

Computes the inverse of the original matrix using the decomposition.

impl<E> SpSolverCore<E> for Qr<E>

where E: ComplexField,

fn nrows(&self) -> usize

Returns the number of rows of the matrix used to construct this decomposition.

fn ncols(&self) -> usize

Returns the number of columns of the matrix used to construct this decomposition.

impl<E> SolverLstsqCore<E> for Qr<E>

where E: ComplexField,

impl<E> SpSolverLstsqCore<E> for Qr<E>

where E: ComplexField,