Talk:LU decomposition: Difference between revisions
Content added Content deleted
(→Problems in solution: new section) |
|||
| Line 55: | Line 55: | ||
::Addition: the VBA code, while not incorrect per se with this modification, is still awfully inefficient (one matrix multiply for each pivot!). All the code needs to be changed. [[User:Eoraptor|Eoraptor]] ([[User talk:Eoraptor|talk]]) 13:51, 15 August 2020 (UTC) |
::Addition: the VBA code, while not incorrect per se with this modification, is still awfully inefficient (one matrix multiply for each pivot!). All the code needs to be changed. [[User:Eoraptor|Eoraptor]] ([[User talk:Eoraptor|talk]]) 13:51, 15 August 2020 (UTC) |
||
== Problems in |
== Problems in solutions == |
||
After correcting the VBA code, I noticed the Ada, C++ and Lisp codes have the same problem, and probably others as well: when selecting the maximum pivot, it's necessary to get the absolute value, otherwise the zero pivot will be selected if it's the only nonnegative element in the possible choices. This is a **bug**. |
After correcting the VBA code, I noticed the Ada, C++ and Lisp codes have the same problem, and probably others as well: when selecting the maximum pivot, it's necessary to get the absolute value, otherwise the zero pivot will be selected if it's the only nonnegative element in the possible choices. This is a **bug**. |
||