Regula Falsi method.
Like the Regula Falsi method, convergence is guaranteed by maintaining a bracketed solution. The Illinois method however, should converge much faster than the original Regula Falsi method. Furthermore, this implementation of the Illinois method should not suffer from the same implementation issues as the Regula Falsi method, which may fail to convergence in certain cases.
The Illinois method assumes that the function is continuous, but not necessarily smooth.
Implementation based on the following article: M. Dowell and P. Jarratt, A modified regula falsi method for computing the root of an equation, BIT Numerical Mathematics, volume 11, number 2, pages 168-174, Springer, 1971.
| Access | Constructor and Description |
|---|---|
| public | |
| public | |
| public | IllinoisSolver(final double
Relative accuracy. relativeAccuracy, final double Absolute accuracy. absoluteAccuracy)Construct a solver. |
| public | IllinoisSolver(final double
Relative accuracy. relativeAccuracy, final double Absolute accuracy. absoluteAccuracy, final double Maximum function value error. functionValueAccuracy)Construct a solver. |
| IllinoisSolver | back to summary |
|---|---|
| public IllinoisSolver() Construct a solver with default accuracy (1e-6). | |
| IllinoisSolver | back to summary |
|---|---|
| public IllinoisSolver(final double absoluteAccuracy) Construct a solver.
| |
| IllinoisSolver | back to summary |
|---|---|
| public IllinoisSolver(final double relativeAccuracy, final double absoluteAccuracy) Construct a solver.
| |
| IllinoisSolver | back to summary |
|---|---|
| public IllinoisSolver(final double relativeAccuracy, final double absoluteAccuracy, final double functionValueAccuracy) Construct a solver.
| |