https://bugzilla.redhat.com/show_bug.cgi?id=2253356
--- Comment #9 from Benson Muite benson_muite@emailplus.org --- Thanks for the update. Will go through it. Determining near non-invertibility of a matrix through approximate sparsity preserving rank revealing factorizations seems to have less literature than sparsity preserving matrix factorizations. An earlier Fortran code is at: https://web.stanford.edu/group/SOL/software/lusol/ A C version seems to also be used in: https://sourceforge.net/projects/lpsolve/