RKCoefficients45

Struct RKCoefficients45 

Source
pub struct RKCoefficients45<N: ComplexField>(/* private fields */);

Trait Implementations§

Source§

impl<N: ComplexField> RungeKuttaCoefficients<6> for RKCoefficients45<N>

Source§

type RealField = <N as ComplexField>::RealField

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

fn t_coefficients() -> Option<BSVector<Self::RealField, 6>>

Returns a vec of coefficients to multiply the time step by when getting intermediate results. Upper-left portion of Butcher Tableaux
Source§

fn k_coefficients() -> Option<BSMatrix<Self::RealField, 6, 6>>

Returns the coefficients to use on the k_i’s when finding another k_i. Upper-right portion of the Butcher Tableaux. Should be an NxN-1 matrix, where N is the order of the Runge-Kutta Method (Or order+1 for adaptive methods)
Source§

fn avg_coefficients() -> Option<BSVector<Self::RealField, 6>>

Coefficients to use when calculating the final step to take. These are the weights of the weighted average of k_i’s. Bottom portion of the Butcher Tableaux. For adaptive methods, this is the first row of the bottom portion.
Source§

fn error_coefficients() -> Option<BSVector<Self::RealField, 6>>

Coefficients to use on the k_i’s to find the error between the two orders of Runge-Kutta methods. In the Butcher Tableaux, this is the first row of the bottom portion minus the second row.

Auto Trait Implementations§

§

impl<N> Freeze for RKCoefficients45<N>

§

impl<N> RefUnwindSafe for RKCoefficients45<N>
where N: RefUnwindSafe,

§

impl<N> Send for RKCoefficients45<N>

§

impl<N> Sync for RKCoefficients45<N>

§

impl<N> Unpin for RKCoefficients45<N>
where N: Unpin,

§

impl<N> UnwindSafe for RKCoefficients45<N>
where N: UnwindSafe,

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.