[][src]Struct la::CholeskyDecomposition

pub struct CholeskyDecomposition<T> { /* fields omitted */ }

Cholesky Decomposition (for a real valued matrix).

Initial implementation based on JAMA.

For a symmetric, positive definite matrix A, the Cholesky decomposition is an lower triangular matrix L so that A = L*L'.

If the matrix is not symmetric or positive definite, None is returned.

Methods

impl<T: Float + ApproxEq<T>> CholeskyDecomposition<T>[src]

pub fn new(m: &Matrix<T>) -> Option<CholeskyDecomposition<T>>[src]

pub fn get_l<'lt>(&'lt self) -> &'lt Matrix<T>[src]

pub fn solve(&self, b: &Matrix<T>) -> Matrix<T>[src]

Auto Trait Implementations

impl<T> Send for CholeskyDecomposition<T> where
    T: Send

impl<T> Sync for CholeskyDecomposition<T> where
    T: Sync

impl<T> Unpin for CholeskyDecomposition<T> where
    T: Unpin

impl<T> UnwindSafe for CholeskyDecomposition<T> where
    T: UnwindSafe

impl<T> RefUnwindSafe for CholeskyDecomposition<T> where
    T: RefUnwindSafe

Blanket Implementations

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> From<T> for T[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> Any for T where
    T: 'static + ?Sized
[src]