Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Generalize matrix ctor and compute() method of dense decomposition to 1) ↵ | Gael Guennebaud | 2015-09-07 |
| | | | | limit temporaries, 2) forward expressions to nested decompositions, 3) fix ambiguous ctor instanciation for square decomposition | ||
* | bug #949: add static assertion for incompatible scalar types in dense ↵ | Gael Guennebaud | 2015-03-13 |
| | | | | end-user decompositions. | ||
* | Merged in chtz/eigen-indexconversion (pull request PR-92) | Gael Guennebaud | 2015-02-16 |
|\ | | | | | | | | | | | | | | | | | | | | | | | bug #877, bug #572: Get rid of Index conversion warnings, summary of changes: - Introduce a global typedef Eigen::Index making Eigen::DenseIndex and AnyExpr<>::Index deprecated (default is std::ptrdiff_t). - Eigen::Index is used throughout the API to represent indices, offsets, and sizes. - Classes storing an array of indices uses the type StorageIndex to store them. This is a template parameter of the class. Default is int. - Methods that *explicitly* set or return an element of such an array take or return a StorageIndex type. In all other cases, the Index type is used. | ||
* | | bug #952: Missing \endcode made doxygen fail to build ColPivHouseholderQR | Christoph Hertzberg | 2015-02-15 |
| | | |||
| * | Index refactoring: StorageIndex must be used for storage only (and locally ↵ | Gael Guennebaud | 2015-02-13 |
| | | | | | | | | when it make sense). In all other cases use the global Index type. | ||
| * | Merge Index-refactoring branch with default, fix PastixSupport, remove some ↵ | Gael Guennebaud | 2015-02-13 |
| |\ | |/ |/| | | | useless typedefs | ||
* | | bug #941: fix accuracy issue in ColPivHouseholderQR, do not stop ↵ | Gael Guennebaud | 2015-01-30 |
| | | | | | | | | decomposition on a small pivot | ||
| * | bug #877, bug #572: Introduce a global Index typedef. Rename Sparse*::Index ↵ | Christoph Hertzberg | 2014-12-04 |
|/ | | | | to StorageIndex, make Dense*::StorageIndex an alias to DenseIndex. Overall this commit gets rid of all Index conversion warnings. | ||
* | Make constructors explicit if they could lead to unintended implicit conversion | Christoph Hertzberg | 2014-09-23 |
| | |||
* | Remove deprecated code not used by evaluators | Gael Guennebaud | 2014-09-18 |
| | |||
* | merge default and evaluator branches | Gael Guennebaud | 2014-03-12 |
|\ | |||
* | | Port QR module to Solve/Inverse | Gael Guennebaud | 2014-03-11 |
| | | |||
| * | Make pivoting HouseholderQR compatible with custom scalar types | Christoph Hertzberg | 2014-02-25 |
|/ | |||
* | merge with default branch | Gael Guennebaud | 2013-11-05 |
|\ | |||
* | | Add a rank method with threshold control to JacobiSVD, and make solve uses ↵ | Gael Guennebaud | 2013-11-01 |
| | | | | | | | | it to return the minimal norm solution for rank-deficient problems | ||
| * | Disable some shortcuts with nvcc | Gael Guennebaud | 2013-07-31 |
|/ | |||
* | Fix various scalar type conversion warnings. | Gael Guennebaud | 2013-07-12 |
| | |||
* | Fix HouseholderSequence::conjugate() and ::adjoint() and add respective unit ↵ | Gael Guennebaud | 2013-06-17 |
| | | | | tests. | ||
* | Fix bug #314: move remaining math functions from internal to numext namespace | Gael Guennebaud | 2013-06-10 |
| | |||
* | Fix bug #599: add missing documentation of some members in QR module. | Gael Guennebaud | 2013-06-10 |
| | |||
* | Add assertion on the input matrix size in factorizations relying on ↵ | Gael Guennebaud | 2013-02-26 |
| | | | | permutations of 32bits int | ||
* | Remove superfluous cast. | Gael Guennebaud | 2013-02-24 |
| | |||
* | Clarify the doc for column-pivoting QR | Desire NUENTSA | 2013-02-21 |
| | |||
* | Add matrixR() to get the triangular factor from the Householder QR | Desire NUENTSA | 2013-02-20 |
| | |||
* | Fix some implicit int64 to int conversion warnings. However, the real issue | Gael Guennebaud | 2013-02-14 |
| | | | | | | | is that PermutationMatrix mixes the type of the stored indices and the "Index" type used for the sizes, coeff indices, etc., which should be DenseIndex. (transplanted from 66cbfd4d39efbec240fe90b2dd77293e71f060e8 ) | ||
* | remove dummy code in ColPivHouseholderQR::solve | Gael Guennebaud | 2013-01-23 |
| | |||
* | Update SPQR module for Sparse LM | Desire NUENTSA | 2012-11-21 |
| | |||
* | 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 | ||
* | Automatic relicensing to MPL2 using Keirs script. Manual fixup follows. | Benoit Jacob | 2012-07-13 |
| | |||
* | Get rid of include directives inside namespace blocks (bug #339). | Jitse Niesen | 2012-04-15 |
| | |||
* | protect calls to min and max with parentheses to make Eigen compatible with ↵ | Gael Guennebaud | 2011-07-21 |
| | | | | | | | default windows.h (transplanted from 49b6e9143e1d74441924c0c313536e263e12a55c ) | ||
* | bug #271: fix copy/paste mistakes in doc | Gael Guennebaud | 2011-05-23 |
| | | | | (transplanted from 145b9cad63101ee46924d446fa8b08ffb48c7f3a) | ||
* | clean a bit previous patch (ctor vs static_cast and a few bits) | Gael Guennebaud | 2011-05-23 |
| | |||
* | fix implicit scalar conversions (needed to support fancy scalar types, see ↵ | David H. Bailey | 2011-05-23 |
| | | | | bug #276) | ||
* | Make HouseholderSequence::setTrans() protected (cf. bug #50). | Jitse Niesen | 2011-01-06 |
| | | | | Users can call .transpose() instead. | ||
* | fix HouseholderSequence API, bug #50: | Benoit Jacob | 2010-12-30 |
| | | | | | | * remove ctors taking more than 2 ints * rename actualVectors to length * add length/shift/trans accessors/mutators | ||
* | bug #86 : use internal:: namespace instead of ei_ prefix | Benoit Jacob | 2010-10-25 |
| | |||
* | Added more detailed docs to the QR decompositions classes. | Hauke Heibel | 2010-08-05 |
| | |||
* | Remove \nonstable yet. The stability rules for Eigen3 are much simpler: | Benoit Jacob | 2010-06-29 |
| | | | | | - all what's not in unsupported/ is considered stable API (except internal stuff e.g. expression templates). | ||
* | email change | Gael Guennebaud | 2010-06-24 |
| | |||
* | clean old stuff used to support precompilation inside a binary lib | Gael Guennebaud | 2010-06-07 |
| | |||
* | Fixes the problem, described here: | Anton Gladky | 2010-05-28 |
| | | | | http://listengine.tuxfamily.org/lists.tuxfamily.org/eigen/2010/05/msg00154.html | ||
* | the Index types change. | Benoit Jacob | 2010-05-30 |
| | | | | As discussed on the list (too long to explain here). | ||
* | introduce a new macro EIGEN_ARG_UNUSED(arg) and use it in some places to | Thomas Capricelli | 2010-05-21 |
| | | | | silent some warnings (from clang) | ||
* | * implement the corner() API change: new methods topLeftCorner() etc | Benoit Jacob | 2010-04-22 |
| | | | | | | | | * get rid of BlockReturnType: it was not needed, and code was not always using it consistently anyway * add topRows(), leftCols(), bottomRows(), rightCols() * add corners unit-test covering all of that * adapt docs, expand "porting from eigen 2 to 3" * adapt Eigen2Support | ||
* | - 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. | ||
* | 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. | ||
* | * let a = foo() work when a is a row-vector xpr and foo() returns a ↵ | Benoit Jacob | 2010-03-08 |
| | | | | | | ReturnByValue col-vector * remove a few useless resize() in evalTo() implementations | ||
* | Renamed PlainMatrixType to PlainObject (Array != Matrix). | Hauke Heibel | 2010-02-20 |
| | | | | Renamed ReturnByValue::ReturnMatrixType ReturnByValue::ReturnType (again, Array != Matrix). |