[−][src]Struct ndarray_linalg::cholesky::CholeskyFactorized
Cholesky decomposition of Hermitian (or real symmetric) positive definite matrix
Fields
factor: ArrayBase<S, Ix2>L from the decomposition A = L * L^H or U from the decomposition
A = U^H * U.
uplo: UPLOIf this is UPLO::Lower, then self.factor is L. If this is
UPLO::Upper, then self.factor is U.
Implementations
impl<A, S> CholeskyFactorized<S> where
A: Scalar + Lapack,
S: DataMut<Elem = A>, [src]
A: Scalar + Lapack,
S: DataMut<Elem = A>,
pub fn into_lower(self) -> ArrayBase<S, Ix2>[src]
Returns L from the Cholesky decomposition A = L * L^H.
If self.uplo == UPLO::Lower, then no computations need to be
performed; otherwise, the conjugate transpose of self.factor is
calculated.
pub fn into_upper(self) -> ArrayBase<S, Ix2>[src]
Returns U from the Cholesky decomposition A = U^H * U.
If self.uplo == UPLO::Upper, then no computations need to be
performed; otherwise, the conjugate transpose of self.factor is
calculated.
Trait Implementations
impl<A, S> DeterminantC for CholeskyFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A>, [src]
A: Scalar + Lapack,
S: Data<Elem = A>,
type Output = <A as Scalar>::Real
fn detc(&self) -> Self::Output[src]
fn ln_detc(&self) -> Self::Output[src]
impl<A, S> DeterminantCInto for CholeskyFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A>, [src]
A: Scalar + Lapack,
S: Data<Elem = A>,
type Output = <A as Scalar>::Real
fn detc_into(self) -> Self::Output[src]
fn ln_detc_into(self) -> Self::Output[src]
impl<A, S> InverseC for CholeskyFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A>, [src]
A: Scalar + Lapack,
S: Data<Elem = A>,
impl<A, S> InverseCInto for CholeskyFactorized<S> where
A: Scalar + Lapack,
S: DataMut<Elem = A>, [src]
A: Scalar + Lapack,
S: DataMut<Elem = A>,
impl<A, S> SolveC<A> for CholeskyFactorized<S> where
A: Scalar + Lapack,
S: Data<Elem = A>, [src]
A: Scalar + Lapack,
S: Data<Elem = A>,
fn solvec_inplace<'a, Sb>(
&self,
b: &'a mut ArrayBase<Sb, Ix1>
) -> Result<&'a mut ArrayBase<Sb, Ix1>> where
Sb: DataMut<Elem = A>, [src]
&self,
b: &'a mut ArrayBase<Sb, Ix1>
) -> Result<&'a mut ArrayBase<Sb, Ix1>> where
Sb: DataMut<Elem = A>,
fn solvec<S: Data<Elem = A>>(&self, b: &ArrayBase<S, Ix1>) -> Result<Array1<A>>[src]
fn solvec_into<S: DataMut<Elem = A>>(
&self,
b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>[src]
&self,
b: ArrayBase<S, Ix1>
) -> Result<ArrayBase<S, Ix1>>
Auto Trait Implementations
impl<S> RefUnwindSafe for CholeskyFactorized<S> where
S: RefUnwindSafe,
<S as RawData>::Elem: RefUnwindSafe,
S: RefUnwindSafe,
<S as RawData>::Elem: RefUnwindSafe,
impl<S> Send for CholeskyFactorized<S> where
S: Send,
S: Send,
impl<S> Sync for CholeskyFactorized<S> where
S: Sync,
S: Sync,
impl<S> Unpin for CholeskyFactorized<S> where
S: Unpin,
S: Unpin,
impl<S> UnwindSafe for CholeskyFactorized<S> where
S: UnwindSafe,
<S as RawData>::Elem: RefUnwindSafe,
S: UnwindSafe,
<S as RawData>::Elem: RefUnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T, U> TryFrom<U> 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, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,