[Haskell-cafe] Purely funcional LU decomposition

[Rafael Gustavo da Cunha Pereira Pinto]

On Wed, Feb 4, 2009 at 19:14, Dan Piponi <dpiponi at gmail.com> wrote:

> On Wed, Feb 4, 2009 at 12:57 PM, Rafael Gustavo da Cunha Pereira Pinto
> <RafaelGCPP.Linux at gmail.com> wrote:
>
> > Those different representations are derived from my (very) low Haskell
> > handicap! :-D
>
> BTW That wasn't intended in any way as a criticism. I think it's


Not taken!


>
> interesting to look at real matrix code that people have written and
> think about what would be needed in a library to make it easier to
> write.
> --
> Dan
>

What I miss most is a data structure with O(1) (amortized) direct access.

One of the changes I thought today was to remove the ++ operator and create
a list of lists that I would concat in the last call.

-- 
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20090204/3663ed2f/attachment.htm