On Friday, 13 July 2018 at 16:20:30 UTC, jmh530 wrote:
On Tuesday, 10 July 2018 at 02:10:56 UTC, 9il wrote:
The algorigbms from https://github.com/JuliaNLSolvers are good
candidates. No plans to implement them for now, but PRs are
wellcome.
Another type of functionality that would be useful:
https://www.mathworks.com/help/matlab/ref/fzero.html
This can be done with a non-linear least squares, but I don't
think that's the most efficient method.
D's findRoot probably is the world's most efficient and robust
implementation. For single initial point fzero we can be
implemented as IEEE set binary search of second initial point x1
such that sign(f(x0)) != sign(f(x1)) plus D's findRoot.
