Matrix: Qaplib/lp_nug05
Description: Netlib LP problem nug05: minimize c'*x, where Ax=b, lo<=x<=hi
|
| (bipartite graph drawing) |
 |
| Matrix properties | |
| number of rows | 210 |
| number of columns | 225 |
| nonzeros | 1,050 |
| structural full rank? | yes |
| structural rank | 210 |
| # 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 | M. Resende |
| editor | M. Resende |
| date | 1995 |
| kind | linear programming problem |
| 2D/3D problem? | no |
| Additional fields | size and type |
| b | full 210-by-1 |
| c | full 225-by-1 |
| lo | full 225-by-1 |
| hi | full 225-by-1 |
| z0 | full 1-by-1 |
| Ordering statistics: | result |
| nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD | 11,451 |
| nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 11,942 |
| SVD-based statistics: | |
| norm(A) | 5.32521 |
| min(svd(A)) | 1.02105e-16 |
| cond(A) | 5.21544e+16 |
| rank(A) | 148 |
| sprank(A)-rank(A) | 62 |
| null space dimension | 62 |
| full numerical rank? | no |
| singular value gap | 6.00375e+14 |
| singular values (MAT file): | click here |
| SVD method used: | s = svd (full (A)) ; |
| 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.