Struct BDFSolver

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

The solver for any BDF predictor-corrector Users should not use this type directly, and should instead get it from a specific BDF method struct (wrapped in an IVPIterator)

Trait Implementations§

Source§

impl<'a, N, D, const O: usize, T, F> IVPStepper<D> for BDFSolver<'a, N, D, O, T, F>
where N: ComplexField + Copy, D: Dimension + DimMin<D, Output = D>, T: Clone, F: Derivative<N, D, T> + 'a, DefaultAllocator: Allocator<N, D> + Allocator<N, U1, D> + Allocator<N, D, D> + Allocator<(usize, usize), D>,

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 UserData = T

Arbitrary data provided by the user for the derivative function It must be clone because for any intermediate time steps (e.g. in runge-kutta) gives the derivative function a clone of the params: only normal time steps get to update the internal UserData state
Source§

fn step(&mut self) -> Step<Self::RealField, Self::Field, D, Self::Error>

Step forward in the solver. The solver may request a step be redone, signal that the solution is finished, or give the value of the next solution value.
Source§

fn time(&self) -> Self::RealField

Get the current time of the solver.

Auto Trait Implementations§

§

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

§

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

§

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

§

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

§

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

§

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

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.