Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Optimize extraction of Q in SparseQR by exploiting the structure of the ↵ | Gael Guennebaud | 2018-07-11 |
| | | | | identity matrix. | ||
* | Make sparse QR result sizes consistent with dense QR, with the following rules: | Jeff Trull | 2018-02-15 |
| | | | | | | | | 1) Q is always square 2) Q*R*P' is valid and recovers the original matrix This implies that the size of Q is the number of rows in the original matrix, square, and that the size of R is the size of the original matrix. | ||
* | bug #1544: Generate correct Q matrix in complex case. Original patch was by ↵ | Christoph Hertzberg | 2018-05-17 |
| | | | | Jeff Trull in PR-386. | ||
* | Add a EIGEN_NO_CUDA option, and introduce EIGEN_CUDACC and EIGEN_CUDA_ARCH ↵ | Gael Guennebaud | 2017-07-17 |
| | | | | aliases | ||
* | bug #1167: simplify installation of header files using cmake's ↵ | Gael Guennebaud | 2016-08-29 |
| | | | | install(DIRECTORY ...) command. | ||
* | Relax mixing-type constraints for binary coefficient-wise operators: | Gael Guennebaud | 2016-06-06 |
| | | | | | | | | | | - Replace internal::scalar_product_traits<A,B> by Eigen::ScalarBinaryOpTraits<A,B,OP> - Remove the "functor_is_product_like" helper (was pretty ugly) - Currently, OP is not used, but it is available to the user for fine grained tuning - Currently, only the following operators have been generalized: *,/,+,-,=,*=,/=,+=,-= - TODO: generalize all other binray operators (comparisons,pow,etc.) - TODO: handle "scalar op array" operators (currently only * is handled) - TODO: move the handling of the "void" scalar type to ScalarBinaryOpTraits | ||
* | bug #694: document that SparseQR::matrixR is not sorted. | Gael Guennebaud | 2016-02-01 |
| | |||
* | bug #1144: fix regression in x=y+A*x (aliasing), and move ↵ | Gael Guennebaud | 2016-01-09 |
| | | | | evaluator_traits::AssumeAliasing to evaluator_assume_aliasing. | ||
* | Add LU::transpose().solve() and LU::adjoint().solve() API. | Gael Guennebaud | 2015-12-01 |
| | |||
* | Doc: add link to doc of sparse solver concept | Gael Guennebaud | 2015-10-08 |
| | |||
* | Make SparseSelfAdjointView, twists, and SparseQR more evaluator friendly | Gael Guennebaud | 2015-06-24 |
| | |||
* | Fix many long to int conversion warnings: | Gael Guennebaud | 2015-02-16 |
| | | | | | | - fix usage of Index (API) versus StorageIndex (when multiple indexes are stored) - use StorageIndex(val) when the input has already been check - use internal::convert_index<StorageIndex>(val) when val is potentially unsafe (directly comes from user input) | ||
* | 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. | ||
* | 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. | ||
* | bug #701: workaround (min) and (max) blocking ADL by introducing ↵ | Gael Guennebaud | 2014-10-20 |
| | | | | numext::mini and numext::maxi internal functions and a EIGEN_NOT_A_MACRO macro. | ||
* | Fix SparseQR::rank for a completely empty matrix. | Gael Guennebaud | 2014-10-19 |
| | |||
* | Make constructors explicit if they could lead to unintended implicit conversion | Christoph Hertzberg | 2014-09-23 |
| | |||
* | Fix SparseQR for row-major inputs. | Gael Guennebaud | 2014-09-19 |
| | |||
* | Remove deprecated code not used by evaluators | Gael Guennebaud | 2014-09-18 |
| | |||
* | Refactoring of sparse solvers through a SparseSolverBase class and usage of ↵ | Gael Guennebaud | 2014-09-01 |
| | | | | the Solve<> expression. Introduce a SolveWithGuess expression on top of Solve. | ||
* | merge default branch | Gael Guennebaud | 2014-08-29 |
|\ | |||
| * | In SparseQR, calling factorize() without analyzePattern() was broken. | Gael Guennebaud | 2014-08-26 |
| | | |||
| * | Fix uninitialized variable warning in SparseQR | Vladimir Chalupecky | 2014-08-20 |
| | | |||
* | | Fix various small issues detected by gcc | Gael Guennebaud | 2014-08-01 |
|/ | |||
* | Fix bug #836: extend SparseQR to support more columns than rows. | Gael Guennebaud | 2014-07-01 |
| | |||
* | Add assertion and warning on the requirements of SparseQR and COLAMDOrdering | Gael Guennebaud | 2014-06-20 |
| | |||
* | Reduce explicit zeros when applying SparseQR's matrix Q | Gael Guennebaud | 2013-09-20 |
| | |||
* | Fix assert bug in sparseQR | Desire NUENTSA | 2013-09-20 |
| | |||
* | Fix elimination tree and SparseQR with rows<cols | Gael Guennebaud | 2013-09-12 |
| | |||
* | Added support for custom-scalars | Pavel Holoborodko | 2013-09-02 |
| | |||
* | Fix bug #314: move remaining math functions from internal to numext namespace | Gael Guennebaud | 2013-06-10 |
| | |||
* | Delete unneeded resize in SparseQR | Desire NUENTSA | 2013-05-22 |
| | |||
* | Fix bug #596 : Recover plain SparseMatrix from SparseQR matrixQ() | Desire NUENTSA | 2013-05-21 |
| | |||
* | Add reference for the default threshold in sparse QR | Desire NUENTSA | 2013-02-25 |
| | |||
* | Fix the computation of the default pivot threshold for sparse QR | Desire NUENTSA | 2013-02-25 |
| | |||
* | Cleaning pass on SparseQR | Gael Guennebaud | 2013-02-24 |
| | |||
* | remove double parenthesis | Gael Guennebaud | 2013-02-22 |
| | |||
* | Add setPivotThreshold to Sparse QR | Desire NUENTSA | 2013-02-20 |
| | |||
* | Add a rank-revealing feature to sparse QR | Desire NUENTSA | 2013-02-15 |
| | |||
* | Move SparseColEtree common to SparseLU and SparseQR to SparseCore and fix ↵ | Desire NUENTSA | 2013-01-14 |
| | | | | build issue of sparseqr | ||
* | Fix the column permutation in SparseQR | Desire NUENTSA | 2013-01-14 |
| | |||
* | SparseQR: clean a bit the documentation, fix rows/cols methods, remove rowsQ ↵ | Gael Guennebaud | 2013-01-12 |
| | | | | methods and rename matrixQR to matrixR. | ||
* | Fix installation path of SparseQR | Gael Guennebaud | 2013-01-12 |
| | |||
* | Pass a const matrix to sparseQR | Desire NUENTSA | 2013-01-11 |
| | |||
* | Add a sparse QR factorization and update the elimination tree in SparseLU | Desire NUENTSA | 2013-01-11 |