Gael Guennebaud
|
285112fc55
|
Fix bug #688: make it clearer that CG is for both dense and sparse matrices.
|
2013-10-28 15:56:30 +01:00 |
|
Gael Guennebaud
|
c6da881849
|
Fix bug #674: typo in documentation example for BiCGSTAB. They are now proper snippet files.
|
2013-10-16 15:25:39 +02:00 |
|
Gael Guennebaud
|
bd689ccc28
|
IncompleteLUT should not raise an assert in compute if factorize failed.
|
2013-07-17 09:21:07 +02:00 |
|
Gael Guennebaud
|
1caeb814f0
|
Fix bicgstab for complexes, and avoid a duplicate computation
|
2013-07-02 08:14:10 +02:00 |
|
Gael Guennebaud
|
22820e950e
|
Improve BiCGSTAB robustness: fix a divide by zero and allow to restart with a new initial residual reference.
|
2013-07-01 11:49:23 +02:00 |
|
Gael Guennebaud
|
62670c83a0
|
Fix bug #314: move remaining math functions from internal to numext namespace
|
2013-06-10 23:40:56 +02:00 |
|
Desire NUENTSA
|
d97cd746ae
|
Replace int by Index
|
2013-04-08 08:51:58 +02:00 |
|
Christoph Hertzberg
|
9b33ab62da
|
Fixing bug #578. Thanks to Angelos <filiatra@gmail.com>
|
2013-04-03 16:29:16 +02:00 |
|
Desire NUENTSA
|
da6219b19d
|
Bug567 : Fix iterative solvers to immediately return when the initial guess is the true solution and for trivial solution
|
2013-03-20 16:15:18 +01:00 |
|
Desire NUENTSA
|
4107b371e3
|
Handle zero right hand side in CG and GMRES
|
2013-03-20 11:22:45 +01:00 |
|
Gael Guennebaud
|
12a1313b09
|
bug #482: pass scalar arguments by const references. Still remains a few cases that might affect the ABI (see the bug entry)
|
2013-02-25 18:05:57 +01:00 |
|
Gael Guennebaud
|
7262cf783c
|
Cleaning documentation pass in ordering and ILUT
|
2013-01-12 11:56:56 +01:00 |
|
Desire NUENTSA
|
7e0dd17312
|
Improve BiCGSTAB : With exact preconditioner, the solution should be found in one iteration
|
2012-09-19 18:32:02 +02:00 |
|
Desire NUENTSA
|
45672e724e
|
Incomplete Cholesky preconditioner... not yet stable
|
2012-09-11 12:12:19 +02:00 |
|
Gael Guennebaud
|
46b1c7a0ce
|
fix bug #485: conflict between a typedef and template type parameter
|
2012-07-13 20:54:38 +02:00 |
|
Benoit Jacob
|
0733e622a3
|
Manual MPL2 relicensing fixes
|
2012-07-13 14:42:47 -04:00 |
|
Benoit Jacob
|
69124cfca2
|
Automatic relicensing to MPL2 using Keirs script. Manual fixup follows.
|
2012-07-13 14:42:47 -04:00 |
|
Gael Guennebaud
|
fd32697074
|
Fix stopping criteria of CG
|
2012-06-06 17:11:16 +02:00 |
|
Gael Guennebaud
|
a2ae063491
|
add a noncopyable base class for decompositions
|
2012-06-04 13:21:15 +02:00 |
|
Jitse Niesen
|
3c412183b2
|
Get rid of include directives inside namespace blocks (bug #339).
|
2012-04-15 11:06:28 +01:00 |
|
Gael Guennebaud
|
0d3d46573e
|
fix assertion condition
|
2012-02-27 19:04:34 +01:00 |
|
Gael Guennebaud
|
eb168ef8ed
|
add analyzePattern/factorize API to iterative solvers and basic preconditioners
|
2012-02-27 14:10:26 +01:00 |
|
Gael Guennebaud
|
4cc6d7aa62
|
clean a bit the ILUT code
|
2012-02-14 22:07:19 +01:00 |
|
Gael Guennebaud
|
ef7f1371b2
|
some cleaning and add copyrights
|
2012-02-10 19:38:31 +01:00 |
|
Desire NUENTSA
|
edbebb14de
|
Split the computation of the ILUT into two steps
|
2012-02-10 18:57:01 +01:00 |
|
Desire NUENTSA
|
a815d962da
|
Add the implementation of the Incomplete LU preconditioner with dual threshold (ILUT)
Modify the BiCGSTAB function to check the residual norm of the initial guess
|
2012-02-10 10:59:39 +01:00 |
|
Gael Guennebaud
|
bdee0c9baa
|
set the default number of iteration to the size of the problem
|
2011-12-27 16:38:05 +01:00 |
|
Gael Guennebaud
|
e759086dcd
|
improve documentation of some sparse related classes
|
2011-12-02 19:02:49 +01:00 |
|
Gael Guennebaud
|
2d4fe54b73
|
fix CG example
|
2011-11-24 08:19:13 +01:00 |
|
Gael Guennebaud
|
53fa851724
|
move sparse solvers from unsupported/ to main Eigen/ and remove the "not stable yet" warning
|
2011-11-12 14:11:27 +01:00 |
|