[−][src]Struct nalgebra_lapack::Cholesky
The cholesky decomposition of a symmetric-definite-positive matrix.
Methods
impl<N: CholeskyScalar + Zero, D: Dim> Cholesky<N, D> where
DefaultAllocator: Allocator<N, D, D>,
[src]
DefaultAllocator: Allocator<N, D, D>,
pub fn new(m: MatrixN<N, D>) -> Option<Self>
[src]
Computes the cholesky decomposition of the given symmetric-definite-positive square matrix.
Only the lower-triangular part of the input matrix is considered.
pub fn unpack(self) -> MatrixN<N, D>
[src]
Retrieves the lower-triangular factor of the cholesky decomposition.
pub fn unpack_dirty(self) -> MatrixN<N, D>
[src]
Retrieves the lower-triangular factor of che cholesky decomposition, without zeroing-out its strict upper-triangular part.
This is an allocation-less version of self.l()
. The values of the strict upper-triangular
part are garbage and should be ignored by further computations.
pub fn l(&self) -> MatrixN<N, D>
[src]
Retrieves the lower-triangular factor of the cholesky decomposition.
pub fn l_dirty(&self) -> &MatrixN<N, D>
[src]
Retrieves the lower-triangular factor of the cholesky decomposition, without zeroing-out its strict upper-triangular part.
This is an allocation-less version of self.l()
. The values of the strict upper-triangular
part are garbage and should be ignored by further computations.
pub fn solve<R2: Dim, C2: Dim, S2>(
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<MatrixMN<N, R2, C2>> where
S2: Storage<N, R2, C2>,
DefaultAllocator: Allocator<N, R2, C2>,
[src]
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<MatrixMN<N, R2, C2>> where
S2: Storage<N, R2, C2>,
DefaultAllocator: Allocator<N, R2, C2>,
Solves the symmetric-definite-positive linear system self * x = b
, where x
is the
unknown to be determined.
pub fn solve_mut<R2: Dim, C2: Dim>(&self, b: &mut MatrixMN<N, R2, C2>) -> bool where
DefaultAllocator: Allocator<N, R2, C2>,
[src]
DefaultAllocator: Allocator<N, R2, C2>,
Solves in-place the symmetric-definite-positive linear system self * x = b
, where x
is
the unknown to be determined.
pub fn inverse(self) -> Option<MatrixN<N, D>>
[src]
Computes the inverse of the decomposed matrix.
Trait Implementations
impl<N: Scalar, D: Dim> Copy for Cholesky<N, D> where
DefaultAllocator: Allocator<N, D, D>,
MatrixN<N, D>: Copy,
[src]
DefaultAllocator: Allocator<N, D, D>,
MatrixN<N, D>: Copy,
impl<N: Clone + Scalar, D: Clone + Dim> Clone for Cholesky<N, D> where
DefaultAllocator: Allocator<N, D, D>,
[src]
DefaultAllocator: Allocator<N, D, D>,
fn clone(&self) -> Cholesky<N, D>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<N: Debug + Scalar, D: Debug + Dim> Debug for Cholesky<N, D> where
DefaultAllocator: Allocator<N, D, D>,
[src]
DefaultAllocator: Allocator<N, D, D>,
Auto Trait Implementations
Blanket Implementations
impl<T, U> Into for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
impl<T> From for T
[src]
impl<T, U> TryFrom for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T> Borrow for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> BorrowMut for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<SS, SP> SupersetOf for SP where
SS: SubsetOf<SP>,
[src]
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
[src]
fn is_in_subset(&self) -> bool
[src]
unsafe fn to_subset_unchecked(&self) -> SS
[src]
fn from_subset(element: &SS) -> SP
[src]
impl<T> Same for T
type Output = T
Should always be Self