| Commit message (Collapse) | Author | Age |
|
|
|
| |
* make NumTraits inherits std::numeric_limits
|
|
|
|
|
|
| |
related to nested products.
Fixed a few typos and a few warnings.
|
| |
|
| |
|
|\ |
|
| |
| |
| |
| |
| |
| | |
disabled.
All unimplemented assignment operators have been removed.
|
| |
| |
| |
| | |
Silenced (amongst others) many conversion related warnings.
|
| | |
|
| | |
|
| |
| |
| |
| |
| |
| | |
in particular the addition of a selfadjointView, and the
extension of triangularView. The rest is cleaning and does not
change/extend the API.
|
| |
| |
| |
| |
| | |
* extend Cwise for multiple storage base class
* a lot of cleaning in the Sparse module
|
|/
|
|
| |
All tests work fine.
|
| |
|
| |
|
| |
|
|
|
|
| |
it never made very precise sense. but now does it still make any?
|
|
|
|
| |
* fix the row()/col() functions of some InnerVector
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
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.
|
|
|
|
| |
solver support with a sparse matrix as the rhs.
|
| |
|
| |
|
|
|
|
|
| |
- split sparse_basic unit test
- various fixes in sparse module
|
| |
|
|
|
|
|
|
| |
Question 1: why are *=scalar and /=scalar working right away ?
Same weirdness in DynamicSparseMatrix where operators += and -= work wihout
having to redefine them ???
|
|
|
|
| |
* add an option to disable Qt testing
|
|
|
|
|
| |
* add row(i), col(i) functions
* add prune() function to remove small coefficients
|
| |
|
| |
|
| |
|
|
|
|
| |
correctly initialized to 0.
|
|
|
|
|
|
| |
* add a MappedSparseMatrix class (like Eigen::Map but for sparse
matrices)
* rename SparseArray to CompressedStorage
|
|
|
|
|
| |
* improved performance of mat*=scalar
* bug fix in cwise*
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
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
|
| |
|
| |
|
|
|
|
|
|
| |
* enable complex support for the CHOLMOD LLT backend
using CHOLMOD's triangular solver
* quick fix for complex support in SparseLLT::solve
|
| |
|
| |
|
|
|
|
|
| |
* fix some "unused variable" warnings in the tests; there remains a libstdc++ "deprecated"
warning which I haven't looked much into
|
|
|
|
|
| |
which allows to fill a matrix with random inner coordinates (makes sense
only when a very few coeffs are inserted per col/row)
|
|
|
|
|
|
|
|
|
| |
* 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.
|
|
|
|
|
| |
for both backends.
* extended a bit the sparse unit tests
|
|
|
|
|
| |
using SuperLU. Calling SuperLU was very painful, but it was worth it,
it seems to be damn fast !
|
| |
|
|
|
|
|
| |
* bidirectionnal mapping
* full cholesky factorization
|
|
|
|
|
|
|
|
|
|
| |
* several fixes (transpose, matrix product, etc...)
* Added a basic cholesky factorization
* Added a low level hybrid dense/sparse vector class
to help writing code involving intensive read/write
in a fixed vector. It is currently used to implement
the matrix product itself as well as in the Cholesky
factorization.
|
| |
|
|
|
|
|
| |
Block specialization for sparse matrices.
InnerIterators for Blocks and fixes in CoreIterators.
|