| Commit message (Collapse) | Author | Age |
| |
|
|
|
|
| |
result.
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
SimplicialLLT without reordering)
|
| |
|
|
|
|
| |
use VERIFY, etc.)
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
Add respective regression unit test.
|
|\
| |
| |
| | |
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.
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
is the true solution and for trivial solution
|
| |
|
|\ |
|
| | |
|
| | |
|
| | |
|
|/ |
|
| |
|
|
|
|
| |
matrices, from MatrixMarket for instance
|
| |
|
|
|
|
|
|
|
| |
- Add support for Upper or Lower inputs.
- Add supports for sparse RHS
- Remove transposed cases, remove ordering method interface
- Add full access to PARDISO parameters
|
|
stable yet" warning
|