Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | bug #1063: nest AutoDiffScalar by value to avoid dead references | 2015-11-05 | |
| | |||
* | Refactoring of the cost model: | 2015-10-28 | |
| | | | | | | | | | | | - Dynamic is now an invalid value - introduce a HugeCost constant to be used for runtime-cost values or arbitrarily huge cost - add sanity checks for cost values: must be >=0 and not too large This change provides several benefits: - it fixes shortcoming is some cost computation where the Dynamic case was not properly handled. - it simplifies cost computation logic, and should avoid future similar shortcomings. - it allows to distinguish between different level of dynamic/huge/infinite cost - it should enable further simplifications in the computation of costs (save compilation time) | ||
* | bug #1092: fix iterative solver ctors for expressions as input | 2015-10-26 | |
| | |||
* | Added ArpackSupport to cmake install target | 2015-10-16 | |
| | |||
* | Cleanup EIGEN_SPARSE_PUBLIC_INTERFACE, it is now a simple alias to ↵ | 2015-10-08 | |
| | | | | EIGEN_GENERIC_PUBLIC_INTERFACE | ||
* | Move IncompleteCholesky to official modules | 2015-10-08 | |
| | |||
* | Improve doc of IncompleteCholesky | 2015-10-08 | |
| | |||
* | Fix return by value versus ref typo in IncompleteCholesky | 2015-10-07 | |
| | |||
* | bug #1076: fix scaling in IncompleteCholesky, improve doc, add read-only ↵ | 2015-10-06 | |
| | | | | access to the different factors, remove debugging code. | ||
* | bug #1070: propagate last three Matrix template arguments for ↵ | 2015-09-28 | |
| | | | | NumTraits<AutoDiffScalar<>>::Real | ||
* | Remove dense nested loops in IncompleteCholesky | 2015-08-04 | |
| | |||
* | Numerous fixes for IncompleteCholesky. Still have to make it fully exploit ↵ | 2015-08-04 | |
| | | | | the sparse structure of the L factor, and improve robustness to illconditionned problems. | ||
* | Add const getters for LM parameters | 2015-07-17 | |
| | |||
* | Get rid of class internal::nested<> (still have to updated Tensor module) | 2015-06-19 | |
| | |||
* | code simplification | 2015-06-09 | |
| | |||
* | formatting | 2015-06-09 | |
| | |||
* | remove redundant dynamic allocations in GMRES | 2015-06-09 | |
| | |||
* | fix some legitimate shadow warnings | 2015-06-09 | |
| | |||
* | Do not abort if the folder cannot be openned! | 2015-06-05 | |
| | |||
* | Improve loading of symmetric sparse matrices in MatrixMarketIterator | 2015-06-05 | |
| | |||
* | Fix trivial warnings in LevenbergMarquardt module and test | 2015-04-24 | |
| | |||
* | Fix regression in DynamicSparseMatrix and SuperLUSupport wrt recent change ↵ | 2015-04-02 | |
| | | | | on nonZeros/nonZerosEstimate | ||
* | fix loadMarket wrt Index versus int | 2015-03-20 | |
| | |||
* | Suppress some remaining Index conversion warnings | 2015-02-17 | |
| | |||
* | Fix many long to int conversion warnings: | 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 ↵ | 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 ↵ | 2015-02-13 | |
|\ | | | | | | | useless typedefs | ||
| * | Fix bug #733: step by step solving is not a good example for solveWithGuess | 2015-02-10 | |
| | | |||
| * | typo | 2015-02-10 | |
| | | |||
| * | Allows Lower|Upper as a template argument of CG and MINRES: in this case the ↵ | 2015-02-10 | |
| | | | | | | | | full matrix will be considered. | ||
| * | bug #897: Update unsupported iterative solvers based on IterativeSolverBased. | 2015-02-10 | |
| | | |||
| * | Using numext::pow instead of std::pow in poly_eval function. | 2015-02-04 | |
| | | |||
* | | bug #877, bug #572: Introduce a global Index typedef. Rename Sparse*::Index ↵ | 2014-12-04 | |
| | | | | | | | | to StorageIndex, make Dense*::StorageIndex an alias to DenseIndex. Overall this commit gets rid of all Index conversion warnings. | ||
| * | bug #876: remove usage of atanh2 in matrix power | 2014-12-08 | |
| | | |||
| * | bug #876, matrix_log_compute_2x2: directly use logp1 instead of atanh2 | 2014-12-08 | |
|/ | |||
* | Move D&C SVD to official SVD module. | 2014-10-29 | |
| | |||
* | BDCSVD: fix CMake install (missing separator). | 2014-10-24 | |
| | |||
* | Removed weird self assignment. | 2014-10-24 | |
| | |||
* | bug #701: workaround (min) and (max) blocking ADL by introducing ↵ | 2014-10-20 | |
| | | | | numext::mini and numext::maxi internal functions and a EIGEN_NOT_A_MACRO macro. | ||
* | Fix D&C SVD wrt zero matrices | 2014-10-17 | |
| | |||
* | D&C SVD: fix some numerical issues by truly skipping deflated singular ↵ | 2014-10-15 | |
| | | | | values when computing them | ||
* | D&C SVD: fix deflation of repeated singular values, fix sorting of singular ↵ | 2014-10-15 | |
| | | | | values, fix case of complete deflation | ||
* | Various numerical fixes in D&C SVD: I cannot make it fail with double, but ↵ | 2014-10-09 | |
| | | | | still need to tune for single precision, and carefully test with duplicated singular values | ||
* | Workaround MSVC issue. | 2014-10-07 | |
| | |||
* | Fix missing outer() member in DynamicSparseMatrix | 2014-10-07 | |
| | |||
* | D&C SVD: add scaling to avoid overflow, fix handling of fixed size matrices | 2014-10-06 | |
| | |||
* | Let KroneckerProduct exploits the recently introduced generic InnerIterator ↵ | 2014-09-29 | |
| | | | | class. | ||
* | Correcting the ReturnType in traits<KroneckerProduct<>> to include the ↵ | 2014-09-21 | |
| | | | | | | | correct Index type. Fixed mixup of types Rhs::Index and Lhs:Index in various loop variables. Added explicit type conversion for arithmetic expressions which may return a wider type. | ||
* | Fixed compiler warning on implicit integer conversion by separating index ↵ | 2014-09-20 | |
| | | | | type for matrix and permutation matrix which may not be equal. | ||
* | Many improvements in Divide&Conquer SVD: | 2014-09-22 | |
| | | | | | | - Fix many numerical issues, in particular regarding deflation. - Add heavy debugging output to help track numerical issues (there are still fews) - Make use of Eiegn's apply-inplane-rotation feature. |