# 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 equation`Op(self) * X = rhs`

, and stores the result in`rhs`

, where`Op`

is either the conjugate or the identity depending on the value of`conj`

. - Assuming
`self`

is a lower triangular matrix, solves the equation`Op(self).transpose() * X = rhs`

, and stores the result in`rhs`

, where`Op`

is either the conjugate or the identity depending on the value of`conj`

. - Assuming
`self`

is a unit lower triangular matrix, solves the equation`Op(self) * X = rhs`

, and stores the result in`rhs`

, where`Op`

is either the conjugate or the identity depending on the value of`conj`

. - Assuming
`self`

is a unit lower triangular matrix, solves the equation`Op(self).transpose() * X = rhs`

, and stores the result in`rhs`

, where`Op`

is either the conjugate or the identity depending on the value of`conj`

. - Assuming
`self`

is a unit upper triangular matrix, solves the equation`Op(self) * X = rhs`

, and stores the result in`rhs`

, where`Op`

is either the conjugate or the identity depending on the value of`conj`

. - Assuming
`self`

is a unit upper triangular matrix, solves the equation`Op(self).transpose() * X = rhs`

, and stores the result in`rhs`

, where`Op`

is either the conjugate or the identity depending on the value of`conj`

. - Assuming
`self`

is an upper triangular matrix, solves the equation`Op(self) * X = rhs`

, and stores the result in`rhs`

, where`Op`

is either the conjugate or the identity depending on the value of`conj`

. - Assuming
`self`

is an upper triangular matrix, solves the equation`Op(self).transpose() * X = rhs`

, and stores the result in`rhs`

, where`Op`

is either the conjugate or the identity depending on the value of`conj`

.