Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | more product refactoring | Gael Guennebaud | 2009-08-06 |
| | |||
* | implement a ProductBase class and, as a proof of concept, update ↵ | Gael Guennebaud | 2009-08-04 |
| | | | | | | TriangularProduct and SelfAdjointMatrixProduct to take advantage of it => fewer LOC | ||
* | * Bye bye MultiplierBase, extend a bit AnyMatrixBase to allow =, +=, and -= | Gael Guennebaud | 2009-08-03 |
| | | | | * This probably makes ReturnByValue needless | ||
* | fix typo | Gael Guennebaud | 2009-07-29 |
| | |||
* | fix a couple of issues related to recent products | Gael Guennebaud | 2009-07-28 |
| | |||
* | add a debug mechanism to compute the number of intermediate evaluations ↵ | Gael Guennebaud | 2009-07-28 |
| | | | | (only for dynamic size) | ||
* | various compilation and bug fixes in selfadjoint stuff | Gael Guennebaud | 2009-07-27 |
| | |||
* | split and add unit tests for symm and syrk, | Gael Guennebaud | 2009-07-23 |
| | | | | the .rank*update() functions now returns a reference to *this | ||
* | Implement efficient sefladjoint product (aka SYRK) : C += alpha * U U^T | Gael Guennebaud | 2009-07-23 |
| | | | | | It is currently available via SelfAdjointView::rankKupdate. TODO: allows to write SelfAdjointView += u * u.adjoint() | ||
* | improve SYMV it is now faster and ready for use | Gael Guennebaud | 2009-07-23 |
| | |||
* | formating | Gael Guennebaud | 2009-07-23 |
| | |||
* | addd matrix * self adjoint high level API | Gael Guennebaud | 2009-07-23 |
| | |||
* | implement high level API for SYMM and fix a couple of bugs related to complex | Gael Guennebaud | 2009-07-22 |
| | |||
* | some cleaning/renaming is Triangular/SelfadjointView | Gael Guennebaud | 2009-07-14 |
| | |||
* | Add an efficient rank2 update function (like the level2 blas xSYR2 routine). | Gael Guennebaud | 2009-07-11 |
| | | | | Note that it is already used in Tridiagonalization. | ||
* | * bybye Part, welcome TriangularView and SelfAdjointView. | Gael Guennebaud | 2009-07-06 |
* move solveTriangular*() to TriangularView::solve*() * move .llt() to SelfAdjointView * add a high level wrapper to the efficient selfadjoint * vector product * improve LLT so that we can specify which triangular part is meaningless => there are still many things to do (doc, cleaning, improve the matrix products, etc.) |