Calculating e^x1 on classic HPs

01152016, 10:45 PM
Post: #32




RE: Calculating e^x1 on classic HPs
(01152016 06:46 PM)Dieter Wrote:(01152016 06:07 PM)Gerson W. Barbosa Wrote: I'm currently running this on an ordinary 12C and Dieter's program on a 12C+, so I cannot compare speeds, but Dieter's should be slightly faster because it requires no tests. So, it's better to stick as close as possible to the modified original algorithm: Code:
Code:
I'd imagined the final multiplication by x might be an issue, as you've pointed out, but in my (few) tests I didn't find significant differences compared to your results. The program is now two stpes longer and slightly slower than the previous one. Anyway, a good exercise after two cups of cheap Argentinian wine (they're still better than our finest ones :) Quoting Professor Kahan, as found in the book, perhaps applied to your proposed method: "There will always be a small but steady demand for erroranalysts to ... expose bad algorithms' big errors and, more important, supplant bad algorithms with provably good ones.  WILLIAM M. KAHAN, Interval Arithmetic Options in the Proposed IEEE Floating Point Arithmetic Standard (1980)" Gerson. 

« Next Oldest  Next Newest »

User(s) browsing this thread: 1 Guest(s)