diffsol_la::linear_solver::faer::sparse_lu

Struct FaerSparseLU

pub struct FaerSparseLU<T>where
    T: FaerScalar,
{ /* private fields */ }

Expand description

A LinearSolver that uses the LU decomposition in the faer library to solve the linear system.

Trait Implementations§

Source §

impl<T> Default for FaerSparseLU<T>
where T: FaerScalar,

Source §

fn default() -> Self

Returns the “default value” for a type. Read more

Source §

impl<T: FaerScalar> LinearSolver<FaerSparseMat<T>> for FaerSparseLU<T>

Source §

fn set_linearisation<C: LinearOp<T = T, V = FaerVec<T>, M = FaerSparseMat<T>, C = FaerContext>>( &mut self, op: &C, )

Set the point at which the linear operator A is evaluated and factorise it. Read more

Source §

fn solve_in_place(&self, x: &mut FaerVec<T>) -> Result<(), LaError>

Source §

fn set_sparsity<C: LinearOp<T = T, V = FaerVec<T>, M = FaerSparseMat<T>, C = FaerContext>>( &mut self, op: &C, )

Set the sparsity of the problem to be solved, any previous problem is discarded. Read more

Source §

fn solve(&self, b: &M::V) -> Result<M::V, LaError>

Solve the problem Ax = b and return the solution x. Read more

Auto Trait Implementations§

§

impl<T> UnwindSafe for FaerSparseLU<T>
where T: 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> ByRef<T> for T

Source §

fn by_ref(&self) -> &T

Source §

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source §

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source §

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

Source §

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

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 §