Skip to content

SparseLUSolver

Direct linear solver based on Sparse LU factorization, implemented with the CSPARSE library

CompressedRowSparseMatrixMat3x3d

Templates:

  • CompressedRowSparseMatrixMat3x3d

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
Name Description Destination type name
context Graph Node containing this object (or BaseContext::getDefault() if no graph is used) BaseContext
slaves Sub-objects used internally by this object BaseObject
master nullptr for regular objects, or master object for which this object is one sub-objects BaseObject
linearSystem The linear system to solve TypedMatrixLinearSystem<CompressedRowSparseMatrixMat3x3d>
orderingMethod Ordering method used by this component BaseOrderingMethod

CompressedRowSparseMatrixd

Templates:

  • CompressedRowSparseMatrixd

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
Name Description Destination type name
context Graph Node containing this object (or BaseContext::getDefault() if no graph is used) BaseContext
slaves Sub-objects used internally by this object BaseObject
master nullptr for regular objects, or master object for which this object is one sub-objects BaseObject
linearSystem The linear system to solve TypedMatrixLinearSystem<CompressedRowSparseMatrixd>
orderingMethod Ordering method used by this component BaseOrderingMethod