optimise compression of L in PLE (was PLS) decomposition

Issue #23 resolved
Martin Albrecht repo owner created an issue

We know a priori in PLS how the column swaps look like such that we don't need to consider all these bit operations. This could speed up our code considerably especially for sparse-ish matrices.

Comments (1)

  1. Log in to comment