pub struct RungeKutta<'a, N, D, const O: usize, T, F, R>where
D: Dimension,
N: ComplexField + Copy,
T: Clone,
F: Derivative<N, D, T> + 'a,
R: RungeKuttaCoefficients<O, RealField = N::RealField>,
DefaultAllocator: Allocator<N, D> + Allocator<N, Const<O>>,{ /* private fields */ }
Expand description
The nuts and bolts Runge-Kutta solver Users won’t use this directly if they aren’t defining their own Runge-Kutta solver Used as a common struct for the specific implementations
Trait Implementations§
Source§impl<'a, N, D, const O: usize, T, F, R> IVPSolver<'a, D> for RungeKutta<'a, N, D, O, T, F, R>where
D: Dimension,
N: ComplexField + Copy,
T: Clone,
F: Derivative<N, D, T> + 'a,
R: RungeKuttaCoefficients<O, RealField = N::RealField>,
DefaultAllocator: Allocator<N, D> + Allocator<N, Const<O>> + Allocator<N, D, Const<O>>,
impl<'a, N, D, const O: usize, T, F, R> IVPSolver<'a, D> for RungeKutta<'a, N, D, O, T, F, R>where
D: Dimension,
N: ComplexField + Copy,
T: Clone,
F: Derivative<N, D, T> + 'a,
R: RungeKuttaCoefficients<O, RealField = N::RealField>,
DefaultAllocator: Allocator<N, D> + Allocator<N, Const<O>> + Allocator<N, D, Const<O>>,
Source§fn with_maximum_dt(self, max: Self::RealField) -> Result<Self, Self::Error>
fn with_maximum_dt(self, max: Self::RealField) -> Result<Self, Self::Error>
Will overwrite any previously set value If the provided maximum is less than a previously set minimum, then the minimum is set to this value as well.
Source§fn with_minimum_dt(self, min: Self::RealField) -> Result<Self, Self::Error>
fn with_minimum_dt(self, min: Self::RealField) -> Result<Self, Self::Error>
Will overwrite any previously set value If the provided minimum is greatear than a previously set maximum, then the maximum is set to this value as well.
Source§type RealField = <N as ComplexField>::RealField
type RealField = <N as ComplexField>::RealField
The real field associated with the solver’s Field.
Source§type Derivative = F
type Derivative = F
The type signature of the derivative function to use
Source§type Solver = RungeKuttaSolver<'a, N, D, O, T, F>
type Solver = RungeKuttaSolver<'a, N, D, O, T, F>
The type that actually does the solving.
Source§fn new_dyn(size: usize) -> Result<Self, IVPError>
fn new_dyn(size: usize) -> Result<Self, IVPError>
Create the solver with a run-time dimension.
Will fail for statically sized solvers
Source§fn with_tolerance(self, tol: Self::RealField) -> Result<Self, Self::Error>
fn with_tolerance(self, tol: Self::RealField) -> Result<Self, Self::Error>
Set the error tolerance for any condition needing needing a float epsilon
fn with_initial_time( self, initial: Self::RealField, ) -> Result<Self, Self::Error>
fn with_ending_time(self, ending: Self::RealField) -> Result<Self, Self::Error>
Source§fn with_initial_conditions(
self,
start: BVector<Self::Field, D>,
) -> Result<Self, Self::Error>
fn with_initial_conditions( self, start: BVector<Self::Field, D>, ) -> Result<Self, Self::Error>
The initial conditions of the problem, in a BVector. Should reset any previous values.
Source§fn with_derivative(self, derivative: Self::Derivative) -> Self
fn with_derivative(self, derivative: Self::Derivative) -> Self
Sets the derivative function to use during the solve
Auto Trait Implementations§
impl<'a, N, D, const O: usize, T, F, R> !Freeze for RungeKutta<'a, N, D, O, T, F, R>
impl<'a, N, D, const O: usize, T, F, R> !RefUnwindSafe for RungeKutta<'a, N, D, O, T, F, R>
impl<'a, N, D, const O: usize, T, F, R> !Send for RungeKutta<'a, N, D, O, T, F, R>
impl<'a, N, D, const O: usize, T, F, R> !Sync for RungeKutta<'a, N, D, O, T, F, R>
impl<'a, N, D, const O: usize, T, F, R> !Unpin for RungeKutta<'a, N, D, O, T, F, R>
impl<'a, N, D, const O: usize, T, F, R> !UnwindSafe for RungeKutta<'a, N, D, O, T, F, R>
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.