aboutsummaryrefslogtreecommitdiffhomepage
path: root/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
Commit message (Collapse)AuthorAge
* Revert "Revert "Adds EIGEN_CONSTEXPR and EIGEN_NOEXCEPT to rows(), cols(), ↵Gravatar Steve Bronder2021-03-24
| | | | | | innerStride(), outerStride(), and size()"" This reverts commit 5f0b4a4010af4cbf6161a0d1a03a747addc44a5d.
* Revert "Adds EIGEN_CONSTEXPR and EIGEN_NOEXCEPT to rows(), cols(), ↵Gravatar David Tellenbach2021-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(), ↵Gravatar Steve Bronder2021-03-04
| | | | outerStride(), and size()
* Remove EIGEN_MPL2_ONLY guards around code re-licensed from LGPL to MPL2 in ↵Gravatar Rasmus Munk Larsen2019-03-05
| | | | https://bitbucket.org/eigen/eigen/commits/2ca1e732398ea2c506427e9031212d63e9253b96
* MIsc. source and comment typosGravatar luz.paz2018-03-11
| | | | Found using `codespell` and `grep` from downstream FreeCAD
* Add LU::transpose().solve() and LU::adjoint().solve() API.Gravatar Gael Guennebaud2015-12-01
|
* Make the IterativeLinearSolvers module compatible with MPL2-only modeGravatar Gael Guennebaud2015-10-26
| | | | by defaulting to COLAMDOrdering and NaturalOrdering for ILUT and ILLT respectively.
* Doc: add link to doc of sparse solver conceptGravatar Gael Guennebaud2015-10-08
|
* Propagate precondition info to the iterative solver.Gravatar Gael Guennebaud2015-08-04
|
* Fix bug #1010: m_isInitialized was improperly updatedGravatar Gael Guennebaud2015-05-07
|
* bug #963: make IncompleteLUT compatible with non-default storage index types.Gravatar Gael Guennebaud2015-03-09
|
* Index refactoring: StorageIndex must be used for storage only (and locally ↵Gravatar Gael Guennebaud2015-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 ↵Gravatar Christoph Hertzberg2014-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 conversionGravatar Christoph Hertzberg2014-09-23
|
* Remove deprecated code not used by evaluatorsGravatar Gael Guennebaud2014-09-18
|
* Make IncompleteLUT use SparseSolverBase.Gravatar Gael Guennebaud2014-09-01
|
* Refactoring of sparse solvers through a SparseSolverBase class and usage of ↵Gravatar Gael Guennebaud2014-09-01
| | | | the Solve<> expression. Introduce a SolveWithGuess expression on top of Solve.
* IncompleteLUT should not raise an assert in compute if factorize failed.Gravatar Gael Guennebaud2013-07-17
|
* Fix bug #314: move remaining math functions from internal to numext namespaceGravatar Gael Guennebaud2013-06-10
|
* Replace int by IndexGravatar Desire NUENTSA2013-04-08
|
* Fixing bug #578. Thanks to Angelos <filiatra@gmail.com>Gravatar Christoph Hertzberg2013-04-03
|
* bug #482: pass scalar arguments by const references. Still remains a few ↵Gravatar Gael Guennebaud2013-02-25
| | | | cases that might affect the ABI (see the bug entry)
* Cleaning documentation pass in ordering and ILUTGravatar Gael Guennebaud2013-01-12
|
* Incomplete Cholesky preconditioner... not yet stableGravatar Desire NUENTSA2012-09-11
|
* Manual MPL2 relicensing fixesGravatar Benoit Jacob2012-07-13
|
* Automatic relicensing to MPL2 using Keirs script. Manual fixup follows.Gravatar Benoit Jacob2012-07-13
|
* add a noncopyable base class for decompositionsGravatar Gael Guennebaud2012-06-04
|
* Get rid of include directives inside namespace blocks (bug #339).Gravatar Jitse Niesen2012-04-15
|
* fix assertion conditionGravatar Gael Guennebaud2012-02-27
|
* add analyzePattern/factorize API to iterative solvers and basic preconditionersGravatar Gael Guennebaud2012-02-27
|
* clean a bit the ILUT codeGravatar Gael Guennebaud2012-02-14
|
* some cleaning and add copyrightsGravatar Gael Guennebaud2012-02-10
|
* Split the computation of the ILUT into two stepsGravatar Desire NUENTSA2012-02-10
|
* Add the implementation of the Incomplete LU preconditioner with dual ↵Gravatar Desire NUENTSA2012-02-10
threshold (ILUT) Modify the BiCGSTAB function to check the residual norm of the initial guess