pub struct BackwardPushSolver;Trait Implementations§
Source§impl SolverAlgorithm for BackwardPushSolver
impl SolverAlgorithm for BackwardPushSolver
Source§fn initialize(
&self,
_matrix: &dyn Matrix,
_b: &[Precision],
_options: &SolverOptions,
) -> Result<Self::State>
fn initialize( &self, _matrix: &dyn Matrix, _b: &[Precision], _options: &SolverOptions, ) -> Result<Self::State>
Initialize the solver state for a given problem.
Source§fn step(&self, _state: &mut Self::State) -> Result<StepResult>
fn step(&self, _state: &mut Self::State) -> Result<StepResult>
Perform a single iteration step.
Source§fn is_converged(&self, _state: &Self::State) -> bool
fn is_converged(&self, _state: &Self::State) -> bool
Check if the current state meets convergence criteria.
Source§fn extract_solution(&self, _state: &Self::State) -> Vec<Precision> ⓘ
fn extract_solution(&self, _state: &Self::State) -> Vec<Precision> ⓘ
Extract the current solution from the state.
Source§fn update_rhs(
&self,
_state: &mut Self::State,
_delta_b: &[(usize, Precision)],
) -> Result<()>
fn update_rhs( &self, _state: &mut Self::State, _delta_b: &[(usize, Precision)], ) -> Result<()>
Update the right-hand side for incremental solving.
Source§fn algorithm_name(&self) -> &'static str
fn algorithm_name(&self) -> &'static str
Get the algorithm name for identification.
Source§fn solve(
&self,
matrix: &dyn Matrix,
b: &[Precision],
options: &SolverOptions,
) -> Result<SolverResult>
fn solve( &self, matrix: &dyn Matrix, b: &[Precision], options: &SolverOptions, ) -> Result<SolverResult>
Solve the linear system Ax = b. Read more
Auto Trait Implementations§
impl Freeze for BackwardPushSolver
impl RefUnwindSafe for BackwardPushSolver
impl Send for BackwardPushSolver
impl Sync for BackwardPushSolver
impl Unpin for BackwardPushSolver
impl UnwindSafe for BackwardPushSolver
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<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.