HP-25 vs. SR-56 - HHC 2016 Follow-up
|
10-10-2016, 02:41 PM
(This post was last modified: 10-10-2016 05:19 PM by SlideRule.)
Post: #21
|
|||
|
|||
RE: HP-25 vs. SR-56 - HHC 2016 Follow-up
ALL
OK, as plain as possible - YES, all things equal, I will take 100 program steps over 50 program steps, merged or unmerged, period. However, the inclusion of differing models with nonequivalent functions muddles the comparison of HP's & TI's of that era. As I said, the inference is ANY program memory but then reverts to models with differing function sets. HUH? Would I choose a 29c over a 25c based strictly on available memory? Maybe. Would I choose a 29c over a 25c based on memory and functionality? Absolutely! I find the stats references simply add to the muddling since the program listings include functionality absent in one of the models under comparison. Would I choose one model over another based on memory AND functionality? Of course. There is a lot of "give me" in the all things equal clause. I stand firm on the position that I can always exceed the 1:1 keys per memory ratio on a merged memory machine while I can never exceed it on an unmerged memory machine. That flexible buffer is true value added (ie try comparing a TI57 w the HP25). BEST! SlideRule |
|||
10-13-2016, 12:34 PM
Post: #22
|
|||
|
|||
RE: HP-25 vs. SR-56 - HHC 2016 Follow-up
(10-12-2016 01:54 PM)moonbeam Wrote: Apropos, I used to own a couple of German TI-59 programming booklets. "Booklets"? Not regular books? (10-12-2016 01:54 PM)moonbeam Wrote: Does anybody remember a series that included titles on game programming (mini-max strategies) and polynomial approximations (that one went into some detail about Chebyshev polynomials)? I have a vague and perhaps mistaken recollection that the publisher was CHIP; it must have been in the late 70s or early 80s. That's exactly the time I read "Chip", but I cannot remember any books on programmable calculators – otherwise I would have bought them. ;-) So all I got from "Chip" are the two A4 sized "Programme" 1 and 2 books that also contained a few programs for (mostly) TI58/59 and the one or other for HPs. I now assume that you refer to the situation in Germany back then. It is well possible that the books you remember were part of another publisher's series on programmable calculators. For instance "Anwendung programmierbarer Taschenrechner" by Vieweg Verlag, containing 26 different titles. Vieweg also issued "Programmbibliothek Taschenrechner" (10 titles). And then Oldenburg Verlag had a series on programmable calculators. I think you should take a look at the two Vieweg series, they may contain what you are looking for. Google books has the complete Vieweg catalog from 1786–1986. Page 11 has a complete list with all books of the "Anwendung programmierbarer Taschenrechner" series, page 516 contains the list for "Programmbibliothek Taschenrechner". Or simply do a search for "Taschenrechner" within that catalog. Dieter |
|||
10-13-2016, 08:04 PM
Post: #23
|
|||
|
|||
RE: HP-25 vs. SR-56 - HHC 2016 Follow-up
from the sources references
VIEWEG Code:
Code:
Code:
I have many of these title in my library. Any particular program of interest? BEST! SlideRule |
|||
10-13-2016, 11:49 PM
(This post was last modified: 10-14-2016 01:54 PM by SlideRule.)
Post: #24
|
|||
|
|||
RE: HP-25 vs. SR-56 - HHC 2016 Follow-up
(10-13-2016 10:02 PM)moonbeam Wrote: Numerische Mathematik: Programme für den TI 59 (Anwendung programmierbarer Taschenrechner) (ISBN 9783528141714) Inhaltsverzeichnis 0 Einführung 0.1 Der Rechner Tl 59 0.2 Eingabe von Programmen 0.3 Magnetkarten 1 Matrizen 1.1 Produktsumme 1.2 Matrizenprodukt 2 Lineare Gleichungen und Ungleichungen 2.1 Der Algorithmus von Gauß 2.2 Der Gaußalgorithmus mit Pivotsuche 2.3 Die LR-Zerlegung 2.4 Die LR-Zerlegung mit Pivotsuche 2.5 Inversion mit totaler Pivotsuche 2.6 Die Cholesky-Zerlegung 2.7 Die OR-Zerlegung und vermittelndes Ausgleichen 2.8 Zyklische Relaxation 2.9 Methode des stiirksten Abstiegs 2.10 Lineare Optimierung 3 Iteration 3.1 Vektoriteration nach von Mises 3.2 Inverse Iteration 3.3 Der LR-Algorithmus 3.4 Iteration in einer Variablen 3.5 Steffensen-Iteration 3.6 Das Newton-Verfahren 3.7 Regula falsi 3.8 Das Horner-Schema 3.9 Das erweiterte Horner-Schema 3.10 Einfache Nullstellen von Polynomen 3.11 Das Verfahren von Bairstow 3.12 Das Bernoulli-Verfahren 3.13 Das inverse Bernoulli-Verfahren 3.14 Der QD-Algorithmus für tridiagonale Matrizen 3.15 Der OD-Algorithmus für Polynome 4 Interpolation und diskrete Approximation 4.1 Lagrange-Interpolation 4.2 Das Schema von Neville 4.3 Entwickeln nach Tschebyscheff-Polynomen 4.4 Ökonomisieren eines Polynoms 4.5 Methode der kleinsten Quadrate 4.6 Der Algorithmus von Clenshaw 4.7 De Casteljau 4.8 Bézier-Kurve 4.9 Interpolation durch kubische Splines 5 Numerische Differentiation und Integration 5.1 Numerische Differentiation 5.2 Sehnentrapezsumme 5.3 Romberg-Integration 5.4 Das Eulersche Polygonzugverfahren 5.5 Das Verfahren von Heun 5.6 Das klassische Runge-Kutta-Verfahren 5.7 Einschrittverfahren mit Schrittweitensteuerung 5.8 Die Mittelpunktsregel Literatur Verzeichnis der behandelten Probleme BEST! SlideRule |
|||
10-14-2016, 02:00 PM
(This post was last modified: 10-14-2016 11:50 PM by SlideRule.)
Post: #25
|
|||
|
|||
RE: HP-25 vs. SR-56 - HHC 2016 Follow-up | |||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)