pub struct SparseFactorization(/* private fields */);Expand description
An LU factorization held independently of the matrix it was formed
from — cached across Newton iterations by TangentStrategy:: ReuseAtStepStart/Initial so re-solving against the same tangent
doesn’t re-factor it (docs/algorithms.md §3.1’s real prerequisite for
those strategies to actually save anything).
Implementations§
Auto Trait Implementations§
impl Freeze for SparseFactorization
impl RefUnwindSafe for SparseFactorization
impl Send for SparseFactorization
impl Sync for SparseFactorization
impl Unpin for SparseFactorization
impl UnsafeUnpin for SparseFactorization
impl UnwindSafe for SparseFactorization
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
impl<T, U> Imply<T> for U
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.