Struct SparseLU

Source

pub struct SparseLU<S: Scalar + Entity> { /* private fields */ }

Expand description

Sparse LU factorization for solving Ax = b.

Converts to dense internally (Phase 1 pragmatic approach). A future phase will use native faer sparse solvers for O(nnz) performance.

Implementations§

Source §

impl<S: Scalar + SimpleEntity + Conjugate<Canonical = S> + ComplexField> SparseLU<S>

Source

pub fn new(matrix: &SparseMatrix<S>) -> Result<Self, LinalgError>

Factor the sparse matrix (converts to dense internally).

Source

pub fn solve(&self, b: &[S]) -> Result<Vec<S>, LinalgError>

Solve Ax = b.

Source

pub fn dim(&self) -> usize

Dimension of the factorized matrix.

Auto Trait Implementations§

§

impl<S> Freeze for SparseLU<S>
where <<S as Entity>::Group as ForCopyType>::FaerOfCopy<NonNull<<S as Entity>::Unit>>: Freeze,

§

impl<S> RefUnwindSafe for SparseLU<S>
where <<S as Entity>::Group as ForCopyType>::FaerOfCopy<NonNull<<S as Entity>::Unit>>: RefUnwindSafe, S: RefUnwindSafe,

§

impl<S> Send for SparseLU<S>

§

impl<S> Sync for SparseLU<S>

§

impl<S> Unpin for SparseLU<S>
where <<S as Entity>::Group as ForCopyType>::FaerOfCopy<NonNull<<S as Entity>::Unit>>: Unpin, S: Unpin,

§

impl<S> UnsafeUnpin for SparseLU<S>
where <<S as Entity>::Group as ForCopyType>::FaerOfCopy<NonNull<<S as Entity>::Unit>>: UnsafeUnpin,

§

impl<S> UnwindSafe for SparseLU<S>
where <<S as Entity>::Group as ForCopyType>::FaerOfCopy<NonNull<<S as Entity>::Unit>>: UnwindSafe, S: UnwindSafe,

Blanket Implementations§

Source §

impl<T> Any for T
where T: 'static + ?Sized,

Source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

Source §

impl<T> Borrow<T> for T
where T: ?Sized,

Source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Into for T
where U: From<T>,

Source §

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> IntoEither for T

Source §

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 more

Source §

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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

Source §