Hi Dean - This isn't really the right list for this. My suggestion would be to ask on the boost ublas mailing list. I know that the ublas library supports sparse matrices, though it may not be the most efficient library out there; perhaps someone on that list can give you a good suggestion. Also, it depends on how sparse sparse is, whether it will fit in your memory constraints or not :) Brian On Fri, Apr 16, 2010 at 3:24 PM, Dean Anderson <dean@xxxxxxx> wrote: > Oh wizened wizards, > > Does anyone know of a c/c++ sparse matrix code that handle a 20,000 x > 20,000 adjacency matrix? Probably only 3 ones in an average column. > > I just need to compute X^n where n is from 2 to 8. > > Or is this just entirely unreasonable to do in a couple gigs of memory? > (gcc 4.x, Linux x86) > > Thanks, > > --Dean > > -- > Av8 Internet Prepared to pay a premium for better service? > www.av8.net faster, more reliable, better service > 617 256 5494 > > >
