Enum TangentStrategy 

pub enum TangentStrategy {
    Current,
    ReuseAtStepStart,
    Initial,
}

Which tangent stiffness an Algorithm::Newton/KrylovNewton iteration solves against. Closed enum — mirrors Xara’s TangentFlagType (CURRENT_TANGENT / INITIAL_TANGENT / PREDICTOR_TANGENT), which every Newton-family algorithm class there takes as a constructor argument rather than hard-coding (docs/algorithms.md §3).

Variants

Current

Re-form and re-factor the tangent at the current trial state, every iteration. Full Newton-Raphson — today’s only behavior before this type existed.

ReuseAtStepStart

Form the tangent once, at the state the step started from, and reuse it (still factored once) for every iteration of that step. Xara’s ModifiedNewton with CURRENT_TANGENT passed at construction (misleadingly named from the caller’s perspective — it means “current as of step start,” not “current every iteration”).

Initial

Form the tangent once, from the model’s very first (undeformed) state, ever — reused for every iteration of every step. Xara’s ModifiedNewton with INITIAL_TANGENT. Cheapest, worst convergence rate (linear, not quadratic); pairs naturally with Algorithm::KrylovNewton’s acceleration to claw the convergence rate back without paying for re-factorization.

Trait Implementations

impl Clone for TangentStrategy

fn clone(&self) -> TangentStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for TangentStrategy

impl Debug for TangentStrategy

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

Formats the value using the given formatter.

impl Eq for TangentStrategy

impl PartialEq for TangentStrategy

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for TangentStrategy