Enum newton_rootfinder::solver::ResolutionMethod [−][src]
pub enum ResolutionMethod {
NewtonRaphson,
QuasiNewton(QuasiNewtonMethod),
}Expand description
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
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.
Tuple Fields of QuasiNewton
Trait Implementations
This method tests for self and other values to be equal, and is used
by ==. Read more
This method tests for !=.
Auto Trait Implementations
impl RefUnwindSafe for ResolutionMethod
impl Send for ResolutionMethod
impl Sync for ResolutionMethod
impl Unpin for ResolutionMethod
impl UnwindSafe for ResolutionMethod
Blanket Implementations
Mutably borrows from an owned value. Read more
The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self is actually part of its subset T (and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self to the equivalent element of its superset.