Analyzed
1 day
ago.
based on code collected
2 days
ago.
Project Summary
SuperLU contains a set of subroutines to solve a sparse linear system A*X=B. It uses Gaussian elimination with partial pivoting (GEPP).
The columns of A may be preordered before factorization; the preordering for sparsity is completely separate from the factorization.
In a Nutshell, SuperLU...
- ...
- ...
-
...
has a well established, mature codebase
maintained by a average size development team
with stable Y-O-Y commits -
...
took an estimated 43 years of effort (COCOMO model)
starting with its first commit in July, 2015
ending with its most recent commit about 1 month ago
Quick Reference
https://github.com/xiaoyeli/superlu
Project Security
Vulnerabilities per Version ( last 10 releases )
There are no reported vulnerabilities
Project Vulnerability Report
Security Confidence Index
Poor security track-record
Favorable security track-record
Vulnerability Exposure Index
Many reported vulnerabilities
Few reported vulnerabilities
Did You Know...
-
...
nearly 1 in 3 companies have no process for identifying, tracking, or remediating known open source vulnerabilities
-
...
learn about Open Hub updates and features on the Open Hub blog
-
...
use of OSS increased in 65% of companies in 2016
-
...
you can subscribe to e-mail newsletters to receive update from the Open Hub blog
30 Day SummarySep 7 2026 — Oct 7 2026
|
12 Month SummaryOct 7 2025 — Oct 7 2026
|
