<br><br><br><br><div class="gmail_quote">On Wed, Feb 4, 2009 at 05:15, Neal Alexander <span dir="ltr"><<a href="mailto:wqeqweuqy@hotmail.com">wqeqweuqy@hotmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Array is no good man! Quad Tree matrices perform much nicer from what I've seen.<br>
<br>
I wrote some matrix stuff based on D. Stott Parker's "Randomized Gaussian elimination" papers (<a href="http://www.cs.ucla.edu/%7Estott/ge/" target="_blank">http://www.cs.ucla.edu/~stott/ge/</a>). He presents some recursive block based methods of solving without pivoting.<br>
<br>
I want to upload the full library to Hackage, but it'd be nice to have some people look through it before - mainly because i never took linear algebra heh. QuickCheck seems to be holding things together though.<br>
<br>
</blockquote></div><br><br>I read some of those papers and, yes, it is impressive. OTOH, I really need pivoting (some ill-conditioned matrices are expected), which they all claim to be hard to implement using quadtrees and I'm afraid that using RBTs might introduce other sources of error.<br>