| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Add regression test for bug #817 |  Gael Guennebaud | 2015-09-02 |
| | | |||
| * | bug #986: add support for coefficient-based product with 0 depth. | Gael Guennebaud | 2015-04-01 |
| | | |||
| * | Fix computeProductBlockingSizes with m==0, and add respective unit test. | Gael Guennebaud | 2015-03-31 |
| | | |||
| * | bug #978: add unit test for zero-sized products | Gael Guennebaud | 2015-03-06 |
| | | |||
| * | Fix bug #314: move remaining math functions from internal to numext namespace | Gael Guennebaud | 2013-06-10 |
| | | |||
| * | Clean source code and unit tests with respect to -Wunused-local-typedefs | Gael Guennebaud | 2013-04-10 |
| | | |||
| * | Fix out-of-range memory access in GEMV (the memory was not used for the ↵ | Gael Guennebaud | 2012-08-30 |
| | | | | | | | | computation, only to assemble unaligned packets from aligned packet loads) (transplanted from 221f54698c2f6690da8c0f44c1e31e55118dedab ) | ||
| * | Automatic relicensing to MPL2 using Keirs script. Manual fixup follows. |  Benoit Jacob | 2012-07-13 |
| | | |||
| * | Bug fix for matrix1 * matrix2 * scalar1 * scalar2. |  Jitse Niesen | 2011-09-19 |
| | | | | | See report on http://forum.kde.org/viewtopic.php?f=74&t=96947 . | ||
| * | add the possibility to configure the maximal matrix size in the unit tests | Gael Guennebaud | 2011-07-12 |
| | | |||
| * | fix bug #127. our product selection logic was flawed in that it used the ↵ | Benoit Jacob | 2010-12-09 |
| | | | | | | | Max-sized to determine whether the size is 1. + test. | ||
| * | bug #86 : use internal:: namespace instead of ei_ prefix | Benoit Jacob | 2010-10-25 |
| | | |||
| * | fix bad mat * mat * scalar when the implicit conversion operator to a Matrix ↵ | Gael Guennebaud | 2010-08-31 |
| | | | | | is used | ||
| * | extend product unit tests | Gael Guennebaud | 2010-07-07 |
| | | |||
| * | add a unit test for previous bug | Gael Guennebaud | 2010-07-06 |
| | | |||
| * | fix range | Gael Guennebaud | 2010-07-06 |
| | | |||
| * | Next try - more Index fixes. |  Hauke Heibel | 2010-06-20 |
| | | |||
| * | Utilize Index in all unit tests. | Hauke Heibel | 2010-06-20 |
| | | |||
| * | Complete rework of global math functions and NumTraits. | Benoit Jacob | 2010-04-28 |
| | | | | | | | | | * Now completely generic so all standard integer types (like char...) are supported. ** add unit test for that (integer_types). * NumTraits does no longer inherit numeric_limits * All math functions are now templated * Better guard (static asserts) against using certain math functions on integer types. | ||
| * | Remove some Array #includes. | Jitse Niesen | 2010-01-21 |
| | | |||
| * | 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 | ||
| * | kill ei_add_test_multi. Now the macro ei_add_test does all that ↵ | Benoit Jacob | 2009-10-19 |
| | | | | | automatically, by parsing the source file. No risk anymore to specify the wrong number of tests! Also, introduce CALL_SUBTESTX for X=1..10 that allows to port existing code much quicker. And port already the product* and eigensolver* files. | ||
| * | better fix for (v * v') * v, we still have to find a way to reorder it | Gael Guennebaud | 2009-10-01 |
| | | |||
| * | *add test to prevent future regression | Benoit Jacob | 2009-09-29 |
| | | |||
| * | improve coverage of matrix-vector product | Gael Guennebaud | 2009-09-07 |
| | | |||
| * | clean a bit the previous commit which came from a patch queue, | Gael Guennebaud | 2009-09-01 |
| | | | | | | | | | | and since it was my first try of the patch queue feature I did not managed to apply it with a good commit message, so here you go: * Add a ComplexSchur decomposition class built on top of HessenbergDecomposition * Add a ComplexEigenSolver built on top of ComplexSchur There are still a couple of FIXME but at least they work for any reasonable matrices, still have to extend the unit tests to stress them with nasty matrices... | ||
| * | I've been too fast (again) | Gael Guennebaud | 2009-09-01 |
| | | |||
| * | fix issue #47: now m.noalias() = XXX properly resize m if needed | Gael Guennebaud | 2009-09-01 |
| | | |||
| * | various compilation and bug fixes in selfadjoint stuff | Gael Guennebaud | 2009-07-27 |
| | | |||
| * | finally directly calling the low-level products is faster | Gael Guennebaud | 2009-07-10 |
| | | |||
| * | started to simplify the triangular solvers | Gael Guennebaud | 2009-07-09 |
| | | |||
| * | ok now all the complex mat-mat and mat-vec products involving conjugate, | Gael Guennebaud | 2009-07-08 |
| adjoint, -, and scalar multiple seems to be well handled. It only remains the simpler case: C = alpha*(A*B) ... for the next commit | |||
 |
index : eigen | |
| C++ library for linear algebra |
| aboutsummaryrefslogtreecommitdiffhomepage |