Module triangular_solve 

sparse matrix triangular solve

Functions

solve_lower_triangular_in_place

assuming tril is a lower triangular matrix, solves the equation tril * x = rhs, and stores the result in rhs, implicitly conjugating tril if needed

solve_lower_triangular_transpose_in_place

assuming tril is a lower triangular matrix, solves the equation tril.transpose() * x = rhs, and stores the result in rhs, implicitly conjugating tril if needed

solve_unit_lower_triangular_in_place

assuming tril is a lower triangular matrix, solves the equation tril * x = rhs, and stores the result in rhs, implicitly conjugating tril if needed

solve_unit_lower_triangular_transpose_in_place

assuming tril is a lower triangular matrix, solves the equation tril.transpose() * x = rhs, and stores the result in rhs, implicitly conjugating tril if needed

solve_unit_upper_triangular_in_place

assuming triu is an upper triangular matrix, solves the equation triu * x = rhs, and stores the result in rhs, implicitly conjugating triu if needed

solve_unit_upper_triangular_transpose_in_place

assuming triu is an upper triangular matrix, solves the equation triu.transpose() * x = rhs, and stores the result in rhs, implicitly conjugating triu if needed

solve_upper_triangular_in_place

assuming triu is an upper triangular matrix, solves the equation triu * x = rhs, and stores the result in rhs, implicitly conjugating triu if needed

solve_upper_triangular_transpose_in_place

assuming triu is an upper triangular matrix, solves the equation triu.transpose() * x = rhs, and stores the result in rhs, implicitly conjugating triu if needed