Matrix: Mittelmann/spal_004
Description: Linear programming problem (H. Mittelman test set)
|
| (bipartite graph drawing) |
 |
| Matrix properties | |
| number of rows | 10,203 |
| number of columns | 321,696 |
| nonzeros | 46,168,124 |
| structural full rank? | yes |
| structural rank | 10,203 |
| # of blocks from dmperm | 1 |
| # strongly connected comp. | 1 |
| 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 10203-by-1 |
| c | full 321696-by-1 |
| lo | full 321696-by-1 |
| hi | full 321696-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 | 3,062,060,062 |
| nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 50,727,756 |
| SVD-based statistics: | |
| norm(A) | 0.144294 |
| min(svd(A)) | 3.66322e-06 |
| cond(A) | 39389.9 |
| rank(A) | 10,203 |
| sprank(A)-rank(A) | 0 |
| null space dimension | 0 |
| full numerical rank? | yes |
| 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.