4 ms·

Are you sure newton's method or conjugate gradient isn't going to solve this problem?

• 0xfaded 9y ago
  They would, however the implementation is now reduced to something you'd happily copy and paste into a code base. Part of what's novel is how the iterative step size is chosen. The Distance function can be very shallow in some cases, so if one wanted to use a root finder it would probably be wise to use an off the shelf implementation.
  • eps 9y ago
    Numerical methods is an exceptionally well-researched area that saw lots of activity back when machines were weak and Fortran was the weapon of choice. It's more likely than not that what you discovered has been done before and/or it's trivially derived from a more generic algorihm. Your best bet would probably be to re-run your search (including academic papers and not just stackoverlow, which is an inch deep) and ask around and see what prior art will surface.
  • amelius 9y ago
    If you want to do it properly, then you'd have to describe how the number of significant digits of the result grows in the number of iterations.