
19 Apr
2006
19 Apr
'06
7:45 a.m.
On Wed, 19 Apr 2006, Andrew U. Frank wrote:
it appears possible to define matrix operations like LU-decomposition, SVD, inverse etc. in a recursive fashion (see transpose in the prelude).
is this possible? has anybody code in haskell which does this (not asking for high performance here, more instructive value).
There is some code by Jan Skibinski called 'indexless linear algebra': http://www.haskell.org/haskellwiki/Libraries_and_tools/Mathematics