I'm better then Newton (Method of Approximation)

Click For Summary
The discussion centers on a Delphi program that claims to outperform Newton's method for approximating the square root of 2. The author asserts that their original method can find the root in one step under specific conditions, highlighting its efficiency compared to traditional algorithms. While acknowledging that specialized algorithms can outperform Newton's method in terms of iterations and CPU cycles, the general consensus is that Newton's method remains versatile for any function with a continuous first derivative. Participants also suggest consulting "Numerical Recipes in C" for further insights and recommend exploring programming languages beyond Delphi. The conversation emphasizes the balance between innovative methods and established algorithms in numerical approximation.
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 algorithim ever and yada yada yada and all the sudden class is up and he's done nothing but talk about how amazing Newtons algorithim 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:
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · 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