Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Generalize IterativeSolverBase::solve to hanlde any sparse type as the ↵ | 2016-11-06 | |
| | | | | results (instead of SparseMatrix only) | ||
* | Fix regression in X = (X*X.transpose())/s with X rectangular by deferring ↵ | 2016-10-26 | |
| | | | | resizing of the destination after the creation of the evaluator of the source expression. | ||
* | bug #1167: simplify installation of header files using cmake's ↵ | 2016-08-29 | |
| | | | | install(DIRECTORY ...) command. | ||
* | Fix nesting of SolveWithGuess, and add unit test. | 2016-07-04 | |
| | |||
* | Add unit test for solveWithGuess, and fix template resolution. | 2016-07-04 | |
| | |||
* | Relax mixing-type constraints for binary coefficient-wise operators: | 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 | ||
* | Extend doc on shifting strategy | 2016-01-27 | |
| | |||
* | Add link to reference paper. | 2016-01-23 | |
| | |||
* | bug #1150: make IncompleteCholesky more robust by iteratively increase the ↵ | 2016-01-23 | |
| | | | | shift until the factorization succeed (with at most 10 attempts). | ||
* | Fix numerous doxygen shortcomings, and workaround some clang -Wdocumentation ↵ | 2016-01-01 | |
| | | | | warnings | ||
* | Add matrix-free solver example | 2015-12-07 | |
| | |||
* | Implement wrapper for matrix-free iterative solvers | 2015-12-07 | |
| | |||
* | Add LU::transpose().solve() and LU::adjoint().solve() API. | 2015-12-01 | |
| | |||
* | bug #1092: fix iterative solver ctors for expressions as input | 2015-10-26 | |
| | |||
* | Make the IterativeLinearSolvers module compatible with MPL2-only mode | 2015-10-26 | |
| | | | | by defaulting to COLAMDOrdering and NaturalOrdering for ILUT and ILLT respectively. | ||
* | Add missing include of std vector | 2015-10-08 | |
| | |||
* | Move IncompleteCholesky to official modules | 2015-10-08 | |
| | |||
* | Doc: add link to doc of sparse solver concept | 2015-10-08 | |
| | |||
* | Since there is no reason for evaluators to be nested by reference, let's ↵ | 2015-09-02 | |
| | | | | remove the evaluator<>::nestedType indirection. | ||
* | Cleaning pass on evaluators: remove the useless and error prone ↵ | 2015-09-02 | |
| | | | | evaluator<>::type indirection. | ||
* | Fix LSCG::solve with a sparse destination. | 2015-09-02 | |
| | |||
* | Propagate precondition info to the iterative solver. | 2015-08-04 | |
| | |||
* | Doc: explain perf and multithreading issues in sparse iterative solvers | 2015-06-26 | |
| | |||
* | Optimize CG to enable faster spare row-major * dense vector products when ↵ | 2015-06-25 | |
| | | | | the input matrix is complete (Upper|Lower) but column major. | ||
* | 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 bug #1010: m_isInitialized was improperly updated | 2015-05-07 | |
| | |||
* | Fix compilation of iterative solvers with dense matrices | 2015-03-09 | |
| | |||
* | bug #963: make IncompleteLUT compatible with non-default storage index types. | 2015-03-09 | |
| | |||
* | Rename LSCG to LeastSquaresConjugateGradient | 2015-03-05 | |
| | |||
* | Really use zero guess in ConjugateGradients::solve as documented | 2015-02-18 | |
| | | | | and expected for consistency with other methods. | ||
* | Add a CG-based solver for rectangular least-square problems (bug #975). | 2015-03-04 | |
| | |||
* | bug #897: fix regression in BiCGSTAB(mat) ctor (an all other iterative solvers). | 2015-02-16 | |
| | | | | Add respective regression unit test. | ||
* | Remove deprecated usage of expr::Index. | 2015-02-16 | |
| | |||
* | 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 | |
| | | |||
| * | 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: 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. | ||
* | bug #889: fix protected typedef | 2014-10-08 | |
| | |||
* | Make constructors explicit if they could lead to unintended implicit conversion | 2014-09-23 | |
| | |||
* | Fix typos in docs for IterativeLinearSolvers module | 2014-09-21 | |
| | |||
* | Fix copy-and-paste typo in SolveWithGuess assignment | 2014-09-21 | |
| | | | | This fixes compilation of code snippets in BiCGSTAB docs. | ||
* | Remove deprecated code not used by evaluators | 2014-09-18 | |
| | |||
* | Factorize solveWithGuess in IterativeSolverBase | 2014-09-01 | |
| | |||
* | Make IncompleteLUT use SparseSolverBase. | 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. |