Struct extendr_api::prelude::sparse::solvers::Cholesky
pub struct Cholesky<E>where
E: Entity,{
factors: Mat<E>,
}
Expand description
Cholesky decomposition.
Fields§
§factors: Mat<E>
Implementations§
§impl<E> Cholesky<E>where
E: ComplexField,
impl<E> Cholesky<E>where
E: ComplexField,
pub fn try_new<ViewE>(
matrix: MatRef<'_, ViewE>,
side: Side,
) -> Result<Cholesky<E>, CholeskyError>where
ViewE: Conjugate<Canonical = E>,
pub fn try_new<ViewE>(
matrix: MatRef<'_, ViewE>,
side: Side,
) -> Result<Cholesky<E>, CholeskyError>where
ViewE: Conjugate<Canonical = E>,
Returns the Cholesky factorization of the input matrix, or an error if the matrix is not positive definite.
The factorization is such that $A = LL^H$, where $L$ is lower triangular.
The matrix is interpreted as Hermitian, but only the provided side is accessed.
Trait Implementations§
§impl<E> SolverCore<E> for Cholesky<E>where
E: ComplexField,
impl<E> SolverCore<E> for Cholesky<E>where
E: ComplexField,
§impl<E> SpSolverCore<E> for Cholesky<E>where
E: ComplexField,
impl<E> SpSolverCore<E> for Cholesky<E>where
E: ComplexField,
Auto Trait Implementations§
impl<E> Freeze for Cholesky<E>
impl<E> RefUnwindSafe for Cholesky<E>where
<<E as Entity>::Group as ForCopyType>::FaerOfCopy<NonNull<<E as Entity>::Unit>>: RefUnwindSafe,
E: RefUnwindSafe,
impl<E> Send for Cholesky<E>
impl<E> Sync for Cholesky<E>
impl<E> Unpin for Cholesky<E>
impl<E> UnwindSafe for Cholesky<E>where
<<E as Entity>::Group as ForCopyType>::FaerOfCopy<NonNull<<E as Entity>::Unit>>: UnwindSafe,
E: 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
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<E, Dec> SpSolver<E> for Dec
impl<E, Dec> SpSolver<E> for Dec
§fn solve_in_place(&self, rhs: impl ColBatchMut<E>)
fn solve_in_place(&self, rhs: impl ColBatchMut<E>)
Solves the equation
self * X = rhs
, and stores the result in rhs
.§fn solve_conj_in_place(&self, rhs: impl ColBatchMut<E>)
fn solve_conj_in_place(&self, rhs: impl ColBatchMut<E>)
Solves the equation
conjugate(self) * X = rhs
, and stores the result in rhs
.§fn solve_transpose_in_place(&self, rhs: impl ColBatchMut<E>)
fn solve_transpose_in_place(&self, rhs: impl ColBatchMut<E>)
Solves the equation
transpose(self) * X = rhs
, and stores the result in rhs
.§fn solve_conj_transpose_in_place(&self, rhs: impl ColBatchMut<E>)
fn solve_conj_transpose_in_place(&self, rhs: impl ColBatchMut<E>)
Solves the equation
adjoint(self) * X = rhs
, and stores the result in rhs
.§fn solve<ViewE, B>(&self, rhs: B) -> <B as ColBatch<ViewE>>::Owned
fn solve<ViewE, B>(&self, rhs: B) -> <B as ColBatch<ViewE>>::Owned
Solves the equation
self * X = rhs
, and returns the result.§fn solve_conj<ViewE, B>(&self, rhs: B) -> <B as ColBatch<ViewE>>::Owned
fn solve_conj<ViewE, B>(&self, rhs: B) -> <B as ColBatch<ViewE>>::Owned
Solves the equation
conjugate(self) * X = rhs
, and returns the result.§fn solve_transpose<ViewE, B>(&self, rhs: B) -> <B as ColBatch<ViewE>>::Owned
fn solve_transpose<ViewE, B>(&self, rhs: B) -> <B as ColBatch<ViewE>>::Owned
Solves the equation
transpose(self) * X = rhs
, and returns the result.