Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | it is now up to user of these Find* module to find and link to BLAS and/or ↵ | 2011-02-18 | |
| | | | | LAPACK | ||
* | * Find SuperLU also when it is installed without a superlu/ prefix | 2009-04-01 | |
| | | | | * Some more CoeffReturnType changes | ||
* | Big rewrite in the Sparse module: SparseMatrixBase no longer inherits ↵ | 2009-01-14 | |
| | | | | | | | | | | | | | | 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 | ||
* | add BLAS dependency in FindSuperLU.cmake | 2009-01-08 | |
| | |||
* | Several improvements in sparse module: | 2008-11-05 | |
| | | | | | | | | | * 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. | ||
* | * add cmake files to find (optional) supported libraries | 2008-10-20 | |
* add unit tests for sparse cholesky |