SparseLUSolver
Direct linear solver based on Sparse LU factorization, implemented with the CSPARSE library
Templates:
CompressedRowSparseMatrixMat3x3dCompressedRowSparseMatrixd
Target: CSparseSolvers
namespace: csparsesolvers
parents:
OrderingMethodAccessor
Data:
| Name | Description | Default value |
|---|---|---|
| name | object name | unnamed |
| printLog | if true, emits extra messages at runtime. | 0 |
| tags | list of the subsets the objet belongs to | |
| bbox | this object bounding box | |
| componentState | The state of the component among (Dirty, Valid, Undefined, Loading, Invalid). | Undefined |
| listening | if true, handle the events, otherwise ignore the events | 0 |
| parallelInverseProduct | Parallelize the computation of the product J*M^{-1}*J^T where M is the matrix of the linear system and J is any matrix with compatible dimensions | 0 |
| tolerance | tolerance of factorization | 0.001 |
| L_nnz | Number of non-zero values in the lower triangular matrix of the factorization. The lower, the faster the system is solved. | 0 |
Links:
| Name | Description |
|---|---|
| context | Graph Node containing this object (or BaseContext::getDefault() if no graph is used) |
| slaves | Sub-objects used internally by this object |
| master | nullptr for regular objects, or master object for which this object is one sub-objects |
| linearSystem | The linear system to solve |
| orderingMethod | Ordering method used by this component |