Struct Solver1d 

pub struct Solver1d {
    pub tol: f64,
    pub max_iter: usize,
}

A 1-D root finder: residual tolerance plus an iteration cap.

Fields

tol: f64

Convergence tolerance on |f(x)|.

max_iter: usize

Maximum number of iterations.

Implementations

impl Solver1d

pub fn new(tol: f64, max_iter: usize) -> Self

pub fn bisection( &self, f: impl Fn(f64) -> f64, lo: f64, hi: f64, ) -> Result<Root, RustyQLibError>

Bisection on a sign-changing bracket.

pub fn newton_raphson( &self, f: impl Fn(f64) -> f64, df: impl Fn(f64) -> f64, x0: f64, ) -> Root

Newton-Raphson with an analytic derivative.

pub fn secant(&self, f: impl Fn(f64) -> f64, x0: f64, x1: f64) -> Root

Secant from two starting points.

pub fn halley( &self, f: impl Fn(f64) -> f64, df: impl Fn(f64) -> f64, d2f: impl Fn(f64) -> f64, x0: f64, ) -> Root

Halley with analytic first and second derivatives.

pub fn newton_safeguarded( &self, f: impl Fn(f64) -> f64, df: impl Fn(f64) -> f64, lo: f64, hi: f64, x0: f64, ) -> Root

Bracket-safeguarded Newton.

pub fn solve( &self, method: Method, problem: &Problem<'_>, ) -> Result<Root, RustyQLibError>

Solve problem with the chosen Method.

Derivatives the problem does not carry are approximated by central finite differences, so Newton/Halley run on derivative-free problems too. Bisection and NewtonSafeguarded require a bracket and error without one.

Trait Implementations

impl Clone for Solver1d

fn clone(&self) -> Solver1d

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Solver1d

impl Debug for Solver1d

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

Formats the value using the given formatter.

impl Default for Solver1d

fn default() -> Self

Returns the “default value” for a type.