Matrix: Mittelmann/fome20
Description: Linear programming problem (H. Mittelmann test set)
(bipartite graph drawing) |
Matrix properties | |
number of rows | 33,874 |
number of columns | 108,175 |
nonzeros | 232,647 |
structural full rank? | no |
structural rank | 33,798 |
# of blocks from dmperm | 853 |
# strongly connected comp. | 77 |
explicit zero entries | 0 |
nonzero pattern symmetry | 0% |
numeric value symmetry | 0% |
type | integer |
structure | rectangular |
Cholesky candidate? | no |
positive definite? | no |
author | |
editor | H. Mittelmann |
date | 2005 |
kind | linear programming problem |
2D/3D problem? | no |
Additional fields | size and type |
b | full 33874-by-1 |
c | full 108175-by-1 |
lo | full 108175-by-1 |
hi | full 108175-by-1 |
z0 | full 1-by-1 |
Notes:
Hans Mittelmann test set, http://plato.asu.edu/ftp/lptestset minimize c'*x, subject to A*x=b and lo <= x <= hi
Ordering statistics: | result |
nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD | 189,770,628 |
nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 6,827,078 |
SVD-based statistics: | |
norm(A) | 9.85417 |
min(svd(A)) | 0 |
cond(A) | Inf |
rank(A) | 33,787 |
sprank(A)-rank(A) | 11 |
null space dimension | 87 |
full numerical rank? | no |
singular value gap | 8.44444e+13 |
singular values (MAT file): | click here |
SVD method used: | s = svd (full (R)) ; where [~,R,E] = spqr (A') with droptol of zero |
status: | ok |
For a description of the statistics displayed above, click here.
Maintained by Tim Davis, last updated 12-Mar-2014.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.