eigen - C++ library for linear algebra

	Commit message (Collapse)	Author	Age
*	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.
*	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.
*	bug #889: fix protected typedef	Gael Guennebaud	2014-10-08
\|
*	Make constructors explicit if they could lead to unintended implicit conversion	Christoph Hertzberg	2014-09-23
\|
*	Fix typos in docs for IterativeLinearSolvers module	Jitse Niesen	2014-09-21
\|
*	Fix copy-and-paste typo in SolveWithGuess assignment	Jitse Niesen	2014-09-21
\| \| \| \|	This fixes compilation of code snippets in BiCGSTAB docs.
*	Remove deprecated code not used by evaluators	Gael Guennebaud	2014-09-18
\|
*	Factorize solveWithGuess in IterativeSolverBase	Gael Guennebaud	2014-09-01
\|
*	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.
*	Do not apply the preconditioner before starting the iterations as this might ↵	Gael Guennebaud	2014-08-21
\| \| \| \|	destroy a very good initial guess.
*	Fix regeression in bicgstab: the threshold used to detect the need for a ↵	Gael Guennebaud	2014-07-01
\| \| \| \|	restart was much too large.
*	Fix Jacobi preconditioner with zero diagonal entries	Gael Guennebaud	2014-06-17
\|
*	Fix bug #688: make it clearer that CG is for both dense and sparse matrices.	Gael Guennebaud	2013-10-28
\|
*	Fix bug #674: typo in documentation example for BiCGSTAB. They are now ↵	Gael Guennebaud	2013-10-16
\| \| \| \|	proper snippet files.
*	IncompleteLUT should not raise an assert in compute if factorize failed.	Gael Guennebaud	2013-07-17
\|
*	Fix bicgstab for complexes, and avoid a duplicate computation	Gael Guennebaud	2013-07-02
\|
*	Improve BiCGSTAB robustness: fix a divide by zero and allow to restart with ↵	Gael Guennebaud	2013-07-01
\| \| \| \|	a new initial residual reference.
*	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
\|
*	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
\|
*	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
\|
*	Improve BiCGSTAB : With exact preconditioner, the solution should be found ↵	Desire NUENTSA	2012-09-19
\| \| \| \|	in one iteration
*	Incomplete Cholesky preconditioner... not yet stable	Desire NUENTSA	2012-09-11
\|
*	fix bug #485: conflict between a typedef and template type parameter	Gael Guennebaud	2012-07-13
\|
*	Manual MPL2 relicensing fixes	Benoit Jacob	2012-07-13
\|
*	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
\|
*	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
*	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