Precision problem with matrix inversion
|
07-15-2015, 08:28 PM
(This post was last modified: 07-16-2015 02:58 PM by Anders.)
Post: #17
|
|||
|
|||
RE: Precision problem with matrix inversion
(07-15-2015 04:59 AM)cyrille de brébisson Wrote: Hello, So: 1) I suggest this is a bug in the RPN implementation 2) Solving linear equation system through a vector / matrix division is maybe the most basic linear algebraic function that an engineer or a student performs, so it needs to work also in RPN mode 3) HP matrix capable RPN calculators have been able to perform vector - matrix division correctly with sufficiently high precision for ~30 years until now with Prime (I know of HP 28C, HP 28S, 48SX, 50G), so of course it is possible to implement this correctly. These calculators had 2KBs+ of RAM (HP 28C had 2KB) and Prime have 3-4 magnitudes more RAM with 32MB. The "memory constraint" argument does not hold. 4) There are many books and papers written on algorithms to solve vector and matrix division (and matrix inversion) with sufficient precision ranging from O(n^2.3727) to O(n^3). There are also iterative models to improve the result until error < epsilon. In other words, this is a very well research and understood problem. Why would you use an O(n^4) algorithm? (O=Ordo) 5) Suggesting to use CAS mode, which is likely disabled in Exam mode, is not helpful for students if you want them to use RPN (or are you saying we should stop using RPN?) In general I think HP should thank users (like Maro) for bringing these cases to their attention and address it in an update. You are basically receiving free testing, helping you to make a better product. |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 3 Guest(s)