object RootFinding
Root finding algorithms
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- RootFinding
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
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
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
- lazy val defaultMaxIter: Int
- lazy val eps: Double
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
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
Generic method to compute a root approximation x of a function f such that f(x) = 0 Wrapper for Brent's method
- fn
function
- x0
first root estimate
- x1
optional second root estimate such that [x0,x1] brackets x
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
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
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
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
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )