The SuiteSparse Matrix Collection (formerly the University of Florida Sparse Matrix Collection) is a widely used set of sparse matrix benchmarks collected from a wide range of applications. See the about page for more information.
≤ Number of Rows ≤
≤ Number of Columns ≤
≤ Number of Nonzeros ≤
≤ Pattern Symmetry ≤
≤ Numerical Symmetry ≤
≤ Number of Strongly Connected Components ≤
Displaying matrices 81 - 100 of 2757 in total
Id ⬆ Name Group Rows Cols Nonzeros Kind Date
81 blckhole HB 2,132 2,132 14,872 Structural Problem 1983
82 bp_0 HB 822 822 3,276 Optimization Problem Sequence 1978
83 bp_1000 HB 822 822 4,661 Subsequent Optimization Problem 1978
84 bp_1200 HB 822 822 4,726 Subsequent Optimization Problem 1978
85 bp_1400 HB 822 822 4,790 Subsequent Optimization Problem 1978
86 bp_1600 HB 822 822 4,841 Subsequent Optimization Problem 1978
87 bp_200 HB 822 822 3,802 Subsequent Optimization Problem 1978
88 bp_400 HB 822 822 4,028 Subsequent Optimization Problem 1978
89 bp_600 HB 822 822 4,172 Subsequent Optimization Problem 1978
90 bp_800 HB 822 822 4,534 Subsequent Optimization Problem 1978
91 can_1054 HB 1,054 1,054 12,196 Structural Problem 1981
92 can_1072 HB 1,072 1,072 12,444 Structural Problem 1981
93 can_144 HB 144 144 1,296 Structural Problem 1981
94 can_161 HB 161 161 1,377 Structural Problem 1981
95 can_187 HB 187 187 1,491 Structural Problem 1981
96 can_229 HB 229 229 1,777 Structural Problem 1981
97 can_24 HB 24 24 160 Structural Problem 1981
98 can_256 HB 256 256 2,916 Structural Problem 1981
99 can_268 HB 268 268 3,082 Structural Problem 1981
100 can_292 HB 292 292 2,540 Structural Problem 1981