Matrix: QLi/crashbasis
Description: MCP; mixed complementarity optimization problem; similar to QLi/majorbasis
![]() |
![]() |
| (bipartite graph drawing) | (graph drawing of A+A') |
![]() |
| Matrix properties | |
| number of rows | 160,000 |
| number of columns | 160,000 |
| nonzeros | 1,750,416 |
| structural full rank? | yes |
| structural rank | 160,000 |
| # of blocks from dmperm | 1 |
| # strongly connected comp. | 1 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | 55% |
| numeric value symmetry | 0% |
| type | real |
| structure | unsymmetric |
| Cholesky candidate? | no |
| positive definite? | no |
| author | Q. Li and M. Ferris |
| editor | T. Davis |
| date | 2007 |
| kind | optimization problem |
| 2D/3D problem? | no |
Notes:
QLi/crashbasis and QLi/majorbasis have the same nonzero pattern. However, UMFPACK 5.1 is much slower for majorbasis than for crashbasis, because of the extensive number of denormal floating-point values that occur in majorbasis (they do not occur in crashbasis).
| Ordering statistics: | result |
| nnz(chol(P*(A+A'+s*I)*P')) with AMD | 21,987,956 |
| Cholesky flop count | 1.2e+10 |
| nnz(L+U), no partial pivoting, with AMD | 43,815,912 |
| nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD | 11,705,268 |
| nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 22,790,462 |
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.