Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Revert "Revert "Adds EIGEN_CONSTEXPR and EIGEN_NOEXCEPT to rows(), cols(), ↵ | Steve Bronder | 2021-03-24 |
| | | | | | | innerStride(), outerStride(), and size()"" This reverts commit 5f0b4a4010af4cbf6161a0d1a03a747addc44a5d. | ||
* | Revert "Adds EIGEN_CONSTEXPR and EIGEN_NOEXCEPT to rows(), cols(), ↵ | David Tellenbach | 2021-03-05 |
| | | | | | | | innerStride(), outerStride(), and size()" This reverts commit 6cbb3038ac48cb5fe17eba4dfbf26e3e798041f1 because it breaks clang-10 builds on x86 and aarch64 when C++11 is enabled. | ||
* | Adds EIGEN_CONSTEXPR and EIGEN_NOEXCEPT to rows(), cols(), innerStride(), ↵ | Steve Bronder | 2021-03-04 |
| | | | | outerStride(), and size() | ||
* | Remove EIGEN_MPL2_ONLY guards around code re-licensed from LGPL to MPL2 in ↵ | Rasmus Munk Larsen | 2019-03-05 |
| | | | | https://bitbucket.org/eigen/eigen/commits/2ca1e732398ea2c506427e9031212d63e9253b96 | ||
* | MIsc. source and comment typos | luz.paz | 2018-03-11 |
| | | | | Found using `codespell` and `grep` from downstream FreeCAD | ||
* | Add LU::transpose().solve() and LU::adjoint().solve() API. | Gael Guennebaud | 2015-12-01 |
| | |||
* | Make the IterativeLinearSolvers module compatible with MPL2-only mode | Gael Guennebaud | 2015-10-26 |
| | | | | by defaulting to COLAMDOrdering and NaturalOrdering for ILUT and ILLT respectively. | ||
* | Doc: add link to doc of sparse solver concept | Gael Guennebaud | 2015-10-08 |
| | |||
* | Propagate precondition info to the iterative solver. | Gael Guennebaud | 2015-08-04 |
| | |||
* | Fix bug #1010: m_isInitialized was improperly updated | Gael Guennebaud | 2015-05-07 |
| | |||
* | bug #963: make IncompleteLUT compatible with non-default storage index types. | Gael Guennebaud | 2015-03-09 |
| | |||
* | 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. | ||
* | 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 |
| | |||
* | Make IncompleteLUT use SparseSolverBase. | 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. | ||
* | IncompleteLUT should not raise an assert in compute if factorize failed. | Gael Guennebaud | 2013-07-17 |
| | |||
* | Fix bug #314: move remaining math functions from internal to numext namespace | Gael Guennebaud | 2013-06-10 |
| | |||
* | Replace int by Index | Desire NUENTSA | 2013-04-08 |
| | |||
* | Fixing bug #578. Thanks to Angelos <filiatra@gmail.com> | Christoph Hertzberg | 2013-04-03 |
| | |||
* | bug #482: pass scalar arguments by const references. Still remains a few ↵ | Gael Guennebaud | 2013-02-25 |
| | | | | cases that might affect the ABI (see the bug entry) | ||
* | Cleaning documentation pass in ordering and ILUT | Gael Guennebaud | 2013-01-12 |
| | |||
* | Incomplete Cholesky preconditioner... not yet stable | Desire NUENTSA | 2012-09-11 |
| | |||
* | Manual MPL2 relicensing fixes | Benoit Jacob | 2012-07-13 |
| | |||
* | Automatic relicensing to MPL2 using Keirs script. Manual fixup follows. | Benoit Jacob | 2012-07-13 |
| | |||
* | add a noncopyable base class for decompositions | Gael Guennebaud | 2012-06-04 |
| | |||
* | Get rid of include directives inside namespace blocks (bug #339). | Jitse Niesen | 2012-04-15 |
| | |||
* | fix assertion condition | Gael Guennebaud | 2012-02-27 |
| | |||
* | add analyzePattern/factorize API to iterative solvers and basic preconditioners | Gael Guennebaud | 2012-02-27 |
| | |||
* | clean a bit the ILUT code | Gael Guennebaud | 2012-02-14 |
| | |||
* | some cleaning and add copyrights | Gael Guennebaud | 2012-02-10 |
| | |||
* | Split the computation of the ILUT into two steps | Desire NUENTSA | 2012-02-10 |
| | |||
* | Add the implementation of the Incomplete LU preconditioner with dual ↵ | Desire NUENTSA | 2012-02-10 |
threshold (ILUT) Modify the BiCGSTAB function to check the residual norm of the initial guess |