pub enum FiniteDifferenceType {
Central,
Forward,
Backward,
}Expand description
Finite difference types for derivative approximation
Enum type that is used in the solvers to determine what type of finite difference to use.
Variants§
Central
Central Difference: (f(x+h) - f(x-h))/(2h). This has Order of Accuracy 2.
Forward
Forward Difference: (f(x+h) - f(x))/h. This has Order of Accuracy 1.
Backward
Auto Trait Implementations§
impl Freeze for FiniteDifferenceType
impl RefUnwindSafe for FiniteDifferenceType
impl Send for FiniteDifferenceType
impl Sync for FiniteDifferenceType
impl Unpin for FiniteDifferenceType
impl UnwindSafe for FiniteDifferenceType
Blanket Implementations§
§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
§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.