Anonymous user
Talk:Determinant and permanent: Difference between revisions
m
Maknongan moved page Talk:Matrix arithmetic to Talk:Determinant and permanent: "Matrix arithmetic" would generally refer to something other than determinants (e.g., matrix products, sums, scalar multiplication, polynomials).
(random thoughts) |
m (Maknongan moved page Talk:Matrix arithmetic to Talk:Determinant and permanent: "Matrix arithmetic" would generally refer to something other than determinants (e.g., matrix products, sums, scalar multiplication, polynomials).) |
||
| (2 intermediate revisions by 2 users not shown) | |||
Line 10:
::: 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)
== Why "arithmetic"? ==
I don't get what this task has to do with arithmetic. Isn't it about invariants of a matrix, or something like that?--[[User:Grondilu|Grondilu]] 16:38, 5 January 2013 (UTC)
== FORTRAN parallel effort ==
Please credit additional contributors from
[http://forums.devshed.com/other-programming-languages-139/fortran-parallel-945576.html#post2878816]
--LambertDW 20:45, 21 May 2013 (UTC)
| |||