pub struct GeodesicMilstein {
pub eps: f64,
}Expand description
Geodesic Milstein: strong order 1.0 scheme via finite-difference covariant derivative.
Correction via finite-difference approximation of nabla_g(g): nabla_g g(x) ≈ (1/eps) * [PT_{y->x}(g(y)) - g(x)] where y = exp_x(eps * g(x))
Full step: v = f(x)*dt + g(x)*dW + 0.5 * nabla_g(g) * (dW^2 - dt) x_new = exp_x(v)
Requires M: ParallelTransport to compute the covariant derivative via transporting g(y) back to T_x(M) along the geodesic from y to x.
References:
- Milstein (1974), Platen & Wagner (1982) for the scalar correction.
- Said & Manton (2012) for geodesic extension to Lie groups.
Fields§
§eps: f64Finite-difference step size for covariant derivative approximation.
Implementations§
Source§impl GeodesicMilstein
impl GeodesicMilstein
Sourcepub fn step<M, D, G>(
&self,
sde: &ManifoldSDE<M, D, G>,
x: &M::Point,
t: f64,
dt: f64,
inc: &Increment<f64>,
) -> M::Point
pub fn step<M, D, G>( &self, sde: &ManifoldSDE<M, D, G>, x: &M::Point, t: f64, dt: f64, inc: &Increment<f64>, ) -> M::Point
Advance x by one Milstein step on the manifold.
Computes the Milstein correction via finite-difference parallel transport:
- Walk eps along g(x) to get y = exp_x(eps * g(x)).
- Evaluate g at y.
- Transport g(y) back from y to x via ParallelTransport.
- Approx covariant deriv: nabla_g g ≈ (PT(g(y)) - g(x)) / eps.
- Add Milstein correction: 0.5 * nabla_g(g) * (dW^2 - dt).
- Apply exp to the full tangent displacement.
If transport fails (cut locus), falls back to Euler step (no correction).
Trait Implementations§
Source§impl Default for GeodesicMilstein
impl Default for GeodesicMilstein
Source§impl<M, D, G> GeoScheme<M, D, G> for GeodesicMilstein
impl<M, D, G> GeoScheme<M, D, G> for GeodesicMilstein
Auto Trait Implementations§
impl Freeze for GeodesicMilstein
impl RefUnwindSafe for GeodesicMilstein
impl Send for GeodesicMilstein
impl Sync for GeodesicMilstein
impl Unpin for GeodesicMilstein
impl UnsafeUnpin for GeodesicMilstein
impl UnwindSafe for GeodesicMilstein
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<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
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.