| Matrix properties | |
| number of rows | 18 |
| number of columns | 18 |
| nonzeros | 37 |
| structural full rank? | no |
| structural rank | 17 |
| # of blocks from dmperm | 5 |
| # strongly connected comp. | 1 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | 51% |
| numeric value symmetry | 51% |
| type | binary |
| structure | unsymmetric |
| Cholesky candidate? | no |
| positive definite? | no |
| author | Graph Drawing Contest |
| editor | V. Batagelj |
| date | 2001 |
| kind | directed graph |
| 2D/3D problem? | no |
| Additional fields | size and type |
| nodename | full 18-by-22 |
| coord | full 18-by-2 |
Notes:
------------------------------------------------------------------------------ Pajek network converted to sparse adjacency matrix for inclusion in UF sparse matrix collection, Tim Davis. For Pajek datasets, See V. Batagelj & A. Mrvar, http://vlado.fmf.uni-lj.si/pub/networks/data/. ------------------------------------------------------------------------------ The original problem had 3D xyz coordinates, but all values of z were equal to 0.5, and have been removed. This graph has 2D coordinates.
| Ordering statistics: | AMD | METIS |
| nnz(chol(P*(A+A'+s*I)*P')) | 50 | 54 |
| Cholesky flop count | 1.4e+02 | 1.7e+02 |
| nnz(L+U), no partial pivoting | 82 | 90 |
| nnz(V) for QR, upper bound nnz(L) for LU | 30 | 32 |
| nnz(R) for QR, upper bound nnz(U) for LU | 41 | 44 |
Maintained by Tim Davis, last updated 04-May-2008.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.