https://bugzilla.redhat.com/show_bug.cgi?id=2253356 --- Comment #9 from Benson Muite <benson_muite@xxxxxxxxxxxxx> --- 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=report-spam&short_desc=Report%20of%20Bug%202253356%23c9 -- _______________________________________________ package-review mailing list -- package-review@xxxxxxxxxxxxxxxxxxxxxxx To unsubscribe send an email to package-review-leave@xxxxxxxxxxxxxxxxxxxxxxx Fedora Code of Conduct: https://docs.fedoraproject.org/en-US/project/code-of-conduct/ List Guidelines: https://fedoraproject.org/wiki/Mailing_list_guidelines List Archives: https://lists.fedoraproject.org/archives/list/package-review@xxxxxxxxxxxxxxxxxxxxxxx Do not reply to spam, report it: https://pagure.io/fedora-infrastructure/new_issue
