(SR-56) Programmieren mit dem Taschenrechner SR-56
|
09-16-2024, 07:15 PM
(This post was last modified: 09-16-2024 09:09 PM by Thomas Klemm.)
Post: #11
|
|||
|
|||
RE: (SR-56) Programmieren mit dem Taschenrechner SR-56
Cubic equation \(x^3 + ax^2 + bx + c = 0\)
A real root is calculated using Newton's approximation method. Then the roots \(x_2\) and \(x_3\) are calculated from the quadratic equation \(x^2 + px + x = 0\) with \(p = a + x_1\) and \(q = x_1^2 + a x_1 + b\). This is a translation of the program on page 108 for the HP-25: Code: 01: 24 00 : RCL 0 ; x_i Examples Set degree of accuracy: EEX -6 STO 6 \(x^3 -19x^2 + 81x + 101 = 0\) \(x_0 = 1\) 1 STO 0 -19 STO 1 81 STO 2 101 STO 3 f CLEAR PRGM R/S -1.000000000 R/S 10.00000000 x<->y 1.000000000 \( \begin{align} x_1 &= -1 \\ x_2 &= 10 + i \\ x_3 &= 10 - i \\ \end{align} \) \(x^3 -13x^2 + 20x + 100 = 0\) \(x_0 = 2\) 2 STO 0 -13 STO 1 20 STO 2 100 STO 3 f CLEAR PRGM R/S 5.000000000 R/S 10.00000000 x<->y -1.999999999 \( \begin{align} x_1 &= 5 \\ x_2 &= 10 \\ x_3 &= -2 \\ \end{align} \) It is interesting that we can squeeze the 86 unmerged steps of the SR-56 into the 49 maximum steps of the HP-25. It seems to me that the quality of these programs is better than that of the Applications Library. For examples, compare "Greatest Common Divisor/Least Common Multiple" with "Größter gemeinsamer Teiler und kleinstes gemeinsames Vielfaches". Or then "First Order Differential Equations" with "Runge-Kutta-Verfahren für Differentialgleichungen 1. Ordnung": the latter uses 4th order while the former uses only 3rd order. |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 2 Guest(s)