Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | finally, the good approach was two-sided Jacobi. Indeed, it allows | Benoit Jacob | 2009-08-12 |
| | | | | | | | | | | to guarantee the precision of the output, which is very valuable. Here, we guarantee that the diagonal matrix returned by the SVD is actually diagonal, to machine precision. Performance isn't bad at all at 50% of the current householder SVD performance for a 200x200 matrix (no vectorization) and we have lots of room for improvement. | ||
* | add EIGEN_DEBUG_VAR | Benoit Jacob | 2009-08-11 |
| | |||
* | overload operartor* with a ProductBase such that "scalar * (mat * mat)" is ↵ | Gael Guennebaud | 2009-08-11 |
| | | | | | | optimized as one could naturally expect | ||
* | fix issue #36 (missing return *this in Rotation2D | Gael Guennebaud | 2009-08-11 |
| | |||
* | remove #include Bidiagonalization, and add missing ";" | Gael Guennebaud | 2009-08-11 |
| | |||
* | merge | Gael Guennebaud | 2009-08-09 |
|\ | |||
* | | make custom asm directive volatile | Gael Guennebaud | 2009-08-09 |
| | | |||
| * | LinearVectorization: If the destination isn't aligned, | Benoit Jacob | 2009-08-09 |
| | | | | | | | | we have to do runtime checks and we don't unroll, so it's only good for large enough sizes | ||
| * | now you can #define EIGEN_DEBUG_ASSIGN, and all the values in ↵ | Benoit Jacob | 2009-08-09 |
| | | | | | | | | ei_assign_traits are printed | ||
| * | disable the assembly for fast unaligned stores. indeed, there is a strange ↵ | Benoit Jacob | 2009-08-09 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | bug that is triggered by this code: #include<Eigen/Core> int main() { Eigen::Matrix4f m; m <<1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16; m.col(0).swap(m.col(1)); std::cout << m << std::endl; } when the fast unaligned stores are used, the column is copied instead of being swapped. | ||
| * | don't depend on uninitialized value | Benoit Jacob | 2009-08-09 |
| | | |||
| * | * add Jacobi transformations | Benoit Jacob | 2009-08-09 |
| | | | | | | | | | | * add Jacobi (Hestenes) SVD decomposition for square matrices * add function for trivial Householder | ||
* | | make LU::solve() not to crash when rank=0 | Gael Guennebaud | 2009-08-09 |
| | | |||
| * | fix bug in sorting of singular values | Benoit Jacob | 2009-08-09 |
|/ | |||
* | add basic .hgignore file for most common generated/temporary files | Thomas Capricelli | 2009-08-08 |
| | |||
* | replace custom rank one update in LU by an expression | Gael Guennebaud | 2009-08-08 |
| | |||
* | * implement a second level of micro blocking (faster for small sizes) | Gael Guennebaud | 2009-08-07 |
| | | | | * workaround GCC bad implementation of _mm_set1_p* | ||
* | Fix compilation in sparse module | Gael Guennebaud | 2009-08-06 |
| | |||
* | fix determinant in PartialLU | Gael Guennebaud | 2009-08-06 |
| | |||
* | oops, one more bug fix in homogeneous | Gael Guennebaud | 2009-08-06 |
| | |||
* | fixes in determinant and homogeneous | Gael Guennebaud | 2009-08-06 |
| | |||
* | compilation fix in EigenSolver, | Gael Guennebaud | 2009-08-06 |
| | | | | bugfix in PartialLU | ||
* | typo | Gael Guennebaud | 2009-08-06 |
| | |||
* | fix VS compilation issue in MapBase::operator+= and -= | Gael Guennebaud | 2009-08-06 |
| | |||
* | shame on me | Gael Guennebaud | 2009-08-06 |
| | |||
* | fix my bad fix of Hauke's fix ;) | Gael Guennebaud | 2009-08-06 |
| | |||
* | fix a couple of compilations issues | Gael Guennebaud | 2009-08-06 |
| | |||
* | fixed inversion for AffineCompact matrices | Hauke Heibel | 2009-08-06 |
| | |||
* | more product refactoring | Gael Guennebaud | 2009-08-06 |
| | |||
* | fix vs.net compilation issue | Hauke Heibel | 2009-08-06 |
| | |||
* | fix vs.net compilation issue | Hauke Heibel | 2009-08-06 |
| | |||
* | fix compilation and segfault issues | Gael Guennebaud | 2009-08-06 |
| | |||
* | add the missing Affine Transform * set of column vectors products... | Gael Guennebaud | 2009-08-06 |
| | |||
* | remove remnant of MultiplierBase | Benoit Jacob | 2009-08-06 |
| | |||
* | implement the missing outer product, | Gael Guennebaud | 2009-08-05 |
| | | | | and attempt to workaround a gcc internal error | ||
* | big refactoring in Product.h: | Gael Guennebaud | 2009-08-05 |
| | | | | | | | | - all specialized products now inherits ProductBase - the default product evaluated by Assign is still here, but it is currently enabled for small fixed sizes only - => this significantly speed up compilation for large matrices - I left the OuterProduct specialization empty as an exercise... | ||
* | fix assertions, improve docs. | Benoit Jacob | 2009-08-05 |
| | | | | | we never assert on conditions that depend on the result of a computation!! also the assertion that rank>0 amounts to matrix!=0 which we have to leave under the responsibility of the user. | ||
* | merge | Benoit Jacob | 2009-08-04 |
|\ | |||
* \ | merge | Gael Guennebaud | 2009-08-04 |
|\ \ | |||
| * | | remove the FORCE | Benoit Jacob | 2009-08-04 |
| | | | |||
| | * | 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 | ||
| | * | fix a couple of compilation issue due to the removal of MultiplierBase | Gael Guennebaud | 2009-08-04 |
| |/ |/| | |||
* | | merge | Gael Guennebaud | 2009-08-04 |
|\| | |||
* | | add ger and lu with partial pivoting in BTL | Gael Guennebaud | 2009-08-04 |
| | | |||
* | | implement two levels of blocking in PartialLU => high speedup | Gael Guennebaud | 2009-08-04 |
| | | |||
| * | use explicit Block/VectorBlock xprs to make sure that compile-time known ↵ | Benoit Jacob | 2009-08-04 |
| | | | | | | | | sizes are used | ||
| * | make the dot product linear in the second variable, not the first variable | Benoit Jacob | 2009-08-03 |
|/ | |||
* | merge with special_matrix branch | Gael Guennebaud | 2009-08-03 |
|\ | |||
* \ | merge | Gael Guennebaud | 2009-08-03 |
|\ \ | |||
| * | | add new Householder module | Benoit Jacob | 2009-08-03 |
| | | |