Persistence matrix module

[hschreiber]

The matrix module is not finished yet, but I would like to have feedback on the structure, in particular on the way the different options are handled. The options are listed in options.h and they are processed in matrix.h. The basic functions of a matrix can also be found in matrix.h, and the more specialized functions are in their respective header (*_pairing, *_rep_cycles, *_vine_swap).

There are three different types of matrices:

• the basic boundary matrix which can be reduced to R,
• the boundary matrix but decomposed in RU (R is the usual reduced boundary matrix and U is such that R times U is the original boundary matrix)
• and the matrix representing the base of a chain complex (as defined in Clement's and Steve's paper about zigzag persistence).

In example/comp_test.cpp is a temporary example of how to call all different options implemented yet. The idea was to call all possible functions with trivial parameters to verify that everything compiles correctly, but not to test the functions.