Talk:Reduced row echelon form: Difference between revisions
m
no edit summary
No edit summary |
mNo edit summary |
||
| (One intermediate revision by one other user not shown) | |||
Line 62:
system clearly has no solution (the last equation requires that x, y and z satisfy 0x+0y+0z = −3,<br>
and no such numbers exist). Hence the original system has no solution.<br> [[User:Umariani|Umariani]]
:The algorithm does not have a bug. Failure to check conditions is not part of the algorithm, it is part of the implementation. That is just a degenerate case.
:A few points:
:# The task does not require checking for degenerate cases.
:# Even if it did, you gave no indication of which implementation fails on degenerate cases.
:# What should the implementation do in the case of a "failure"? Error message? Warning? Or just precede as far as possible? (Which is what the [[Reduced_row_echelon_form#Raku|Raku]] implementation does.)
: ''By the way, please sign your discussion page edits.'' --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 12:38, 20 July 2023 (UTC)
:: The algorithm is useful for solving a system of linear equations, but a reduced row echelon form can be made even if there is no such solution! The reduced form of the system
<pre>
3 1 -4 -1
1 0 10 5
4 1 6 1
is
1 0 10 0
0 1 -34 0
0 0 0 1
</pre>
--[[User:Wherrera|Wherrera]] ([[User talk:Wherrera|talk]]) 20:14, 20 July 2023 (UTC)
=="Break" vs. "return" bug==
| |||