Talk:Reduced row echelon form: Difference between revisions
Content added Content deleted
m (bugfix for →Bug in Common Lisp code) |
No edit summary |
||
| Line 244: | Line 244: | ||
</pre> |
</pre> |
||
In contrast, the code from http://ic.ucsc.edu/~ptantalo/math21/Winter07/GaussJordan.java works fine even though it does not implement the pivot stuff. Moreover, this code is understandable since it is not using crap functions like "break" and "continue" in loops which make code unreadable and error prone. |
In contrast, the code from http://ic.ucsc.edu/~ptantalo/math21/Winter07/GaussJordan.java works fine even though it does not implement the pivot stuff. Moreover, this code is understandable since it is not using crap functions like "break" and "continue" in loops which make code unreadable and error prone. |
||
== Bug in maxima code == |
|||
For example, it fails with the following matrix: |
|||
<pre> |
|||
1 1 1 1 1 |
|||
0 1 1 1 1 |
|||
0 0 0 0 1 |
|||
</pre> |
|||
rref produces: |
|||
<pre> |
|||
1 0 0 0 0 |
|||
0 1 1 1 1 |
|||
0 0 0 0 1 |
|||
</pre> |
|||
The leading coefficient in the (3, 5)-th position is not the only nonzero element in its column. |
|||