Matrix: Mittelmann/fome11
Description: Linear programming problem (H. Mittelmann test set)
(bipartite graph drawing) |
Matrix properties | |
number of rows | 12,142 |
number of columns | 24,460 |
nonzeros | 71,264 |
structural full rank? | yes |
structural rank | 12,142 |
# of blocks from dmperm | 1 |
# strongly connected comp. | 2 |
explicit zero entries | 0 |
nonzero pattern symmetry | 0% |
numeric value symmetry | 0% |
type | real |
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 12142-by-1 |
c | full 24460-by-1 |
lo | full 24460-by-1 |
hi | full 24460-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 | 18,389,701 |
nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 3,089,412 |
SVD-based statistics: | |
norm(A) | 15.917 |
min(svd(A)) | 4.5988e-16 |
cond(A) | 3.46111e+16 |
rank(A) | 12,116 |
sprank(A)-rank(A) | 26 |
null space dimension | 26 |
full numerical rank? | no |
singular value gap | 2.88598e+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.