https://bugzilla.redhat.com/show_bug.cgi?id=2253356
--- Comment #9 from Benson Muite <benson_muite(a)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/
--
You are receiving this mail because:
You are always notified about changes to this product and component
You are on the CC list for the bug.
https://bugzilla.redhat.com/show_bug.cgi?id=2253356
Report this comment as SPAM:
https://bugzilla.redhat.com/enter_bug.cgi?product=Bugzilla&format=rep...