103 Commits

Author	SHA1	Message	Date
Gael Guennebaud	c4c70669d1	Big rewrite in the Sparse module: SparseMatrixBase no longer inherits MatrixBase. ... That means a lot of features which were available for sparse matrices via the dense (and super slow) implemention are no longer available. All features which make sense for sparse matrices (aka can be implemented efficiently) will be implemented soon, but don't expect to see an API as rich as for the dense path. Other changes: * no block(), row(), col() anymore. * instead use .innerVector() to get a col or row vector of a matrix. * .segment(), start(), end() will be back soon, not sure for block() * faster cwise product	2009-01-14 14:24:10 +00:00
Gael Guennebaud	5015e48361	Sparse module: add a more flexible SparseMatrix::fillrand() function ... which allows to fill a matrix with random inner coordinates (makes sense only when a very few coeffs are inserted per col/row)	2008-12-11 18:26:24 +00:00
Gael Guennebaud	86ccd99d8d	Several improvements in sparse module: ... * add a LDL^T factorization with solver using code from T. Davis's LDL library (LPGL2.1+) * various bug fixes in trianfular solver, matrix product, etc. * improve cmake files for the supported libraries * split the sparse unit test * etc.	2008-11-05 13:47:55 +00:00