Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Remove Sparse/InnerVectorSet expression in favor of a more general Block<> ↵ | Gael Guennebaud | 2012-11-16 |
| | | | | | | specialization for Sparse expression. The specializations for "InnerPanels" are still preserved for efficiency reasons and because they offer additional usefull features. | ||
* | Fix aliasing issue in sparse matrix assignment. | Gael Guennebaud | 2012-07-25 |
| | | | | (m=-m; or m=m.transpose(); with m sparse work again) | ||
* | bug #449: add SparseMatrix::conservativeResize feature | Benjamin Piwowarski | 2012-07-19 |
| | |||
* | Automatic relicensing to MPL2 using Keirs script. Manual fixup follows. | Benoit Jacob | 2012-07-13 |
| | |||
* | fix some compilation errors with ICC and -strict-ansi | Gael Guennebaud | 2012-01-31 |
| | |||
* | add the possibility to assemble a SparseMatrix object from a random list of ↵ | Gael Guennebaud | 2012-01-28 |
| | | | | triplets that may contain duplicated elements. It works in linear time, with O(1) re-allocations. | ||
* | fix compilation of sparse_basic unit test for complexes | Gael Guennebaud | 2011-12-23 |
| | |||
* | fix bug #394: innerVector::nonZeros() was broken for uncompressed mode | Gael Guennebaud | 2011-12-20 |
| | |||
* | fix bug #294: add a diagonal() method to SparseMatrix (const) | Gael Guennebaud | 2011-12-04 |
| | |||
* | fix bug #356: fix TriangularView::InnerIterator for unit diagonals | Gael Guennebaud | 2011-12-04 |
| | |||
* | add ReverseInnerIterators to loop over the elements in reverse order, | Gael Guennebaud | 2011-12-03 |
| | | | | and partly fix bug #356 (issue in trisolve for upper-column major)) | ||
* | Sparse matrix insertion: | Gael Guennebaud | 2011-12-02 |
| | | | | | - automatically turn a SparseMatrix to uncompressed mode when calling insert(i,j). - now coeffRef insert a new element when it does not already exist | ||
* | move DynamicSparseMatrix to SparseExtra | Gael Guennebaud | 2011-10-24 |
| | |||
* | add the possibility to reserve room for inner vector in SparseMatrix | Gael Guennebaud | 2011-09-08 |
| | |||
* | the min/max macros to detect unprotected min/max were undefined by some std ↵ | Gael Guennebaud | 2011-08-19 |
| | | | | | | header, so let's declare them after and do the respective fixes ;) | ||
* | Sparse: more fixes regarding long int as index type | Gael Guennebaud | 2011-06-07 |
| | |||
* | extend sparse product unit tests | Gael Guennebaud | 2011-03-22 |
| | |||
* | new feature: copy from a sparse selfadjoint view to a full sparse matrix | Gael Guennebaud | 2010-11-15 |
| | |||
* | Additional fix to enforce the compiler to use the correct prunning method. | Hauke Heibel | 2010-11-02 |
| | |||
* | Initial fixes for bug #85. | Hauke Heibel | 2010-10-25 |
| | | | | | | | Renamed meta_{true|false} to {true|false}_type, meta_if to conditional, is_same_type to is_same, un{ref|pointer|const} to remove_{reference|pointer|const} and makeconst to add_const. Changed boolean type 'ret' member to 'value'. Changed 'ret' members refering to types to 'type'. Adapted all code occurences. | ||
* | bug #86 : use internal:: namespace instead of ei_ prefix | Benoit Jacob | 2010-10-25 |
| | |||
* | fix SparseView: clean the nested matrix type | Gael Guennebaud | 2010-07-22 |
| | |||
* | Utilize Index in all unit tests. | Hauke Heibel | 2010-06-20 |
| | |||
* | split the Sparse module into multiple ones, and move non stable parts to ↵ | Gael Guennebaud | 2010-06-18 |
| | | | | | | unsupported/ (see the ML for details) | ||
* | clean the ambiguity with insertBack and add a insertBackByOuterInner function | Gael Guennebaud | 2010-06-02 |
| | |||
* | merge with default branch | Gael Guennebaud | 2009-12-22 |
|\ | |||
* | | a lot of cleaning and fixes | Gael Guennebaud | 2009-12-16 |
| | | |||
| * | Added to possibility to compile unit tests at maximum warning level. | Hauke Heibel | 2009-12-12 |
|/ | | | | Silenced (amongst others) many conversion related warnings. | ||
* | big huge changes, so i dont remember everything. | Benoit Jacob | 2009-10-28 |
| | | | | | | | | | | * renaming, e.g. LU ---> FullPivLU * split tests framework: more robust, e.g. dont generate empty tests if a number is skipped * make all remaining tests use that splitting, as needed. * Fix 4x4 inversion (see stable branch) * Transform::inverse() and geo_transform test : adapt to new inverse() API, it was also trying to instantiate inverse() for 3x4 matrices. * CMakeLists: more robust regexp to parse the version number * misc fixes in unit tests | ||
* | add a SparseNestByValue expression and fix issue in sparse adjoint evaluation | Gael Guennebaud | 2009-07-13 |
| | |||
* | remove sentence "Eigen itself is part of the KDE project." | Benoit Jacob | 2009-05-22 |
| | | | | it never made very precise sense. but now does it still make any? | ||
* | new simplified API to fill sparse matrices (the old functions are | Gael Guennebaud | 2009-05-04 |
| | | | | | | | | | | | | deprecated). Basically there are now only 2 functions to set a coefficient: 1) mat.coeffRef(row,col) = value; 2) mat.insert(row,col) = value; coeffRef has no limitation, insert assumes the coeff has not already been set, and raises an assert otherwise. In addition I added a much lower level, but more efficient filling mechanism for internal use only. | ||
* | - add diagonal * sparse product as an expression | Gael Guennebaud | 2009-02-09 |
| | | | | | - split sparse_basic unit test - various fixes in sparse module | ||
* | QR: add isInjective(), isSurjective(), | Gael Guennebaud | 2009-01-28 |
| | | | | | | mark isFullRank() deprecated, add solve() (mix of Keir's patch and LU::solve()) => there is big problem with complex which are not working | ||
* | add support for read/write sub sets of inner vectors (sparse module) | Gael Guennebaud | 2009-01-27 |
| | |||
* | sparse module: makes -= and += operator working | Gael Guennebaud | 2009-01-23 |
| | | | | | | Question 1: why are *=scalar and /=scalar working right away ? Same weirdness in DynamicSparseMatrix where operators += and -= work wihout having to redefine them ??? | ||
* | fix a few remaining warnings | Gael Guennebaud | 2009-01-23 |
| | | | | and fix commainitializer unit test with MSVC | ||
* | * fix compilation with gcc 3.4 | Gael Guennebaud | 2009-01-23 |
| | | | | * add an option to disable Qt testing | ||
* | sparse module: | Gael Guennebaud | 2009-01-21 |
| | | | | | * add row(i), col(i) functions * add prune() function to remove small coefficients | ||
* | add a flexible sparse matrix class designed for fast matrix assembly | Gael Guennebaud | 2009-01-19 |
| | |||
* | Sparse module: add support for sparse selfadjoint * dense | Gael Guennebaud | 2009-01-15 |
| | |||
* | Sparse module: add row/col methods to the iterators | Gael Guennebaud | 2009-01-15 |
| | |||
* | Sparse module: bugfix in SparseMatrix::resize(), now the indices are | Gael Guennebaud | 2009-01-15 |
| | | | | correctly initialized to 0. | ||
* | Sparse module: | Gael Guennebaud | 2009-01-14 |
| | | | | | * improved performance of mat*=scalar * bug fix in cwise* | ||
* | Add support for sparse * dense and dense * sparse matrix/vector products | Gael Guennebaud | 2009-01-14 |
| | |||
* | Big rewrite in the Sparse module: SparseMatrixBase no longer inherits ↵ | Gael Guennebaud | 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 | ||
* | Sparse module: add a more flexible SparseMatrix::fillrand() function | Gael Guennebaud | 2008-12-11 |
| | | | | | which allows to fill a matrix with random inner coordinates (makes sense only when a very few coeffs are inserted per col/row) | ||
* | Several improvements in sparse module: | Gael Guennebaud | 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. |