pub struct LuSolver { /* private fields */ }Available on crate feature
backend-faer only.Expand description
LU solver using full pivoting from Faer.
Stores the LU factorization for reuse (if desired).
Implementations§
Trait Implementations§
Source§impl LinearSolver<Mat<Own<f64>>, Vec<f64>> for LuSolver
impl LinearSolver<Mat<Own<f64>>, Vec<f64>> for LuSolver
Source§fn solve(
&mut self,
a: &Mat<f64>,
pc: Option<&(dyn Preconditioner<Mat<f64>, Vec<f64>> + '_)>,
b: &Vec<f64>,
x: &mut Vec<f64>,
_pc_side: PcSide,
_comm: &UniverseComm,
monitors: Option<&[Box<MonitorCallback<Self::Scalar>>]>,
_work: Option<&mut Workspace>,
) -> Result<SolveStats<f64>, KError>
fn solve( &mut self, a: &Mat<f64>, pc: Option<&(dyn Preconditioner<Mat<f64>, Vec<f64>> + '_)>, b: &Vec<f64>, x: &mut Vec<f64>, _pc_side: PcSide, _comm: &UniverseComm, monitors: Option<&[Box<MonitorCallback<Self::Scalar>>]>, _work: Option<&mut Workspace>, ) -> Result<SolveStats<f64>, KError>
Solve Ax = b using LU factorization (full pivoting).
§Arguments
a- Matrix (Faer Mat)pc- (Unused) Preconditioner (not supported for direct solvers)b- Right-hand side vectorx- On input: ignored; on output: solution vectorcomm- Communicator for parallel operations (unused for direct solvers)monitors- Optional callbacks to invoke at each iterationwork- Optional workspace (unused for direct solvers)
§Returns
Ok(SolveStats)(always converged in 1 iteration)
type Error = KError
type Scalar = f64
fn setup_workspace(&mut self, _work: &mut Workspace)
fn solve_simple(
&mut self,
a: &M,
pc: Option<&(dyn Preconditioner<M, V> + '_)>,
b: &V,
x: &mut V,
pc_side: PcSide,
comm: &UniverseComm,
) -> Result<SolveStats<Self::Scalar>, Self::Error>where
Self: Sized,
fn solve_with_monitors(
&mut self,
a: &M,
pc: Option<&(dyn Preconditioner<M, V> + '_)>,
b: &V,
x: &mut V,
pc_side: PcSide,
comm: &UniverseComm,
monitors: &[Box<MonitorCallback<Self::Scalar>>],
) -> Result<SolveStats<Self::Scalar>, Self::Error>where
Self: Sized,
fn solve_with_workspace(
&mut self,
a: &M,
pc: Option<&(dyn Preconditioner<M, V> + '_)>,
b: &V,
x: &mut V,
pc_side: PcSide,
comm: &UniverseComm,
work: &mut Workspace,
) -> Result<SolveStats<Self::Scalar>, Self::Error>where
Self: Sized,
Auto Trait Implementations§
impl Freeze for LuSolver
impl RefUnwindSafe for LuSolver
impl Send for LuSolver
impl Sync for LuSolver
impl Unpin for LuSolver
impl UnsafeUnpin for LuSolver
impl UnwindSafe for LuSolver
Blanket Implementations§
Source§impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
Source§fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
Convert the given value into an approximately equivalent representation.
Source§impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
Source§type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
The error type produced by a failed conversion.
Source§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Convert the subject into an approximately equivalent representation.
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, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
Source§impl<T> ConvUtil for T
impl<T> ConvUtil for T
Source§fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
Approximate the subject to a given type with the default scheme.
Source§fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>
fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>
Approximate the subject to a given type with a specific scheme.
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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
impl<T> ShellContext 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§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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.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.