pub struct BDFInfo<N, const S: usize, const O: usize>where
N: ComplexField + FromPrimitive,
<N as ComplexField>::RealField: FromPrimitive,
Const<S>: DimMin<Const<S>, Output = Const<S>>,{ /* private fields */ }Expand description
Provides an IVPSolver implementation for BDFSolver, based on the higher and lower order coefficients. It is up to the BDFSolver to correctly implement the coefficients.
Implementations§
Trait Implementations§
source§impl<N, const S: usize, const O: usize> Clone for BDFInfo<N, S, O>where
N: ComplexField + FromPrimitive + Clone,
<N as ComplexField>::RealField: FromPrimitive,
Const<S>: DimMin<Const<S>, Output = Const<S>>,
N::RealField: Clone,
impl<N, const S: usize, const O: usize> Clone for BDFInfo<N, S, O>where N: ComplexField + FromPrimitive + Clone, <N as ComplexField>::RealField: FromPrimitive, Const<S>: DimMin<Const<S>, Output = Const<S>>, N::RealField: Clone,
source§impl<N, const S: usize, const O: usize> Debug for BDFInfo<N, S, O>where
N: ComplexField + FromPrimitive + Debug,
<N as ComplexField>::RealField: FromPrimitive,
Const<S>: DimMin<Const<S>, Output = Const<S>>,
N::RealField: Debug,
impl<N, const S: usize, const O: usize> Debug for BDFInfo<N, S, O>where N: ComplexField + FromPrimitive + Debug, <N as ComplexField>::RealField: FromPrimitive, Const<S>: DimMin<Const<S>, Output = Const<S>>, N::RealField: Debug,
source§impl<N, const S: usize, const O: usize> Default for BDFInfo<N, S, O>where
N: ComplexField + FromPrimitive,
<N as ComplexField>::RealField: FromPrimitive,
Const<S>: DimMin<Const<S>, Output = Const<S>>,
impl<N, const S: usize, const O: usize> Default for BDFInfo<N, S, O>where N: ComplexField + FromPrimitive, <N as ComplexField>::RealField: FromPrimitive, Const<S>: DimMin<Const<S>, Output = Const<S>>,
source§impl<N, const S: usize> From<BDF2<N, S>> for BDFInfo<N, S, 3>where
N: ComplexField + FromPrimitive,
<N as ComplexField>::RealField: FromPrimitive,
Const<S>: DimMin<Const<S>, Output = Const<S>>,
impl<N, const S: usize> From<BDF2<N, S>> for BDFInfo<N, S, 3>where N: ComplexField + FromPrimitive, <N as ComplexField>::RealField: FromPrimitive, Const<S>: DimMin<Const<S>, Output = Const<S>>,
source§impl<N, const S: usize> From<BDF6<N, S>> for BDFInfo<N, S, 7>where
N: ComplexField + FromPrimitive + Copy,
<N as ComplexField>::RealField: FromPrimitive + Copy,
Const<S>: DimMin<Const<S>, Output = Const<S>>,
impl<N, const S: usize> From<BDF6<N, S>> for BDFInfo<N, S, 7>where N: ComplexField + FromPrimitive + Copy, <N as ComplexField>::RealField: FromPrimitive + Copy, Const<S>: DimMin<Const<S>, Output = Const<S>>,
source§impl<N, const S: usize, const O: usize> IVPSolver<N, S> for BDFInfo<N, S, O>where
N: ComplexField + FromPrimitive + Copy,
<N as ComplexField>::RealField: FromPrimitive + Copy,
Const<S>: DimMin<Const<S>, Output = Const<S>>,
impl<N, const S: usize, const O: usize> IVPSolver<N, S> for BDFInfo<N, S, O>where N: ComplexField + FromPrimitive + Copy, <N as ComplexField>::RealField: FromPrimitive + Copy, Const<S>: DimMin<Const<S>, Output = Const<S>>,
source§fn step<T, F>(
&mut self,
f: F,
params: &mut T
) -> Result<IVPStatus<N, S>, String>where
T: Clone,
F: FnMut(N::RealField, &[N], &mut T) -> Result<SVector<N, S>, String>,
fn step<T, F>( &mut self, f: F, params: &mut T ) -> Result<IVPStatus<N, S>, String>where T: Clone, F: FnMut(N::RealField, &[N], &mut T) -> Result<SVector<N, S>, String>,
Step forward in the solver. Returns if the solver is finished, produced
an acceptable state, or needs to be redone.
source§fn with_tolerance(self, tol: N::RealField) -> Result<Self, String>
fn with_tolerance(self, tol: N::RealField) -> Result<Self, String>
Set the error tolerance for this solver.
source§fn with_dt_max(self, max: N::RealField) -> Result<Self, String>
fn with_dt_max(self, max: N::RealField) -> Result<Self, String>
Set the maximum time step for this solver.
source§fn with_dt_min(self, min: N::RealField) -> Result<Self, String>
fn with_dt_min(self, min: N::RealField) -> Result<Self, String>
Set the minimum time step for this solver.
source§fn with_start(self, t_initial: N::RealField) -> Result<Self, String>
fn with_start(self, t_initial: N::RealField) -> Result<Self, String>
Set the initial time for this solver.
source§fn with_end(self, t_final: N::RealField) -> Result<Self, String>
fn with_end(self, t_final: N::RealField) -> Result<Self, String>
Set the end time for this solver.
source§fn with_initial_conditions(self, start: &[N]) -> Result<Self, String>
fn with_initial_conditions(self, start: &[N]) -> Result<Self, String>
Set the initial conditions for this solver.
source§fn get_initial_conditions(&self) -> Option<SVector<N, S>>
fn get_initial_conditions(&self) -> Option<SVector<N, S>>
Return the initial conditions. Called once at the very start
of solving.
Auto Trait Implementations§
impl<N, const S: usize, const O: usize> RefUnwindSafe for BDFInfo<N, S, O>where N: RefUnwindSafe, <N as ComplexField>::RealField: RefUnwindSafe,
impl<N, const S: usize, const O: usize> Send for BDFInfo<N, S, O>
impl<N, const S: usize, const O: usize> Sync for BDFInfo<N, S, O>
impl<N, const S: usize, const O: usize> Unpin for BDFInfo<N, S, O>where N: Unpin, <N as ComplexField>::RealField: Unpin,
impl<N, const S: usize, const O: usize> UnwindSafe for BDFInfo<N, S, O>where N: UnwindSafe, <N as ComplexField>::RealField: 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
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.