Calculating e^x1 on classic HPs

01122016, 06:30 PM
(This post was last modified: 01122016 07:48 PM by Dieter.)
Post: #7




RE: Calculating e^x1 on classic HPs
(01122016 03:34 PM)ElectroDuende Wrote:(01122016 05:13 AM)Claudio L. Wrote: Question is: would a program computing terms of the power series in a loop be faster? An iterative approach on such a classic calculator would be much slower and require more memory than the suggested method. The two transcendental functions are evaluated faster (and each in one single line of code) than, say, 12 loops of a power series (for 10digit accuracy), plus the required overhead. Addendum: I just tried the CF approach in a program for the 41 series. Ten digits require just four loops, but nevertheless the program needs > 3 seconds for the calculation. Compared to this, the method suggested in my initial post returns its result in less than a second – and occupies only 1/3 of the memory. Dieter 

« Next Oldest  Next Newest »

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