| Class | Description |
|---|---|
| Bracket | Root bracketing routines |
| Crenshaw | Algorithm from Jack Crenshaw |
| DekkerBrent |
Brent's root finder. Algorithm from "Basic Linear Algebra and Optimization classlib". |
| General | A class containing a common method used by some root methods. |
| LajBisect | The simplest possible routine... |
| LajHP | GAIS TODO |
| MolerBrent | Algorithm from Cleve Moler |
| NumLibCIntervalHalving |
Calculation of a single root in the equation f(x)=0, using the interval halving method.
Original source code: IntHalv.c in NUMLIBC |
| NumLibCInverseInterpolation |
Calculation of a single root in the equation f(x)=0, using inverse interpolation.
Original source code: inv_int.c in NUMLIBC |
| NumLibCOrdinaryFixpointIterationOrSteffensen |
Calculation of a single root in the equation
x = f(x) using fixed point iteration or Steffensen's method.
Original source code: ite_rate.c in NUMLIBC |
| NumLibCRegulaFalsi |
Calculation of a single root in the equation f(x)=0, using Regula-falsi type methods.
Original source code: reg_fals.c in NUMLIBC |
| NumLibCSecant |
This routine computes a simple root in the equation f(x)=0 using
the secant method. It is assumed that the root is in the range (a,b).
Original source code: se_cant.c in NUMLIBC |
| Pegasus | The King and the Anderson-Björck-King Methods, the Illinois Method |
| SecantBorland |
Original code: ROOTSEQU.INC, ROOTSEQU.PAS & SECANT.PAS from
"Turbo Pascal Numerical Methods ToolBox".
Copyright (c) 1986, 87 by Borland International, Inc. http://pascal.sources.ru/math/mathtool.htm |
| TestFunctions | A set of test functions for computing a root in the equation f(x)=0. |
| Delegate | Description |
|---|---|
| FunctionSolve |