Enum newton_rootfinder::solver::QuasiNewtonMethod [−][src]
pub enum QuasiNewtonMethod {
StationaryNewton,
JacobianUpdate(UpdateQuasiNewtonMethod),
InverseJacobianUpdate(UpdateQuasiNewtonMethod),
}
Expand description
Quasi-Newton methods are less computationnaly expensive than the Newton-Raphson method.
However, the most robust method is the Newton-Raphson one.
Quasi-newton methods do not evaluate the jacobian at each steps.
It is a trade off between recomputing the full jacobian matrix (which can take time, especially when using finite-differences) and the accuracy of the jacobian matrix used. Indeed, the more accurate the jacobian, fewer iterations will be needed.
Variants
The first computed jacobian will be used for all iterations.
JacobianUpdate(UpdateQuasiNewtonMethod)
The update of the methods will be performed on the jacobian matrix: it will be inverted afterwards before applying the step update.
Tuple Fields of JacobianUpdate
InverseJacobianUpdate(UpdateQuasiNewtonMethod)
The update of the methods will be performed directly on the inverse jacobian matrix: Thus the jacobian won’t be computed at all after the first step.
Tuple Fields of InverseJacobianUpdate
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 QuasiNewtonMethod
impl Send for QuasiNewtonMethod
impl Sync for QuasiNewtonMethod
impl Unpin for QuasiNewtonMethod
impl UnwindSafe for QuasiNewtonMethod
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.