pub struct LdlSymbolic<I> { /* private fields */ }
Expand description
Structure to compute and hold a symbolic LDLT decomposition
Implementations§
Source§impl<I: SpIndex> LdlSymbolic<I>
impl<I: SpIndex> LdlSymbolic<I>
Sourcepub fn new<N>(mat: CsMatViewI<'_, N, I>) -> Self
pub fn new<N>(mat: CsMatViewI<'_, N, I>) -> Self
Sourcepub fn new_perm<N>(
mat: CsMatViewI<'_, N, I>,
perm: PermOwnedI<I>,
check_symmetry: SymmetryCheck,
) -> Self
pub fn new_perm<N>( mat: CsMatViewI<'_, N, I>, perm: PermOwnedI<I>, check_symmetry: SymmetryCheck, ) -> Self
Compute the symbolic decomposition L D L^T = P A P^T where P is a permutation matrix.
Using a good permutation matrix can reduce the non-zero count in L, thus making the decomposition and the solves faster.
§Panics
- if mat is not symmetric
Sourcepub fn problem_size(&self) -> usize
pub fn problem_size(&self) -> usize
The size of the linear system associated with this decomposition
Sourcepub fn factor<N>(
self,
mat: CsMatViewI<'_, N, I>,
) -> Result<LdlNumeric<N, I>, LinalgError>
pub fn factor<N>( self, mat: CsMatViewI<'_, N, I>, ) -> Result<LdlNumeric<N, I>, LinalgError>
Compute the numerical decomposition of the given matrix.
Trait Implementations§
Source§impl<I: Clone> Clone for LdlSymbolic<I>
impl<I: Clone> Clone for LdlSymbolic<I>
Source§fn clone(&self) -> LdlSymbolic<I>
fn clone(&self) -> LdlSymbolic<I>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreAuto Trait Implementations§
impl<I> Freeze for LdlSymbolic<I>
impl<I> RefUnwindSafe for LdlSymbolic<I>where
I: RefUnwindSafe,
impl<I> Send for LdlSymbolic<I>where
I: Send,
impl<I> Sync for LdlSymbolic<I>where
I: Sync,
impl<I> Unpin for LdlSymbolic<I>where
I: Unpin,
impl<I> UnwindSafe for LdlSymbolic<I>where
I: 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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).Source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.