HP-35’s x^y Why?
|
11-03-2021, 06:41 PM
Post: #38
|
|||
|
|||
RE: HP-35’s x^y Why?
(11-03-2021 05:46 PM)robve Wrote:(11-03-2021 03:43 PM)J-F Garnier Wrote: Rob, I can be interested by comparing math algorithms, but not by systematic denigrating. Sorry if I over-reacted (not usual for me), and the term 'denigrate' was maybe not the right one. But there was no rationale to judge the HP implementation worse (worst than Sharp?). The reason of the 125^(1/3) HP result was easy to check and quite obvious. (11-03-2021 05:46 PM)robve Wrote:For the record, this quote is from Albert, not me.(11-03-2021 03:43 PM)J-F Garnier Wrote: It can also be fooled to get it wrong Basically, I don't agree with you that a 'correct' y^x implementation must check that the x value is close to the reciprocal of an integer, to manage the case of odd nth-root of negative numbers. I understand that Sharp and others do it and give nice results, but it seems very artificial for me, and prone to wrong assumptions as Albert pointed out. It seems to me that having a y^(1/x) function is much more robust. J-F |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 2 Guest(s)