C implementation of the QR decomposition algorithm.
The code is an adaptation to the needs of the darktable project of the code found here.
The Gram-Schmidt process is used, therefore the input matrice A (mxn) produces the reduced QR form, where Q is mxn and R is nxn. In order to apply this the rank of A has to be n.