Matrix: GHS_indef/a0nsdsil
Description: Gould, Hu, & Scott: linear complementarity problem (CUTEr)
|
| (undirected graph drawing) |
 |
| Matrix properties | |
| number of rows | 80,016 |
| number of columns | 80,016 |
| nonzeros | 355,034 |
| structural full rank? | yes |
| structural rank | 80,016 |
| # of blocks from dmperm | 1 |
| # strongly connected comp. | 1 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | symmetric |
| numeric value symmetry | symmetric |
| type | real |
| structure | symmetric |
| Cholesky candidate? | no |
| positive definite? | no |
| author | M. Ferris |
| editor | N. Gould |
| date | 2004 |
| kind | optimization problem |
| 2D/3D problem? | no |
| Ordering statistics: | result |
| nnz(chol(P*(A+A'+s*I)*P')) with AMD | 415,010 |
| Cholesky flop count | 2.7e+06 |
| nnz(L+U), no partial pivoting, with AMD | 750,004 |
| nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD | 814,888 |
| nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 1,225,123,737 |
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.