This is the mail archive of the gcc-help@gcc.gnu.org mailing list for the GCC project.
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
Other format: | [Raw text] |
Oh wizened wizards,I have confronted with the same problem several years ago. It's about a LDPC(an error correct coding) code generator, very large sparse matrix like your case. And in most case, there are only 3 ones in an column. As I remember, a professor in Canada open his C source code, the idea is to use a cross linked list (a node has four neighbors, left, right, up, down). Search "LDPC source code" if you are interested it.
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
Thanks, Shenli
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |