Struct BrentMinimizer 

pub struct BrentMinimizer {
    pub max_iter: u32,
    pub abs_tol: f64,
}

Brent’s method for finding the minimum of a unimodal function in a bracket.

Combines golden section search with parabolic interpolation.

Fields

max_iter: u32

Maximum number of iterations.

abs_tol: f64

Absolute tolerance for convergence.

Trait Implementations

impl Clone for BrentMinimizer

fn clone(&self) -> BrentMinimizer

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BrentMinimizer

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

Formats the value using the given formatter.

impl Default for BrentMinimizer

fn default() -> BrentMinimizer

Returns the “default value” for a type.

impl<F> FindBracketedMinimum<F> for BrentMinimizer

where F: Callback,

fn find_minimum_in_bracket( &self, f: F, bracket: (f64, f64), ) -> Result<f64, RootFinderError>

Finds the x value that minimizes f within the given bracket.

impl PartialEq for BrentMinimizer

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl Copy for BrentMinimizer

impl StructuralPartialEq for BrentMinimizer