Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Fix bug #608: the sign computation in LDLT was broken | Gael Guennebaud | 2013-06-09 |
| | |||
* | Fix a couple of int versus Index issues. | Gael Guennebaud | 2013-04-09 |
| | |||
* | bug #482: pass scalar arguments by const references. Still remains a few ↵ | Gael Guennebaud | 2013-02-25 |
| | | | | cases that might affect the ABI (see the bug entry) | ||
* | Fix bug #535: unused variable warnings | Gael Guennebaud | 2012-12-16 |
| | |||
* | Fix bug #314: | Gael Guennebaud | 2012-11-06 |
| | | | | | - remove most of the metaprogramming kung fu in MathFunctions.h (only keep functions that differs from the std) - remove the overloads for array expression that were in the std namespace | ||
* | LDLT: Report sign consistent with D for indefinite matrices. | Jitse Niesen | 2012-07-22 |
| | | | | See http://forum.kde.org/viewtopic.php?f=74&t=106942 | ||
* | Automatic relicensing to MPL2 using Keirs script. Manual fixup follows. | Benoit Jacob | 2012-07-13 |
| | |||
* | Fix bug #480: workaround the Android NDK defining isfinite as a macro | Gael Guennebaud | 2012-07-05 |
| | |||
* | fix a warning and formatting | Gael Guennebaud | 2012-06-15 |
| | |||
* | Get rid of include directives inside namespace blocks (bug #339). | Jitse Niesen | 2012-04-15 |
| | |||
* | fix compilation of "somedensematrix.llt().matrixL().transpose()" (missing ↵ | Gael Guennebaud | 2012-04-10 |
| | | | | constness on the return types) | ||
* | fix compilation with ICC | Gael Guennebaud | 2012-03-30 |
| | |||
* | fix MKL interface with LLT::rankUpdate | Gael Guennebaud | 2012-02-28 |
| | |||
* | fix several const qualifier issues: double ones, meaningless ones, some ↵ | Gael Guennebaud | 2012-02-03 |
| | | | | | | missing ones, etc. (note that const qualifiers are set by internall::nested) | ||
* | fix static inline versus inline static issues (the former is the correct order) | Gael Guennebaud | 2012-01-31 |
| | |||
* | std::isfinite is non standard | Gael Guennebaud | 2012-01-23 |
| | |||
* | LLT: improve rankUpdate to support downdates, | Gael Guennebaud | 2012-01-23 |
| | | | | | LDLT: add the missing info() function, improve unit testing of rankUpdate() | ||
* | remove redundant declaration (fix compilation with clang 3.0) | Gael Guennebaud | 2011-12-11 |
| | |||
* | bug #352:properly cast constants | Igor Krivenko | 2011-12-09 |
| | |||
* | fix compilation with EIGEN_NO_DEBUG | Gael Guennebaud | 2011-12-09 |
| | |||
* | feature 319: fix LDLT::rankUpdate for complex/upper, simply the algortihm, ↵ | Gael Guennebaud | 2011-12-09 |
| | | | | update copyrights | ||
* | feature 319: Add update and downdate functionality to LDLT | Tim Holy | 2011-12-09 |
| | |||
* | Intel(R) MKL support added. | karturov | 2011-12-05 |
| | | | | | | | | | | * * * License disclaimer changed to BSD license for MKL_support.h * * * Pardiso support fixed, test added. blas/lapack tests fixed: Scalar parameter was added in Cholesky, product_matrix_vector_triangular remaned to triangular_matrix_vector_product. * * * PARDISO test was added physically. | ||
* | Add simple example on how to compute Cholesky decomposition. | Jitse Niesen | 2011-11-07 |
| | |||
* | Fix LDLT::solve() if matrix singular but solution exists (bug #241). | Jitse Niesen | 2011-09-11 |
| | | | | Clarify this in docs and add regression test. | ||
* | protect calls to min and max with parentheses to make Eigen compatible with ↵ | Gael Guennebaud | 2011-07-21 |
| | | | | | | | default windows.h (transplanted from 49b6e9143e1d74441924c0c313536e263e12a55c ) | ||
* | fix LLT rank one update for "upper" hermitian matrices | Gael Guennebaud | 2011-07-19 |
| | |||
* | Fix compilation of cholesky rank update test. | Jitse Niesen | 2011-06-24 |
| | |||
* | New feature: add rank one update in Cholesky decomposition | Gael Guennebaud | 2011-06-20 |
| | |||
* | make eigen2 cholesky test pass | Benoit Jacob | 2011-01-28 |
| | |||
* | return the index of the first non positive diagonal entry (more useful than ↵ | Gael Guennebaud | 2011-01-17 |
| | | | | simply true or false) | ||
* | bug #54 - really fix const correctness except in Sparse | Benoit Jacob | 2010-12-22 |
| | |||
* | simplification | Gael Guennebaud | 2010-12-09 |
| | |||
* | bug #86 : use internal:: namespace instead of ei_ prefix | Benoit Jacob | 2010-10-25 |
| | |||
* | mark LLT/LDLT solveInPlace func internal and rm their boolean returned value | Gael Guennebaud | 2010-10-05 |
| | |||
* | email change | Gael Guennebaud | 2010-06-24 |
| | |||
* | Correct the options computation for RowMajor matrices. | Hauke Heibel | 2010-06-22 |
| | |||
* | add a info() function in LLT to report on succes/faillure | Gael Guennebaud | 2010-06-12 |
| | |||
* | fix LDLT, now it really only uses a given triangular part! | Gael Guennebaud | 2010-06-09 |
| | |||
* | Add a Transpositions class to ease the representation and | Gael Guennebaud | 2010-06-04 |
| | | | | | manipulation of permutations as a sequence of transpositions. Make LDLT use it. | ||
* | LDLT: make it honors the Lower/Upper directive and make it works inplace | Gael Guennebaud | 2010-06-03 |
| | |||
* | make LDLT uses only the lower triangular part | Gael Guennebaud | 2010-06-03 |
| | |||
* | the Index types change. | Benoit Jacob | 2010-05-30 |
| | | | | As discussed on the list (too long to explain here). | ||
* | - Added problem size constructor to decompositions that did not have one. It ↵ | Adolfo Rodriguez Tsouroukdissian | 2010-04-21 |
| | | | | | | | | | | | preallocates member data structures. - Updated unit tests to check above constructor. - In the compute() method of decompositions: Made temporary matrices/vectors class members to avoid heap allocations during compute() (when dynamic matrices are used, of course). These changes can speed up decomposition computation time when a solver instance is used to solve multiple same-sized problems. An added benefit is that the compute() method can now be invoked in contexts were heap allocations are forbidden, such as in real-time control loops. CAVEAT: Not all of the decompositions in the Eigenvalues module have a heap-allocation-free compute() method. A future patch may address this issue, but some required API changes need to be incorporated first. | ||
* | * merge with mainline | Benoit Jacob | 2010-04-16 |
|\ | | | | | | | | | | | * adapt Eigenvalues module to the new rule that the RowMajorBit must have the proper value for vectors * Fix RowMajorBit in ei_traits<ProductBase> * Fix vectorizability logic in CoeffBasedProduct | ||
| * | fix misc warnings, more importantly when NDEBUG is defined, assert() is a | Thomas Capricelli | 2010-03-27 |
| | | | | | | | | nop. | ||
* | | fix the flags and matrix options, to always have the right RowMajor bit in ↵ | Benoit Jacob | 2010-03-19 |
|/ | | | | the vector case | ||
* | Propagate all five matrix template parameters to members and temporaries of ↵ | Adolfo Rodriguez Tsouroukdissian | 2010-03-08 |
| | | | | | | | decomposition classes. One particular advantage of this is that decomposing matrices with max sizes known at compile time will not allocate. NOTE: The ComplexEigenSolver class currently _does_ allocate (line 135 of Eigenvalues/ComplexEigenSolver.h), but the reason appears to be in the implementation of matrix-matrix products, and not in the decomposition itself. The nomalloc unit test has been extended to verify that decompositions do not allocate when max sizes are specified. There are currently two workarounds to prevent the test from failing (see comments in test/nomalloc.cpp), both of which are related to matrix products that allocate on the stack. | ||
* | add reconstructedMatrix() to LLT, and LUs | Gael Guennebaud | 2010-02-24 |
| | | | | | => they show that some improvements have still to be done for permutations, tr*tr, trapezoidal matrices | ||
* | * fix LDLT's default ctor use | Gael Guennebaud | 2010-02-24 |
| | | | | * add a reconstructedMatrix() function to LDLT for debug purpose |