Open jbrown1618 opened 5 years ago
The current implementation of the cholesky decomposition involves lots of copying, like L = L.set(i, j, value). The whole thing would be a little bit more efficient if we operated on a S[][] instead of a Matrix<S>.
L = L.set(i, j, value)
S[][]
Matrix<S>
The current implementation of the cholesky decomposition involves lots of copying, like
L = L.set(i, j, value). The whole thing would be a little bit more efficient if we operated on aS[][]instead of aMatrix<S>.