pub struct RKF45 {
pub tol: f64,
pub safety_factor: f64,
pub min_step_size: f64,
pub max_step_size: f64,
pub max_step_iter: usize,
}Expand description
Runge-Kutta-Fehlberg 4/5th order integrator.
This integrator uses the Runge-Kutta-Fehlberg method, which is an adaptive step size integrator. It calculates six intermediate values (k1, k2, k3, k4, k5, k6) to estimate the next step solution and the error. The step size is automatically adjusted based on the estimated error to maintain the desired tolerance.
§Member variables
tol: The tolerance for the estimated error.safety_factor: The safety factor for the step size adjustment.min_step_size: The minimum step size.max_step_size: The maximum step size.max_step_iter: The maximum number of iterations per step.
Fields§
§tol: f64§safety_factor: f64§min_step_size: f64§max_step_size: f64§max_step_iter: usizeImplementations§
Trait Implementations§
Source§impl ButcherTableau for RKF45
impl ButcherTableau for RKF45
const C: &'static [f64]
const A: &'static [&'static [f64]]
const BU: &'static [f64]
const BE: &'static [f64]
fn tol(&self) -> f64
fn safety_factor(&self) -> f64
fn min_step_size(&self) -> f64
fn max_step_size(&self) -> f64
fn max_step_iter(&self) -> usize
impl Copy for RKF45
Auto Trait Implementations§
impl Freeze for RKF45
impl RefUnwindSafe for RKF45
impl Send for RKF45
impl Sync for RKF45
impl Unpin for RKF45
impl UnwindSafe for RKF45
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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<BU> ODEIntegrator for BUwhere
BU: ButcherTableau,
impl<BU> ODEIntegrator for BUwhere
BU: ButcherTableau,
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
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.