AG-Monien/crack_dual

2D finite element problem
Name crack_dual AG-Monien 2415 20,141 20,141 60,086 60,086 2D/3D Problem Yes 1998 R. Diekmann, R. Preis R. Diekmann, R. Preis
Structural Rank 20,141 true 1 1 0 100% 100% no no binary
SVD Statistics
Matrix Norm 2.999457e+00
Minimum Singular Value 1.732190e-04
Condition Number 1.731599e+04
Rank 20,141
sprank(A)-rank(A) 0
Null Space Dimension 0
Full Numerical Rank? yes
Download ```AG-Monien Graph Collection, Ralf Diekmann and Robert Preis http://www2.cs.uni-paderborn.de/fachbereich/AG/monien/RESEARCH/PART/graphs.html A collection of test graphs from various sources. Many of the graphs include XY or XYZ coordinates. This set also includes some graphs from the Harwell-Boeing collection, the NASA matrices, and some random matrices which are not included here in the AG-Monien/ group of the UF Collection. In addition, two graphs already appear in other groups: AG-Monien/big : same as Nasa/barth5, Pothen/barth5 (not included here) AG-Monien/cage_3_11 : same as Pajek/GD98_c (included here) The AG-Monien/GRID subset is not included. It contains square grids that are already well-represented in the UF Collection. Six of the problem sets are included as sequences, each sequence being a single problem instance in the UF Collection: bfly: 10 butterfly graphs 3..12 cage: 45 cage graphs 3..12 cca: 10 cube-connected cycle graphs, no wrap ccc: 10 cube-connected cycle graphs, with wrap debr: 18 De Bruijn graphs se: 13 shuffle-exchange graphs Problem.aux.G{:} are the graphs in these 6 sequences. Problem.aux.Gname{:} are the original names of each graph, and Problemm.aux.Gcoord{:} are the xy or xyz coordinates of each node, if present.```