Enum LineSearch 

pub enum LineSearch {
    Bisection {
        tol: f64,
        max_iter: usize,
        max_eta: f64,
    },
    RegulaFalsi {
        tol: f64,
        max_iter: usize,
        max_eta: f64,
    },
}

Post-processes a raw Newton correction to actually reduce the residual, rather than accepting it outright. Closed enum. Ported from Xara’s SRC/analysis/algorithm/equiSolnAlgo/search/ (docs/ algorithms.md §4): both variants bracket a sign change in the 1-D “energy” s(eta) = du . residual(eta) by geometric expansion of eta, then refine within the bracket — bisection, or false-position (RegulaFalsi, usually fewer iterations than bisection once bracketed). Only these two for now — Secant/InitialInterpolatedLineSearch can diverge without a bracket and aren’t needed until a specific model demands the extra speed (docs/algorithms.md §4).

Variants

Bisection

Fields

tol: f64

max_iter: usize

max_eta: f64

RegulaFalsi

Fields

tol: f64

max_iter: usize

max_eta: f64

Trait Implementations

impl Clone for LineSearch

fn clone(&self) -> LineSearch

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for LineSearch

impl Debug for LineSearch

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

Formats the value using the given formatter.

impl PartialEq for LineSearch

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for LineSearch