Routine svd from Matlab 220.127.116.114 (R2008a) used to calculate the singular values.
|Matrix properties (click for a legend)|
|number of rows||687|
|number of columns||1,620|
|structural full rank?||no|
|dimension of the numerical null space||934|
|numerical rank / min(size(A))||0.99854|
|Euclidean norm of A||4.8756|
|calculated singular value # 686||0.12112|
| numerical rank defined using a tolerance |
|calculated singular value # 687||1.8003e-021|
| gap in the singular values at the numerical rank: |
singular value # 686 / singular value # 687
|calculated condition number||2.7082e+021|
|# of blocks from dmperm||3|
|# strongly connected comp.||3|
|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 firstname.lastname@example.org 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 MODSZK1 688 1620 4158 40908 B 3.2061972906E+02 BOUND-TYPE TABLE MODSZK1 FR From Istvan Maros. Concerning the problems he submitted, Istvan Maros says that MODSZK1 is a "real-life problem" that is "very degenerate" and on which a dual simplex algorithm "may require up to 10 times" fewer iterations than a primal simplex algorithm. It "is a multi-sector economic planning model (a kind of an input/output model in economy)" and "is an old problem of mine and it is not easy to recall more." Added to Netlib on 17 Jan. 1994
|nnz(V) for QR, upper bound nnz(L) for LU||71,390||59,384|
|nnz(R) for QR, upper bound nnz(U) for LU||12,434||13,987|
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.