Struct Ridder 

pub struct Ridder { /* private fields */ }

Ridder’s method root finder.

Implementations

impl Ridder

pub fn new() -> Self

A Ridder solver with the default configuration.

pub fn with_max_evaluations(self, evaluations: usize) -> Self

Set the evaluation cap (builder form).

pub fn with_lower_bound(self, lower_bound: Real) -> Self

Restrict the search to x >= lower_bound (builder form).

pub fn with_upper_bound(self, upper_bound: Real) -> Self

Restrict the search to x <= upper_bound (builder form).

Trait Implementations

impl Clone for Ridder

fn clone(&self) -> Ridder

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Ridder

impl Debug for Ridder

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

Formats the value using the given formatter.

impl Default for Ridder

fn default() -> Self

Returns the “default value” for a type.

impl Solver1D for Ridder

fn config(&self) -> &SolverConfig

The shared configuration (evaluation cap, domain bounds).

fn config_mut(&mut self) -> &mut SolverConfig

Mutable access to the shared configuration.

fn solve_impl<F>( &mut self, f: &mut F, x_acc: Real, st: &mut Solver1DState, ) -> QlResult<Real>

where F: FnMut(Real) -> Real,

Refine the already-bracketed root of f (invariants per Solver1DState) to the given accuracy. f is FnMut because QuantLib functors may carry mutable state (e.g. recording the last argument).

fn max_evaluations(&self) -> usize

The evaluation cap for the bracketing search and the refinement step.

fn set_max_evaluations(&mut self, evaluations: usize)

Set the evaluation cap.

fn set_lower_bound(&mut self, lower_bound: Real)

Restrict the search to x >= lower_bound (QuantLib’s setLowerBound).

fn set_upper_bound(&mut self, upper_bound: Real)

Restrict the search to x <= upper_bound (QuantLib’s setUpperBound).

fn solve<F>( &mut self, f: F, accuracy: Real, guess: Real, step: Real, ) -> QlResult<Real>

where F: FnMut(Real) -> Real,

Find a zero of f near guess, auto-bracketing by scanning outward in steps of step.

fn solve_bracketed<F>( &mut self, f: F, accuracy: Real, guess: Real, x_min: Real, x_max: Real, ) -> QlResult<Real>

where F: FnMut(Real) -> Real,

Find a zero of f in the caller-supplied bracket [x_min, x_max], with guess as the starting point.