Struct ndarray_linalg::solveh::FactorizedH

pub struct FactorizedH<S: Data> {
    pub a: ArrayBase<S, Ix2>,
    pub ipiv: Pivot,
}

Represents the Bunch–Kaufman factorization of a Hermitian (or real symmetric) matrix as A = P * U * D * U^H * P^T.

Fields

a: ArrayBase<S, Ix2>

ipiv: Pivot

Methods

impl<A, S> FactorizedH<S> where
    A: Scalar,
    S: DataMut<Elem = A>, 

fn into_inverseh(self) -> Result<ArrayBase<S, Ix2>>

Computes the inverse of the factorized matrix.

Warning: The inverse is stored only in the upper triangular portion of the result matrix! If you want the lower triangular portion to be correct, you must fill it in according to the results in the upper triangular portion.

Trait Implementations

impl<A, S> SolveH<A> for FactorizedH<S> where
    A: Scalar,
    S: Data<Elem = A>, 

fn solveh_mut<'a, Sb>(
    &self,
    rhs: &'a mut ArrayBase<Sb, Ix1>
) -> Result<&'a mut ArrayBase<Sb, Ix1>> where
    Sb: DataMut<Elem = A>, 

Solves a system of linear equations A * x = b with Hermitian (or real symmetric) matrix A, where A is self, b is the argument, and x is the successful result. The value of x is also assigned to the argument.

fn solveh<S: Data<Elem = A>>(&self, b: &ArrayBase<S, Ix1>) -> Result<Array1<A>>

Solves a system of linear equations A * x = b with Hermitian (or real symmetric) matrix A, where A is self, b is the argument, and x is the successful result.

fn solveh_into<S: DataMut<Elem = A>>(
    &self,
    b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>

Solves a system of linear equations A * x = b with Hermitian (or real symmetric) matrix A, where A is self, b is the argument, and x is the successful result.