On Convergence Rates of Root-Seeking Methods
|
03-12-2018, 04:08 PM
Post: #37
|
|||
|
|||
RE: On Convergence Rates of Root-Seeking Methods
(03-11-2018 09:06 PM)Mike (Stgt) Wrote:(03-11-2018 02:26 PM)Claudio L. Wrote: * Newton-Raphson Almost every method has an implementation using some variant of difference formulae to replace the derivatives and come up with a workable algorithm. I'm not planning to reinvent the wheel, I'll research what's already being used and go with it. I even looked at some promising 16th order methods but I'm not so sure how tight is the convergence radius, it might need other methods to get the first few digits, then a few iterations of those methods can quickly give you a lot of digits. |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)