Valentin Albillo's "Boldly Going... Going Back to the roots" now for the HP-41 !

[Vincent Weber]

(04-18-2024 07:30 PM)Thomas Klemm Wrote:  

(04-17-2024 10:32 AM)Vincent Weber Wrote:  I made a 15C version. While the 15C is a ground-breaking machine with MCODE complex stack routines, it does not do much better: 1min 20 seconds. Maybe because its processor is slower than the 41's by half.

Have you compared it to my program in (15C) Halley's Method?
Don't forget to remove the PSE-command in line 058.

It would be interesting to see your program.

I will try your program.
I wrote mine on the go15c precise emulator for Android. It does not allow to export memory, so it is difficult to type it again here. But basically I did the following:
-Start with Valentin's 35S program;
-Replace lettered registers with numbered ones (e.g X became 4 for the real part and .4 for the imaginary part)
-Everywhere you have a STO, replace it with something like: STO 6, Re<>Im, STO .6, Re<>Im
-Everywhere you have a RCL, replace it with: RCL .6, Re<>Im, CLX, RCL 6
-Replace the equations at the beginning with RPN code.
-Ignore recall arithmetics altogher: RCL* becomes RCL, then *
-Ignore the cosmetic ending about considering the a root is real if its imaginary part is very small. Pointless with the 15C display capabilities.

Of course this is not optimized compared to a native 15C program!

Cheers