Struct sprs_suitesparse_ldl::LdlLongSymbolic [−][src]
Structure holding the symbolic ldlt decomposition computed by suitesparse’s ldl
Implementations
impl LdlLongSymbolic[src]
pub fn new<N, I>(mat: CsMatViewI<'_, N, I>) -> LdlLongSymbolic 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
) -> LdlLongSymbolic where
N: Clone + Into<f64>,
I: SpIndex, [src]
mat: CsMatViewI<'_, N, I>,
perm: PermOwnedI<I>,
check_perm: PermutationCheck
) -> LdlLongSymbolic where
N: Clone + Into<f64>,
I: SpIndex,
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
- if perm does not represent a valid permutation
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
pub fn factor<N, I>(
self,
mat: CsMatViewI<'_, N, I>
) -> Result<LdlLongNumeric, LinalgError> where
N: Clone + Into<f64>,
I: SpIndex, [src]
self,
mat: CsMatViewI<'_, N, I>
) -> Result<LdlLongNumeric, LinalgError> where
N: Clone + Into<f64>,
I: SpIndex,
Factor a matrix, assuming it shares the same nonzero pattern as the matrix this factorization was built from.
Panics
If the matrix is not symmetric.
Trait Implementations
impl Clone for LdlLongSymbolic[src]
fn clone(&self) -> LdlLongSymbolic[src]
pub fn clone_from(&mut self, source: &Self)1.0.0[src]
impl Debug for LdlLongSymbolic[src]
Auto Trait Implementations
impl RefUnwindSafe for LdlLongSymbolic
impl Send for LdlLongSymbolic
impl Sync for LdlLongSymbolic
impl Unpin for LdlLongSymbolic
impl UnwindSafe for LdlLongSymbolic
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,
pub 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<T> Pointable for T
pub const ALIGN: usize
type Init = T
The type for initializers.
pub unsafe fn init(init: <T as Pointable>::Init) -> usize
pub unsafe fn deref<'a>(ptr: usize) -> &'a T
pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T
pub unsafe fn drop(ptr: usize)
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
SS: SubsetOf<SP>,
pub fn to_subset(&self) -> Option<SS>
pub fn is_in_subset(&self) -> bool
pub unsafe fn to_subset_unchecked(&self) -> SS
pub 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.
pub fn to_owned(&self) -> T[src]
pub 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.
pub 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>,