pub struct Ic0<F> { /* private fields */ }Expand description
IC(0) preconditioner: Incomplete Cholesky factorization with zero fill-in.
For symmetric positive definite (SPD) matrices. Computes a lower triangular matrix L such that A ~ L * L^T, retaining only the sparsity pattern of the lower triangle of A.
Implementations§
Source§impl<F> Ic0<F>
impl<F> Ic0<F>
Sourcepub fn new(matrix: &CsrMatrix<F>) -> SparseResult<Self>
pub fn new(matrix: &CsrMatrix<F>) -> SparseResult<Self>
Construct an IC(0) preconditioner from an SPD CSR matrix.
Only the lower triangular part (including diagonal) is used.
§Errors
Returns an error if the matrix is not square, or if the factorization encounters a non-positive pivot (matrix is not SPD).
Trait Implementations§
Source§impl<F> Preconditioner<F> for Ic0<F>
impl<F> Preconditioner<F> for Ic0<F>
Auto Trait Implementations§
impl<F> Freeze for Ic0<F>
impl<F> RefUnwindSafe for Ic0<F>where
F: RefUnwindSafe,
impl<F> Send for Ic0<F>where
F: Send,
impl<F> Sync for Ic0<F>where
F: Sync,
impl<F> Unpin for Ic0<F>where
F: Unpin,
impl<F> UnsafeUnpin for Ic0<F>
impl<F> UnwindSafe for Ic0<F>where
F: 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