Module extendr_api::prelude::sparse::linalg::triangular_solve
Expand description
Solving sparse triangular linear systems with a dense right-hand-side.
Functionsยง
- Assuming
self
is a lower triangular matrix, solves the equationOp(self) * X = rhs
, and stores the result inrhs
, whereOp
is either the conjugate or the identity depending on the value ofconj
. - Assuming
self
is a lower triangular matrix, solves the equationOp(self).transpose() * X = rhs
, and stores the result inrhs
, whereOp
is either the conjugate or the identity depending on the value ofconj
. - Assuming
self
is a unit lower triangular matrix, solves the equationOp(self) * X = rhs
, and stores the result inrhs
, whereOp
is either the conjugate or the identity depending on the value ofconj
. - Assuming
self
is a unit lower triangular matrix, solves the equationOp(self).transpose() * X = rhs
, and stores the result inrhs
, whereOp
is either the conjugate or the identity depending on the value ofconj
. - Assuming
self
is a unit upper triangular matrix, solves the equationOp(self) * X = rhs
, and stores the result inrhs
, whereOp
is either the conjugate or the identity depending on the value ofconj
. - Assuming
self
is a unit upper triangular matrix, solves the equationOp(self).transpose() * X = rhs
, and stores the result inrhs
, whereOp
is either the conjugate or the identity depending on the value ofconj
. - Assuming
self
is an upper triangular matrix, solves the equationOp(self) * X = rhs
, and stores the result inrhs
, whereOp
is either the conjugate or the identity depending on the value ofconj
. - Assuming
self
is an upper triangular matrix, solves the equationOp(self).transpose() * X = rhs
, and stores the result inrhs
, whereOp
is either the conjugate or the identity depending on the value ofconj
.