| Commit message (Collapse) | Author | Age |
| |
|
| |
|
|
|
|
| |
shift until the factorization succeed (with at most 10 attempts).
|
|
|
|
| |
warnings
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
by defaulting to COLAMDOrdering and NaturalOrdering for ILUT and ILLT respectively.
|
| |
|
| |
|
| |
|
|
|
|
| |
remove the evaluator<>::nestedType indirection.
|
|
|
|
| |
evaluator<>::type indirection.
|
| |
|
| |
|
| |
|
|
|
|
| |
the input matrix is complete (Upper|Lower) but column major.
|
| |
|
|
|
|
| |
recomputing the accurate residual.
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
and expected for consistency with other methods.
|
| |
|
|
|
|
| |
Add respective regression unit test.
|
| |
|
|
|
|
|
|
| |
- 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)
|
|
|
|
| |
when it make sense). In all other cases use the global Index type.
|
|\
| |
| |
| | |
useless typedefs
|
| | |
|
| |
| |
| |
| | |
full matrix will be considered.
|
| |
| |
| |
| | |
a SparseMatrix pointer. This fixes usage of iterative solvers with a Map<SparseMatrix>.
|
|/
|
|
| |
to StorageIndex, make Dense*::StorageIndex an alias to DenseIndex. Overall this commit gets rid of all Index conversion warnings.
|
| |
|
| |
|
| |
|
|
|
|
| |
This fixes compilation of code snippets in BiCGSTAB docs.
|
| |
|
| |
|
| |
|
|
|
|
| |
the Solve<> expression. Introduce a SolveWithGuess expression on top of Solve.
|
|
|
|
| |
destroy a very good initial guess.
|
|
|
|
| |
restart was much too large.
|
| |
|
| |
|
|
|
|
| |
proper snippet files.
|
| |
|
| |
|