Function sprs::linalg::trisolve::lsolve_csc_dense_rhs

pub fn lsolve_csc_dense_rhs<N, I, V: ?Sized>(
    lower_tri_mat: CsMatViewI<N, I>, 
    rhs: &mut V
) -> Result<(), SprsError> where
    N: Copy + Num,
    V: IndexMut<usize, Output = N> + VecDim<N>,
    I: SpIndex, 

Solve a sparse lower triangular matrix system, with a csc matrix and a dense vector as inputs

The solve results are written into the provided values.

This method does not require the matrix to actually be lower triangular, but is most efficient if the first element of each column is the diagonal element (thus actual sorted lower triangular matrices work best). Otherwise, logarithmic search for the diagonal element has to be performed for each column.