Posts: 653
Threads: 26
Joined: Aug 2010
I admit I am amazed at the speed of the 34s Matrix functions - even a 10x10 random matrix is inverted in fractions of a second (approx. 0,7×n3 ms on my hardware). That's roughly as fast as some transcendental functions on earlier HPs like the 67/97.
I remember a table with the execution times of most 67/97 functions, given in milliseconds, somewhere in a HP related magazine or journal. I am sure I must have stored it somewhere on some harddrive, but I cannot seem to find it. Maybe someone can help and tell me where to find this info?!
Dieter
Posts: 349
Threads: 66
Joined: Apr 2007
Quote:
I remember a table with the execution times of most 67/97 functions, given in milliseconds, somewhere in a HP related magazine or journal. I am sure I must have stored it somewhere on some harddrive, but I cannot seem to find it. Maybe someone can help and tell me where to find this info?!
Hi,
One of these appeared in PPC's "Better Programming On The HP67/97" publication, which was sent to members roughly in June of 1978, around the time of Volume 5, Number 5 of the PPC Journal. The table appears in pages 27-29.
Jake
Posts: 3,229
Threads: 42
Joined: Jul 2006
Quote:
I admit I am amazed at the speed of the 34s Matrix functions - even a 10x10 random matrix is inverted in fractions of a second (approx. 0,7×n3 ms on my hardware). That's roughly as fast as some transcendental functions on earlier HPs like the 67/97.
The surprising thing is I'm not using a particularly efficient algorithm for matrix inversion. A Doolittle LU decomposition with partial pivoting followed by solving lots of equations.
- Pauli
Posts: 653
Threads: 26
Joined: Aug 2010
Ah, thank you - now I know what to look for. I think I have a PDF of this. It must be somewhere deep down in some sub-sub-sub-folder... :-)
Dieter
