Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Automatic relicensing to MPL2 using Keirs script. Manual fixup follows. | 2012-07-13 | |
| | |||
* | add the possibility to configure the maximal matrix size in the unit tests | 2011-07-12 | |
| | |||
* | bug #86 : use internal:: namespace instead of ei_ prefix | 2010-10-25 | |
| | |||
* | email change | 2010-06-24 | |
| | |||
* | Guard with assert against using decomposition objects uninitialized. | 2010-05-30 | |
| | |||
* | Use ReturnByValue mechanism for HessenbergDecomposition::matrixH(). | 2010-05-24 | |
| | |||
* | Change return type of matrixH() method to HouseholderSequence. | 2010-05-24 | |
| | | | | This method is a member of Tridiagonalization and HessenbergDecomposition. | ||
* | - Added problem size constructor to decompositions that did not have one. It ↵ | 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. | ||
* | Add tests for real and complex Schur; extend test for Hessenberg. | 2010-04-02 | |
| | | | | Make a minor correction to the ComplexSchur class. | ||
* | fix #75, and add a basic unit test for Hessenberg | 2009-12-23 | |
(it was indirectly tested by the eigenvalue decomposition) |