Enum newton_rootfinder::solver::ResolutionMethod

pub enum ResolutionMethod {
    NewtonRaphson,
    QuasiNewton(QuasiNewtonMethod),
}

Choice of the iterative algorithm for the resolution

All of them are Newton based methods

All Newton based iterative methods have a local convergence. They also assume that the jacobian is invertible at the root (simple root)

Variants

NewtonRaphson

The classical Newton method

See Tjalling J. Ypma (1995), Historical development of the Newton–Raphson method, SIAM Review 37 (4), p 531–551, 1995, doi:10.1137/1037125

QuasiNewton(QuasiNewtonMethod)

Quasi-Newton methods (several are available through QuasiNewtonMethod)

Quasi Newton methods are used when the computation of the jacobian is too computationnaly expensive.

Instead of using the jacobian, there are using a approximation of this matrix (or its inverse). In most of the case, a computation of the true jacobian is still required for initialization purpose.

Trait Implementations

impl Clone for ResolutionMethod

fn clone(&self) -> ResolutionMethod

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ResolutionMethod

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for ResolutionMethod

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq<ResolutionMethod> for ResolutionMethod

fn eq(&self, other: &ResolutionMethod) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for ResolutionMethod

impl StructuralPartialEq for ResolutionMethod