Struct Adams

Source
pub struct Adams<'a, N, D, const O: usize, T, F, A>
where D: Dimension, N: ComplexField + Copy, T: Clone, F: Derivative<N, D, T> + 'a, A: AdamsCoefficients<O, RealField = N::RealField>, DefaultAllocator: Allocator<N, D>,
{ /* private fields */ }
Expand description

The nuts and bolts Adams solver Users won’t use this directly if they aren’t defining their own Adams predictor-corrector Used as a common struct for the specific implementations

Trait Implementations§

Source§

impl<'a, N, D, const O: usize, T, F, A> IVPSolver<'a, D> for Adams<'a, N, D, O, T, F, A>
where D: Dimension, N: ComplexField + Copy, T: Clone, F: Derivative<N, D, T> + 'a, A: AdamsCoefficients<O, RealField = N::RealField>, DefaultAllocator: Allocator<N, D> + Allocator<N, Const<O>>,

Source§

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>

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 Error = IVPError

Error type. IVPError must be able to convert to the error type.
Source§

type Field = N

The field, complex or real, that the solver is operating on.
Source§

type RealField = <N as ComplexField>::RealField

The real field associated with the solver’s Field.
Source§

type Derivative = F

The type signature of the derivative function to use
Source§

type UserData = T

Arbitrary data provided by the user for the derivative function
Source§

type Solver = AdamsSolver<'a, N, D, O, T, F>

The type that actually does the solving.
Source§

fn new() -> Result<Self, IVPError>

Create the solver. Will fail for dynamically sized solvers
Source§

fn new_dyn(size: usize) -> Result<Self, Self::Error>

Create the solver with a run-time dimension. Will fail for statically sized solvers
Source§

fn dim(&self) -> D

Gets the dimension of the solver
Source§

fn with_tolerance(self, tol: Self::RealField) -> Result<Self, Self::Error>

Set the error tolerance for any condition needing needing a float epsilon
Source§

fn with_initial_time( self, initial: Self::RealField, ) -> Result<Self, Self::Error>

Source§

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>

The initial conditions of the problem, in a BVector. Should reset any previous values.
Source§

fn with_derivative(self, derivative: Self::Derivative) -> Self

Sets the derivative function to use during the solve
Source§

fn solve( self, data: Self::UserData, ) -> Result<IVPIterator<D, Self::Solver>, Self::Error>

Turns the solver into an iterator over the solution, using IVPStep::step
Source§

fn with_initial_conditions_slice( self, start: &[Self::Field], ) -> Result<Self, Self::Error>

The initial conditions of the problem, should reset any previous values.

Auto Trait Implementations§

§

impl<'a, N, D, const O: usize, T, F, A> !Freeze for Adams<'a, N, D, O, T, F, A>

§

impl<'a, N, D, const O: usize, T, F, A> !RefUnwindSafe for Adams<'a, N, D, O, T, F, A>

§

impl<'a, N, D, const O: usize, T, F, A> !Send for Adams<'a, N, D, O, T, F, A>

§

impl<'a, N, D, const O: usize, T, F, A> !Sync for Adams<'a, N, D, O, T, F, A>

§

impl<'a, N, D, const O: usize, T, F, A> !Unpin for Adams<'a, N, D, O, T, F, A>

§

impl<'a, N, D, const O: usize, T, F, A> !UnwindSafe for Adams<'a, N, D, O, T, F, A>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.