pub struct Trapezoidal {
pub max_iter: usize,
pub tol: f64,
}Expand description
Trapezoidal (Crank-Nicolson) integrator — second-order accurate, A-stable.
Solves y_{n+1} = y_n + h/2 * [f(t_n, y_n) + f(t_{n+1}, y_{n+1})]
iteratively via fixed-point iteration.
Fields§
§max_iter: usizeMaximum iterations per step.
tol: f64Convergence tolerance.
Implementations§
Auto Trait Implementations§
impl Freeze for Trapezoidal
impl RefUnwindSafe for Trapezoidal
impl Send for Trapezoidal
impl Sync for Trapezoidal
impl Unpin for Trapezoidal
impl UnsafeUnpin for Trapezoidal
impl UnwindSafe for Trapezoidal
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.