Skip to content

MinResLinearSolver

Linear system solver using the MINRES iterative algorithm

Templates:

  • CompressedRowSparseMatrixMat2x2d
  • CompressedRowSparseMatrixMat3x3d
  • CompressedRowSparseMatrixMat4x4d
  • CompressedRowSparseMatrixMat6x6d
  • CompressedRowSparseMatrixMat8x8d
  • CompressedRowSparseMatrixd
  • FullMatrix
  • GraphScattered
  • SparseMatrix

Target: Sofa.Component.LinearSolver.Iterative

namespace: sofa::component::linearsolver::iterative

parents:

  • MatrixLinearSolver

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
iterations maximum number of iterations of the Conjugate Gradient solution 25
tolerance desired precision of the Conjugate Gradient Solution (ratio of current residual norm over initial residual norm) 1e-05
graph Graph of residuals at each iteration

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