Class RootFinder

java.lang.Object

org.episteme.core.mathematics.analysis.roots.RootFinder

public class RootFinder
extends Object

Root finding algorithms.

Since:

1.0

Author:

Silvere Martin-Michiellot, Gemini AI (Google DeepMind)

Constructor Summary

Constructors

Constructor	Description
RootFinder()
RootFinder(double tolerance, int maxIterations)

Method Summary

Modifier and Type	Method	Description
double	bisection(DoubleUnaryOperator f, double a, double b)	Bisection method (guaranteed convergence if root exists in interval).
double	brent(DoubleUnaryOperator f, double a, double b)	Brent's method (combines bisection, secant, inverse quadratic).
double[]	findAllRoots(DoubleUnaryOperator f, double a, double b, int subdivisions)	Find all roots in an interval using subdivision.
double	newton(DoubleUnaryOperator f, DoubleUnaryOperator df, double x0)	Newton-Raphson method (fast quadratic convergence near root).
double	newtonNumerical(DoubleUnaryOperator f, double x0)	Newton-Raphson with numerical derivative.
double	secant(DoubleUnaryOperator f, double x0, double x1)	Secant method (superlinear convergence, no derivative needed).

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

RootFinder

public RootFinder(double tolerance,
 int maxIterations)

RootFinder

public RootFinder()

Method Details

bisection

public double bisection(DoubleUnaryOperator f,
 double a,
 double b)

Bisection method (guaranteed convergence if root exists in interval).

newton

public double newton(DoubleUnaryOperator f,
 DoubleUnaryOperator df,
 double x0)

Newton-Raphson method (fast quadratic convergence near root).

newtonNumerical

public double newtonNumerical(DoubleUnaryOperator f,
 double x0)

Newton-Raphson with numerical derivative.

secant

public double secant(DoubleUnaryOperator f,
 double x0,
 double x1)

Secant method (superlinear convergence, no derivative needed).

brent

public double brent(DoubleUnaryOperator f,
 double a,
 double b)

Brent's method (combines bisection, secant, inverse quadratic).

findAllRoots

public double[] findAllRoots(DoubleUnaryOperator f,
 double a,
 double b,
 int subdivisions)

Find all roots in an interval using subdivision.