I'm better then Newton (Method of Approximation)

Click For Summary
SUMMARY

The discussion centers on a Delphi program that demonstrates a new method of approximation which outperforms the Newton-Raphson method when calculating the square root of 2. The original method claims to find roots in a single step under specific conditions, highlighting that while Newton's method is widely regarded for its simplicity and versatility, specialized algorithms can outperform it in terms of iterations and CPU cycles. Participants recommend consulting "Numerical Recipes in C" for further insights and suggest exploring programming languages beyond Delphi.

PREREQUISITES
  • Understanding of the Newton-Raphson method for root finding
  • Familiarity with numerical approximation techniques
  • Basic knowledge of programming in Delphi
  • Awareness of algorithm performance metrics, such as iterations and CPU cycles
NEXT STEPS
  • Explore advanced numerical methods beyond Newton-Raphson
  • Learn about specialized algorithms for root finding
  • Study "Numerical Recipes in C" for practical algorithm implementations
  • Investigate programming languages suitable for numerical computing, such as Python or C++
USEFUL FOR

Mathematicians, software developers, and anyone interested in numerical methods and algorithm optimization will benefit from this discussion.

dr-dock
http://www.geocities.com/dr_physica/moa.zip

is a delphi program showing how my method of approxim outperforms/beats the Newton's one while looking for sqrt(2)

try the case A+B=2*sqrt(2) and see the magic!
 
Mathematics news on Phys.org
There are lots of algorithms which can "beat" the Newton-Raphson method if the only criterion is the number of iterations computed. Specifically, with some domain knowledge of the kind of problem you're trying to solve, a variety of more specialized algorithms can beat Newton's method in terms of CPU cycles performed. In general, though, Newton's method is simple and works on any function with a continuously defined first derivative.

I advise that you consult "Numerical Recipes in C." I also advise that you learn a better programming language than Delphi.

- Warren
 
I remember last semester my math teacher would occasionally mention the Newton method. It was always funny because he'd mean to just mention it but then would get caught up in this whole discourse on how it was probably the best algorithm ever and yada yada yada and all the sudden class is up and he's done nothing but talk about how amazing Newtons algorithm was. It was quite comicall really
 
Originally posted by chroot
There are lots of algorithms which can "beat" the Newton-Raphson method if the only criterion is the number of iterations computed. Specifically, with some domain knowledge of the kind of problem you're trying to solve, a variety of more specialized algorithms can beat Newton's method in terms of CPU cycles performed. In general, though, Newton's method is simple and works on any function with a continuously defined first derivative.

I advise that you consult "Numerical Recipes in C." I also advise that you learn a better programming language than Delphi.

- Warren
quite right.
but the special thing is that this one is my original invention and it finds the root in just one step almost analytically under special conditions.
 
SUre, there are better methods of approximation.

But for the sake of approximation, I'll use the Newton-Raphson method. :wink:
 

Similar threads

  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K