2D finite element problem
Name crack
Group AG-Monien
Matrix ID 2414
Num Rows 10,240
Num Cols 10,240
Nonzeros 60,760
Pattern Entries 60,760
Kind 2D/3D Problem
Symmetric Yes
Date 1998
Author R. Diekmann, R. Preis
Editor R. Diekmann, R. Preis
Structural Rank 10,240
Structural Rank Full true
Num Dmperm Blocks 1
Strongly Connect Components 1
Num Explicit Zeros 0
Pattern Symmetry 100%
Numeric Symmetry 100%
Cholesky Candidate no
Positive Definite no
Type binary
SVD Statistics
Matrix Norm 6.449443e+00
Minimum Singular Value 5.489770e-04
Condition Number 1.174811e+04
Rank 10,240
sprank(A)-rank(A) 0
Null Space Dimension 0
Full Numerical Rank? yes
Download Singular Values MATLAB
Download MATLAB Rutherford Boeing Matrix Market
AG-Monien Graph Collection, Ralf Diekmann and Robert Preis            
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.