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