|Re: Iteration on 33s or 35s?|
Message #2 Posted by Karl Schneider on 30 Oct 2007, 12:46 a.m.,
in response to message #1 by Howard Boardman
It sounds as though you are melding two different things:
- Polynomials having an order n and one variable for n possible roots (solutions)
- Multi-variable equations
However, I'm fairly sure that I know the gist of your question: You're wondering why you always get the same result when solving for the only unspecified variable, which appears only once in the equation.
The answer is that the HP-33s and HP-35s will provide a "direct solution" determined by internal algebraic methods, in cases where it deems possible. They will ignore your two initial guesses to provide this direct solution. This flawed logic was borrowed from the solver in the HP-19B/II and HP-27S.
The workaround is to add a mathematically inert term such as "+0*X" to the equation in order to trick the calculator into concluding that the equation is algebraically intractable. Then, it will use numerical iteration with your initial guesses.
An archived thread and an article:
HP SOLVE-INTEG on all RPN-based models
As for the last part of your query: There may be an infinite number of solutions for a single multi-variable equation. Solution for multi-input, multi-output systems of equations is not supported by the HP-33s or HP-35s. An HP-50g can be used for that purpose.
Edited: 30 Oct 2007, 1:27 a.m. after one or more responses were posted