Matrix: Mittelmann/neos1
Description: Linear programming problem (H. Mittelmann test set)
|
| (bipartite graph drawing) |
 |
| Matrix properties | |
| number of rows | 131,581 |
| number of columns | 133,473 |
| nonzeros | 599,590 |
| structural full rank? | yes |
| structural rank | 131,581 |
| # of blocks from dmperm | 1 |
| # strongly connected comp. | 1 |
| 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 131581-by-1 |
| c | full 133473-by-1 |
| lo | full 133473-by-1 |
| hi | full 133473-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 | 176,041,554 |
| nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 6,326,956,683 |
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.