Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Doc: explain perf and multithreading issues in sparse iterative solvers | 2015-06-26 | |
| | |||
* | Clarify documentation of the tolerance and error returned in iterative solvers | 2015-06-25 | |
| | |||
* | BiCGSTAB: set default guess to 0, and improve restart mechanism by ↵ | 2015-06-05 | |
| | | | | recomputing the accurate residual. | ||
* | 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) | ||
* | 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 | |
| | | |||
| * | bug #897: makes iterative sparse solvers use a Ref<SparseMatrix> instead of ↵ | 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 ↵ | 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 | 2014-09-23 | |
| | |||
* | Fix typos in docs for IterativeLinearSolvers module | 2014-09-21 | |
| | |||
* | Remove deprecated code not used by evaluators | 2014-09-18 | |
| | |||
* | Factorize solveWithGuess in IterativeSolverBase | 2014-09-01 | |
| | |||
* | Refactoring of sparse solvers through a SparseSolverBase class and usage of ↵ | 2014-09-01 | |
| | | | | the Solve<> expression. Introduce a SolveWithGuess expression on top of Solve. | ||
* | Do not apply the preconditioner before starting the iterations as this might ↵ | 2014-08-21 | |
| | | | | destroy a very good initial guess. | ||
* | Fix regeression in bicgstab: the threshold used to detect the need for a ↵ | 2014-07-01 | |
| | | | | restart was much too large. | ||
* | Fix bug #674: typo in documentation example for BiCGSTAB. They are now ↵ | 2013-10-16 | |
| | | | | proper snippet files. | ||
* | Fix bicgstab for complexes, and avoid a duplicate computation | 2013-07-02 | |
| | |||
* | Improve BiCGSTAB robustness: fix a divide by zero and allow to restart with ↵ | 2013-07-01 | |
| | | | | a new initial residual reference. | ||
* | Bug567 : Fix iterative solvers to immediately return when the initial guess ↵ | 2013-03-20 | |
| | | | | is the true solution and for trivial solution | ||
* | Improve BiCGSTAB : With exact preconditioner, the solution should be found ↵ | 2012-09-19 | |
| | | | | in one iteration | ||
* | Automatic relicensing to MPL2 using Keirs script. Manual fixup follows. | 2012-07-13 | |
| | |||
* | Get rid of include directives inside namespace blocks (bug #339). | 2012-04-15 | |
| | |||
* | some cleaning and add copyrights | 2012-02-10 | |
| | |||
* | Split the computation of the ILUT into two steps | 2012-02-10 | |
| | |||
* | Add the implementation of the Incomplete LU preconditioner with dual ↵ | 2012-02-10 | |
| | | | | | | threshold (ILUT) Modify the BiCGSTAB function to check the residual norm of the initial guess | ||
* | set the default number of iteration to the size of the problem | 2011-12-27 | |
| | |||
* | improve documentation of some sparse related classes | 2011-12-02 | |
| | |||
* | move sparse solvers from unsupported/ to main Eigen/ and remove the "not ↵ | 2011-11-12 | |
stable yet" warning |