mersenneforum.org Help about document for Msieve 1.38
 Register FAQ Search Today's Posts Mark Forums Read

 2008-10-29, 13:05 #2 jasonp Tribal Bullet     Oct 2004 5·709 Posts Msieve represents matrices by column, because they're built one column at a time; B is an array of ncols matrix columns, and each column is given an la_col_t structure. The la_col_t has two fields: - the count of sparse nonzero elements in that column - an array of 32-bit words to hold the row numbers containing a 1 for that column Rows are numbered from 0 to (nrows - 1), and the first num_dense_rows rows are considered dense. The array has one 32-bit word for each of the sparse rows (sorted by increasing row index), and then (num_dense_rows+31)/32 words where the nonzero dense rows are stored in packed (bitwise) form. Dense row i gets bit i in this latter array. QS matrices always have num_dense_rows = 0, and the same block Lanczos code is used by both QS and NFS. There is very little linear algebra documentation outside comments in the code, but the algorithm is exactly as described in Montgomery's initial paper. Last fiddled with by jasonp on 2008-10-29 at 13:07
 2008-10-30, 02:51 #3 Greenk12   Oct 2008 2·7 Posts Yes, I see. Thank you very much. Continue working.

 Similar Threads Thread Thread Starter Forum Replies Last Post frmky Msieve 3 2016-11-06 11:45 pxp Msieve 1 2013-02-28 14:56 burrobert Msieve 9 2012-10-26 22:46 em99010pepe Msieve 23 2009-09-27 16:13 masser Sierpinski/Riesel Base 5 83 2007-11-17 19:39

All times are UTC. The time now is 05:42.

Wed Aug 10 05:42:20 UTC 2022 up 34 days, 29 mins, 1 user, load averages: 1.10, 0.99, 1.01