pub struct CholeskyDecomposition<T> { /* private fields */ }Expand description
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.
Implementations§
Auto Trait Implementations§
impl<T> Freeze for CholeskyDecomposition<T>
impl<T> RefUnwindSafe for CholeskyDecomposition<T>where
T: RefUnwindSafe,
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,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more