Papers
Topics
Authors
Recent
Search
2000 character limit reached

A novel Newton-Raphson style root finding algorithm

Published 1 Sep 2023 in math.NA and cs.NA | (2309.00698v1)

Abstract: Many problems in applied mathematics require root finding algorithms. Unfortunately, root finding methods have limitations. Firstly, regarding the convergence, there is a trade-off between the size of it's domain and it's rate. Secondly the numerous evaluations of the function and its derivatives penalize the efficiency of high order methods. In this article, we present a family of high order methods, that require few functional evaluations ( One for each step plus one for each considered derivative at the start of the method), thus increasing the efficiency of the methods.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.