Matrix: JGD_Homology/shar_te2-b3
Description: Simplicial complexes from Homology from Volkmar Welker.
![]() |
![]() |
| (bipartite graph drawing) | (graph drawing of A+A') |
![]() |
| Matrix properties | |
| number of rows | 200,200 |
| number of columns | 200,200 |
| nonzeros | 800,800 |
| structural full rank? | yes |
| structural rank | 200,200 |
| # of blocks from dmperm | 1 |
| # strongly connected comp. | 1 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | 0% |
| numeric value symmetry | 0% |
| type | integer |
| structure | unsymmetric |
| Cholesky candidate? | no |
| positive definite? | no |
| author | V. Welker |
| editor | J.-G. Dumas |
| date | 2008 |
| kind | combinatorial problem |
| 2D/3D problem? | no |
Notes:
Simplicial complexes from Homology from Volkmar Welker.
From Jean-Guillaume Dumas' Sparse Integer Matrix Collection,
http://ljk.imag.fr/membres/Jean-Guillaume.Dumas/simc.html
http://www.mathematik.uni-marburg.de/~welker/
Filename in JGD collection: Homology/shar_te2.b3.200200x200200.sms
| Ordering statistics: | result |
| nnz(chol(P*(A+A'+s*I)*P')) with AMD | 4,376,943,613 |
| Cholesky flop count | 2.7e+14 |
| nnz(L+U), no partial pivoting, with AMD | 8,753,687,026 |
| nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD | 7,496,470,527 |
| nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 8,241,458,561 |
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.