| Commit message (Collapse) | Author | Age |
|\ |
|
| |
| |
| |
| | |
it never made very precise sense. but now does it still make any?
|
|/
|
|
|
|
| |
Added default ctor and public compute method as
well as safe-guards against uninitialized usage.
Added unit tests for the safe-guards.
|
| |
|
| |
|
|
|
|
|
| |
* fixes for mistakes (especially in the cast() methods in Geometry) revealed by the new "mixing types" test
* dox love, including a section on coeff access in core and an overview in geometry
|
| |
|
|
|
|
|
| |
* fix some "unused variable" warnings in the tests; there remains a libstdc++ "deprecated"
warning which I haven't looked much into
|
|
|
|
| |
of the stable API yet and a couple of other minor doc updates...
|
|
|
|
|
|
| |
* fix a very old bug in EigenSolver that I had completely forgotten
(thanks to Timothy to refresh my mind)
* fix doc of Matrix::Map
|
|
|
|
|
|
| |
However, for matrices larger than 5, it seems there is constantly a quite large error for a very
few coefficients. I don't what's going on, but that's certainely not due to numerical issues only.
(also note that the test with the pseudo eigenvectors fails the same way)
|
|
|
|
|
|
|
|
| |
* eigenvectors => pseudoEigenvectors
* added pseudoEigenvalueMatrix
* clear the documentation
* added respective unit test
Still missing: a proper eigenvectors() function.
|
| |
|
|
|
|
|
|
| |
Documentation:
* add an overview for each module.
* add an example for .all() and Cwise::operator<
|
| |
|
|
|
|
|
| |
- fix compilation in product.cpp with std::complex
- fix bug in MatrixBase::operator!=
|
|
|
|
|
|
| |
(as new members to SelfAdjointEigenSolver)
The QR module now depends on Cholesky.
* Fix Transpose to correctly preserve the *TriangularBit.
|
|
|
|
|
| |
which now supports selfadjoint matrix. The implementation follows
Golub's famous book.
|
| |
|
|
|
|
|
| |
* added qr and eigensolver tests
* fix a compilation warning in Matrix copy constructor
|
|
|
|
|
| |
selfadjoint at compile time, then it returns real eigenvalues.
* Fix a couple of bugs with the new product.
|
|
(does not support complex and does not re-use the QR decomposition)
* Rewrite the cache friendly product to have only one instance per scalar type !
This significantly speeds up compilation time and reduces executable size.
The current drawback is that some trivial expressions might be
evaluated like conjugate or negate.
* Renamed "cache optimal" to "cache friendly"
* Added the ability to directly access matrix data of some expressions via:
- the stride()/_stride() methods
- DirectAccessBit flag (replace ReferencableBit)
|