pub struct LU<T>where
T: Scalar,{ /* 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: Scalar> LinearSolver<FaerMat<T>> for LU<T>
impl<T: Scalar> LinearSolver<FaerMat<T>> for LU<T>
fn set_linearisation<C: NonLinearOpJacobian<T = T, V = FaerVec<T>, M = FaerMat<T>>>( &mut self, op: &C, x: &FaerVec<T>, t: T, )
fn solve_in_place(&self, x: &mut FaerVec<T>) -> Result<(), DiffsolError>
Source§fn set_problem<C: NonLinearOpJacobian<T = T, V = FaerVec<T>, M = FaerMat<T>, C = FaerContext>>(
&mut self,
op: &C,
)
fn set_problem<C: NonLinearOpJacobian<T = T, V = FaerVec<T>, M = FaerMat<T>, C = FaerContext>>( &mut self, op: &C, )
Set the problem to be solved, any previous problem is discarded.
Any internal state of the solver is reset.
This function will normally set the sparsity pattern of the matrix to be solved.
Source§fn solve(&self, b: &M::V) -> Result<M::V, DiffsolError>
fn solve(&self, b: &M::V) -> Result<M::V, DiffsolError>
Solve the problem
Ax = b and return the solution x.
panics if Self::set_linearisation has not been called previouslyAuto Trait Implementations§
impl<T> Freeze for LU<T>
impl<T> RefUnwindSafe for LU<T>where
T: RefUnwindSafe,
impl<T> Send for LU<T>
impl<T> Sync for LU<T>
impl<T> Unpin for LU<T>where
T: Unpin,
impl<T> UnwindSafe for LU<T>where
T: RefUnwindSafe + UnwindSafe,
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
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.