[Numbers] Root finders

[Gilles]

Hello.

I'm pondering porting some of the root finders from CM's
org.apache.commons.math4.analysis.solvers
package.

The type of "solved" function would be

https://docs.oracle.com/javase/8/docs/api/java/util/function/DoubleUnaryOperator.html
(i.e. this code would be in a new module, that targets
Java 8+).
For the moment, I'd leave out specialized algorithms that
assumes more than a "plain" function (e.g. "NewtonRaphson",
which would require the "autodiff" module[1]).

Comments, suggestions?
Now would a good time to review the design:

https://git1-us-west.apache.org/repos/asf?p=commons-math.git;a=blob;f=src/main/java/org/apache/commons/math4/analysis/solvers/BaseAbstractUnivariateSolver.java


Regards,
Gilles

[1] https://issues.apache.org/jira/projects/NUMBERS/issues/NUMBERS-69


---------------------------------------------------------------------
To unsubscribe, e-mail: dev-***@commons.apache.org
For additional commands, e-mail: dev-***@commons.apache.org