The implementation incorporates a number of performance-enhancing techniques, some of which apply to U-match decomposition in general. These include compression methods that discard data associated to non-pivot rows and short-circuiting techniques that both save algebraic operations and sparsify output arrays. The implementation also deploys several methods specific to persistence computation, e.g. the so-called “twist" [1]} or “clear-and-compress" technique [2]}, [3]}. The implementation also dovetails with matrix compression schemes that have proved highly successful in reducing time and memory cost of computation [4]}.
