[]Struct lumol::sim::min::SteepestDescent

pub struct SteepestDescent { /* fields omitted */ }

Steepest descent minimization algorithm.

This method propagates the system along the gradient of energy to find a minimum. Although easy to use, it will not converge in all situations.


impl SteepestDescent

pub fn new() -> SteepestDescent

Create a new SteepestDescent minimizer

Trait Implementations

impl FromToml for SteepestDescent

impl Minimizer for SteepestDescent

Auto Trait Implementations

impl RefUnwindSafe for SteepestDescent

impl Send for SteepestDescent

impl Sync for SteepestDescent

impl Unpin for SteepestDescent

impl UnwindSafe for SteepestDescent

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized

impl<T> Borrow<T> for T where
    T: ?Sized

impl<T> BorrowMut<T> for T where
    T: ?Sized

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 

impl<T> Pointable for T

type Init = T

The type for initializers.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>,