Routine svd from Matlab 18.104.22.1684 (R2008a) used to calculate the singular values.
|Matrix properties (click for a legend)|
|number of rows||415|
|number of columns||6,184|
|structural full rank?||no|
|dimension of the numerical null space||5,780|
|numerical rank / min(size(A))||0.97349|
|Euclidean norm of A||703.41|
|calculated singular value # 404||0.62595|
| numerical rank defined using a tolerance |
|calculated singular value # 405||2.6545e-015|
| gap in the singular values at the numerical rank: |
singular value # 404 / singular value # 405
|calculated condition number||7.6084e+093|
|# of blocks from dmperm||3|
|# strongly connected comp.||12|
|explicit zero entries||0|
|nonzero pattern symmetry||0%|
|numeric value symmetry||0%|
|kind||linear programming problem|
|Additional fields||size and type|
A Netlib LP problem, in lp/data. For more information send email to email@example.com with the message: send index from lp send readme from lp/data The following are relevant excerpts from lp/data/readme (by David M. Gay): The column and nonzero counts in the PROBLEM SUMMARY TABLE below exclude slack and surplus columns and the right-hand side vector, but include the cost row. We have omitted other free rows and all but the first right-hand side vector, as noted below. The byte count is for the MPS compressed file; it includes a newline character at the end of each line. These files start with a blank initial line intended to prevent mail programs from discarding any of the data. The BR column indicates whether a problem has bounds or ranges: B stands for "has bounds", R for "has ranges". The BOUND-TYPE TABLE below shows the bound types present in those problems that have bounds. The optimal value is from MINOS version 5.3 (of Sept. 1988) running on a VAX with default options. PROBLEM SUMMARY TABLE Name Rows Cols Nonzeros Bytes BR Optimal Value D6CUBE 416 6184 43888 167633 B 3.1549166667E+02 BOUND-TYPE TABLE D6CUBE LO Supplied by Robert Hughes. Of D6CUBE, Robert Hughes says, "Mike Anderson and I are working on the problem of finding the minimum cardinality of triangulations of the 6-dimensional cube. The optimal objective value of the problem I sent you provides a lower bound for the cardinalities of all triangulations which contain a certain simplex of volume 8/6! and which contains the centroid of the 6-cube in its interior. The linear programming problem is not easily described." Added to Netlib on 26 March 1993
|nnz(V) for QR, upper bound nnz(L) for LU||1,123,643||1,192,343|
|nnz(R) for QR, upper bound nnz(U) for LU||55,246||56,704|
Maintained by Leslie Foster, last updated 24-Apr-2009.
Entries 5 through 14 in the table of matrix properties and the singular
value plot were created using SJsingular code. The other plots
and statistics are produced using utilities from the SuiteSparse package.
Matrix color plot pictures by cspy, a MATLAB function in the CSparse package.