[−][src]Struct sprs_suitesparse_ldl::LdlLongNumeric
Structure holding the numeric ldlt decomposition computed by suitesparse's ldl
Implementations
impl LdlLongNumeric
[src]
pub fn new<N, I>(mat: CsMatViewI<'_, N, I>) -> Result<Self, SprsError> where
N: Clone + Into<f64>,
I: SpIndex,
[src]
N: Clone + Into<f64>,
I: SpIndex,
pub fn new_perm<N, I>(
mat: CsMatViewI<'_, N, I>,
perm: PermOwnedI<I>,
check_perm: PermutationCheck
) -> Result<Self, SprsError> where
N: Clone + Into<f64>,
I: SpIndex,
[src]
mat: CsMatViewI<'_, N, I>,
perm: PermOwnedI<I>,
check_perm: PermutationCheck
) -> Result<Self, SprsError> where
N: Clone + Into<f64>,
I: SpIndex,
Compute the numeric decomposition L D L^T = P^T A P 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
pub fn update<N, I>(
&mut self,
mat: CsMatViewI<'_, N, I>
) -> Result<(), SprsError> where
N: Clone + Into<f64>,
I: SpIndex,
[src]
&mut self,
mat: CsMatViewI<'_, N, I>
) -> Result<(), SprsError> where
N: Clone + Into<f64>,
I: SpIndex,
Factor a new matrix, assuming it shares the same nonzero pattern as the matrix this factorization was built from.
Panics
If the matrix is not symmetric.
pub fn solve<'a, N, V>(&self, rhs: &V) -> Vec<N> where
N: 'a + Copy + Num + Into<f64> + From<f64>,
V: Deref<Target = [N]>,
[src]
N: 'a + Copy + Num + Into<f64> + From<f64>,
V: Deref<Target = [N]>,
Solve the system A x = rhs
pub fn problem_size(&self) -> usize
[src]
The size of the linear system associated with this decomposition
pub fn nnz(&self) -> usize
[src]
The number of non-zero entries in L
Trait Implementations
impl Clone for LdlLongNumeric
[src]
fn clone(&self) -> LdlLongNumeric
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Debug for LdlLongNumeric
[src]
Auto Trait Implementations
impl RefUnwindSafe for LdlLongNumeric
impl Send for LdlLongNumeric
impl Sync for LdlLongNumeric
impl Unpin for LdlLongNumeric
impl UnwindSafe for LdlLongNumeric
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn is_in_subset(&self) -> bool
unsafe fn to_subset_unchecked(&self) -> SS
fn from_subset(element: &SS) -> SP
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,