The Museum of HP Calculators

HP Forum Archive 17

[ Return to Index | Top of Index ]

New Root Seeking Algorithms
Message #1 Posted by Namir on 7 Nov 2007, 7:18 p.m.

I have been working on a pair of similar root-seeking algorithms in the past few weeks. I finished writing an article (click here) that describes the algorithms (which I name the Probing Slopes Algorithms and Probing Steps Algorithm) and compares them with Newton's method. My article also includes three test functions used to compare the new algorithms with Newton's method, using Excel VBA. I am excited to report that the new algorithms find the root in fewer loops and also make fewer function calls than Newton's method.

Namir

PS: Based on the feedback of kind folks on this web site, you will need to use FireFox to view the article's text AND figures. some how, Microsoft IE does not show the images.

Edited: 8 Nov 2007, 12:36 p.m. after one or more responses were posted

      
Re: New Root Seeking Algorithms
Message #2 Posted by BruceH on 8 Nov 2007, 3:53 a.m.,
in response to message #1 by Namir

Hi Namir,

Following the link I see your article but none of the figures.

Regards,

            
Re: New Root Seeking Algorithms
Message #3 Posted by Namir on 8 Nov 2007, 8:57 a.m.,
in response to message #2 by BruceH

Bruce,

I checked the site on two different laptops (which do not have the source files) at home and was able to see the figures. I will ask a few friends to see if they have the same problem you are having.

Namir

                  
Re: New Root Seeking Algorithms
Message #4 Posted by Stefan Vorkoetter on 8 Nov 2007, 9:13 a.m.,
in response to message #3 by Namir

FWIW, I can see the figures.

Stefan

                        
Re: New Root Seeking Algorithms
Message #5 Posted by Damir on 8 Nov 2007, 9:18 a.m.,
in response to message #4 by Stefan Vorkoetter

Me too.

Damir

                              
Re: New Root Seeking Algorithms
Message #6 Posted by Meenzer on 8 Nov 2007, 9:56 a.m.,
in response to message #5 by Damir

See 'em... (with Firefox, but not with Internet Explorer engine)

Edited: 8 Nov 2007, 11:04 a.m.

      
Re: New Root Seeking Algorithms
Message #7 Posted by Steve Cote on 8 Nov 2007, 9:31 a.m.,
in response to message #1 by Namir

I can't see the figures :(

      
Re: New Root Seeking Algorithms
Message #8 Posted by Bill (Smithville, NJ) on 8 Nov 2007, 11:02 a.m.,
in response to message #1 by Namir

Namir,

I can the the figues in Firefox but cannot see them in Microsoft Intenet Explorer 7.0.

Bill

            
Re: New Root Seeking Algorithms
Message #9 Posted by Damir on 8 Nov 2007, 11:09 a.m.,
in response to message #8 by Bill (Smithville, NJ)

Yes, I can see them in Firefox.

Damir

            
Re: New Root Seeking Algorithms
Message #10 Posted by Kiyoshi Akima on 8 Nov 2007, 12:10 p.m.,
in response to message #8 by Bill (Smithville, NJ)

I see them in Opera but not Internet Explorer.

            
Re: New Root Seeking Algorithms
Message #11 Posted by Namir on 8 Nov 2007, 12:34 p.m.,
in response to message #8 by Bill (Smithville, NJ)

Bill,

Ok, I can see it with Firefox but not MS IE. This is very interesting, because I created the text using MS Word and then copied it to Microsoft Web Expressio--both MS products!!!

I will have to create a new copy of the article that I assemble with a simple text editor and insert fewer HTML tags. This will take a few days, so please be patient. In the mean time, use FireFox to view the article.

Namir

                  
Re: New Root Seeking Algorithms
Message #12 Posted by Dave Shaffer (Arizona) on 8 Nov 2007, 5:20 p.m.,
in response to message #11 by Namir

Netscape 8.1.3 shows the images with no problem. In the "about" dropdown, it says "based on Firefox" so Firefox seems to be the magic key! (Just another reason to dislike Micro$oft.)

PS Namir - Met your son at an NAU event a couple of weeks ago. He saw my name on my nametag and recognized it - from our discussion at HHC2007 which I guess you must have told him about!!

Edited: 8 Nov 2007, 5:21 p.m.

      
Re: New Root Seeking Algorithms
Message #13 Posted by Frank Rottgardt on 8 Nov 2007, 3:29 p.m.,
in response to message #1 by Namir

Hi Namir,

have not gone through you article in detail. For some days ago I have read some interesting articles about safeguarded root finding. A lot of thinking needs to be invested to make a root finder as bulletproof as possible. And Newtons method used to be quick, but has its pitfalls. How about yours?

Here are some articles which might be of interest. Would be cool to see how your algorithm copes with these tricky functions mentioned in the articles.

Have fun and let us know about the results of your further testing.

// Frank

First hand information about the very first HP-solver (page 20)

[link:http://www.cs.berkeley.edu/~wkahan/Math128/RealRoots.pdf ]Some serious stuff about root finding[/link]

Another article comparing root finding methods

            
Re: New Root Seeking Algorithms
Message #14 Posted by Namir on 8 Nov 2007, 3:54 p.m.,
in response to message #13 by Frank Rottgardt

Thanks Frank. Will do!

Namir


[ Return to Index | Top of Index ]

Go back to the main exhibit hall