Analyzed
about 5 hours
ago.
based on code collected
about 5 hours
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 decreasing 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 7 days 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...
-
...
in 2016, 47% of companies did not have formal process in place to track OS code
-
...
check out hot projects on the Open Hub
-
...
65% of companies leverage OSS to speed application development in 2016
-
...
compare projects before you chose one to use
30 Day SummaryOct 15 2025 — Nov 14 2025
|
12 Month SummaryNov 14 2024 — Nov 14 2025
|
