Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Bugfix: conjugate_gradient did not compile with lazy-evaluated RealScalar | Bernardo Bahia Monteiro | 2020-03-29 |
| | | | | | | | | | | | | | | | | | The error generated by the compiler was: no matching function for call to 'maxi' RealScalar threshold = numext::maxi(tol*tol*rhsNorm2,considerAsZero); The important part in the following notes was: candidate template ignored: deduced conflicting types for parameter 'T'" ('codi::Multiply11<...>' vs. 'codi::ActiveReal<...>') EIGEN_ALWAYS_INLINE T maxi(const T& x, const T& y) I am using CoDiPack to provide the RealScalar type. This bug was introduced in bc000deaa Fix conjugate-gradient for very small rhs | ||
* | Iterative solvers: unify and fix handling of multiple rhs. | Gael Guennebaud | 2018-10-15 |
| | | | | m_info was not properly computed and the logic was repeated in several places. | ||
* | Fix conjugate-gradient for very small rhs | Gael Guennebaud | 2018-09-13 |
| | |||
* | Implement wrapper for matrix-free iterative solvers | Gael Guennebaud | 2015-12-07 |
| | |||
* | bug #1092: fix iterative solver ctors for expressions as input | Gael Guennebaud | 2015-10-26 |
| | |||
* | Doc: add link to doc of sparse solver concept | Gael Guennebaud | 2015-10-08 |
| | |||
* | Doc: explain perf and multithreading issues in sparse iterative solvers | Gael Guennebaud | 2015-06-26 |
| | |||
* | Optimize CG to enable faster spare row-major * dense vector products when ↵ | Gael Guennebaud | 2015-06-25 |
| | | | | the input matrix is complete (Upper|Lower) but column major. | ||
* | Clarify documentation of the tolerance and error returned in iterative solvers | Gael Guennebaud | 2015-06-25 |
| | |||
* | Fix compilation of iterative solvers with dense matrices | Gael Guennebaud | 2015-03-09 |
| | |||
* | Rename LSCG to LeastSquaresConjugateGradient | Gael Guennebaud | 2015-03-05 |
| | |||
* | Really use zero guess in ConjugateGradients::solve as documented | Jan Blechta | 2015-02-18 |
| | | | | and expected for consistency with other methods. | ||
* | Add a CG-based solver for rectangular least-square problems (bug #975). | Gael Guennebaud | 2015-03-04 |
| | |||
* | 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) | ||
* | Merge Index-refactoring branch with default, fix PastixSupport, remove some ↵ | Gael Guennebaud | 2015-02-13 |
|\ | | | | | | | useless typedefs | ||
| * | Fix bug #733: step by step solving is not a good example for solveWithGuess | Jan Blechta | 2015-02-10 |
| | | |||
| * | Allows Lower|Upper as a template argument of CG and MINRES: in this case the ↵ | Gael Guennebaud | 2015-02-10 |
| | | | | | | | | full matrix will be considered. | ||
| * | bug #897: makes iterative sparse solvers use a Ref<SparseMatrix> instead of ↵ | Gael Guennebaud | 2015-02-09 |
| | | | | | | | | a SparseMatrix pointer. This fixes usage of iterative solvers with a Map<SparseMatrix>. | ||
* | | 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 |
| | |||
* | Factorize solveWithGuess in IterativeSolverBase | Gael Guennebaud | 2014-09-01 |
| | |||
* | 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. | ||
* | Fix bug #688: make it clearer that CG is for both dense and sparse matrices. | Gael Guennebaud | 2013-10-28 |
| | |||
* | Fix bug #314: move remaining math functions from internal to numext namespace | Gael Guennebaud | 2013-06-10 |
| | |||
* | Bug567 : Fix iterative solvers to immediately return when the initial guess ↵ | Desire NUENTSA | 2013-03-20 |
| | | | | is the true solution and for trivial solution | ||
* | Handle zero right hand side in CG and GMRES | Desire NUENTSA | 2013-03-20 |
| | |||
* | Automatic relicensing to MPL2 using Keirs script. Manual fixup follows. | Benoit Jacob | 2012-07-13 |
| | |||
* | Fix stopping criteria of CG | Gael Guennebaud | 2012-06-06 |
| | |||
* | Get rid of include directives inside namespace blocks (bug #339). | Jitse Niesen | 2012-04-15 |
| | |||
* | set the default number of iteration to the size of the problem | Gael Guennebaud | 2011-12-27 |
| | |||
* | improve documentation of some sparse related classes | Gael Guennebaud | 2011-12-02 |
| | |||
* | fix CG example | Gael Guennebaud | 2011-11-24 |
| | |||
* | move sparse solvers from unsupported/ to main Eigen/ and remove the "not ↵ | Gael Guennebaud | 2011-11-12 |
stable yet" warning |