Talk:Determinant and permanent: Difference between revisions
random thoughts
(→Method used: Algo' rather than style.) |
(random thoughts) |
||
Line 8:
::Hi CRGreathouse, it wasn't so much the style that I wanted clarification on, but the algorithm to be implemented. On RC there are a whole suite of sort tasks - they all do the same thing, just with different algorithms. Similarly, when made aware of the signed permutation method of calculating a determinant via this task and its links, (my thanks), I thought there maybe room for something similar? --[[User:Paddy3118|Paddy3118]] 06:14, 28 July 2012 (UTC)
::: I think some of these "differences of algorithm" would go away if we thought of multiplication as being a short circuit operator (that could prune entire recursive call trees when one of the values being multiplied was zero). Another thing that might help would be re-expressing the algorithm using something other than a "sequence over time loop" to organize the recursive expansion of minors (or at least: allowing rephrasings which ignore the limitations of ieee floating point. That said, a little focus on re-expressing using equivalencies (and searching for likely zeros) does seem like a good subject when dealing with alternative algorithms.. --[[User:Rdm|Rdm]] 13:29, 30 July 2012 (UTC)
| |||