Matrix: Pajek/Tina_DisCog
Description: Pajek network: student govt, Univ. Ljubljana, 1992 (discuss, recog.)
| Matrix properties | |
| number of rows | 11 |
| number of columns | 11 |
| nonzeros | 48 |
| structural full rank? | yes |
| structural rank | 11 |
| # of blocks from dmperm | 2 |
| # strongly connected comp. | 1 |
| entries not in dmperm blocks | 3 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | 50% |
| numeric value symmetry | 50% |
| type | binary |
| structure | unsymmetric |
| Cholesky candidate? | no |
| positive definite? | no |
| author | V. Batagelj |
| editor | V. Batagelj |
| date | 1992 |
| kind | directed graph |
| 2D/3D problem? | no |
| Additional fields | size and type |
| nodename | full 11-by-10 |
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/. ------------------------------------------------------------------------------ STUDENT GOVERNMENT OF UNIVERSITY OF LJUBLJANA (Hlebec 1992) discussion, recognition
| Ordering statistics: | AMD | METIS | DMPERM+ |
| nnz(chol(P*(A+A'+s*I)*P')) | 51 | 52 | 45 |
| Cholesky flop count | 2.8e+02 | 2.9e+02 | 2.3e+02 |
| nnz(L+U), no partial pivoting | 91 | 93 | 82 |
| nnz(V) for QR, upper bound nnz(L) for LU | 42 | 44 | 31 |
| nnz(R) for QR, upper bound nnz(U) for LU | 55 | 59 | 55 |
Maintained by Tim Davis, last updated 30-Sep-2008.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.