RootFinding

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def bisection(fn: (Double) ⇒ Double, a: Double, b: Double): Double

Bisection bracketing method with linear convergence

def brent(fn: (Double) ⇒ Double, a: Double, b: Double): Double

Implementation of Brent root-finding algorithm Brent, R., Algorithms for Minimization Without Derivatives, Prentice-Hall, 1973.

def clone(): AnyRef

lazy val defaultMaxIter: Int

lazy val eps: Double

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def find(fn: (Double) ⇒ Double, x0: Double, x1: Option[Double] = None): Double

Generic method to compute a root approximation x of a function f such that f(x) = 0 Wrapper for Brent's method

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def newtonRaphson(fn: (Double) ⇒ Double, fd: (Double) ⇒ Double, x0: Double, maxIter: Int = defaultMaxIter): Double

Newton-Raphson's open method with quadratic convergence (requires the derivative and a limited number of iterations to cope with divergence)

final def notify(): Unit

final def notifyAll(): Unit

def secant(fn: (Double) ⇒ Double, x0: Double, x1: Double, maxIter: Int = defaultMaxIter): Double

Secant method (based on a linear approximation of the derivative between successive pair of points)

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit