pub struct Cholesky<I, E>{
symbolic: SymbolicCholesky<I>,
values: VecGroup<E>,
}
Expand description
Sparse Cholesky factorization.
Fields§
§symbolic: SymbolicCholesky<I>
§values: VecGroup<E>
Implementations§
§impl<I, E> Cholesky<I, E>where
I: Index,
E: ComplexField,
impl<I, E> Cholesky<I, E>where
I: Index,
E: ComplexField,
pub fn try_new_with_symbolic(
symbolic: SymbolicCholesky<I>,
mat: SparseColMatRef<'_, I, E>,
side: Side,
) -> Result<Cholesky<I, E>, CholeskyError>
pub fn try_new_with_symbolic( symbolic: SymbolicCholesky<I>, mat: SparseColMatRef<'_, I, E>, side: Side, ) -> Result<Cholesky<I, E>, CholeskyError>
Returns the Cholesky factorization of the input matrix with the same sparsity pattern as the original one used to construct the symbolic factorization.
Only the provided side is accessed.
Trait Implementations§
Auto Trait Implementations§
impl<I, E> Freeze for Cholesky<I, E>
impl<I, E> RefUnwindSafe for Cholesky<I, E>where
<<E as Entity>::Group as ForType>::FaerOf<Vec<<E as Entity>::Unit>>: RefUnwindSafe,
I: RefUnwindSafe,
impl<I, E> Send for Cholesky<I, E>
impl<I, E> Sync for Cholesky<I, E>
impl<I, E> Unpin for Cholesky<I, E>
impl<I, E> UnwindSafe for Cholesky<I, E>where
<<E as Entity>::Group as ForType>::FaerOf<Vec<<E as Entity>::Unit>>: UnwindSafe,
I: RefUnwindSafe,
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)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.