Matrix: AG-Monien/crack_dual

Description: 2D finite element problem

AG-Monien/crack_dual graph
(undirected graph drawing)

AG-Monien/crack_dual graph

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: AG-Monien
  • Click here for a description of the AG-Monien group.
  • Click here for a list of all matrices
  • Click here for a list of all matrix groups
  • download as a MATLAB mat-file, file size: 213 KB. Use UFget(2415) or UFget('AG-Monien/crack_dual') in MATLAB.
  • download in Matrix Market format, file size: 158 KB.
  • download in Rutherford/Boeing format, file size: 155 KB.

    Matrix properties
    number of rows20,141
    number of columns20,141
    structural full rank?yes
    structural rank20,141
    # of blocks from dmperm1
    # strongly connected comp.1
    explicit zero entries0
    nonzero pattern symmetrysymmetric
    numeric value symmetrysymmetric
    Cholesky candidate?no
    positive definite?no

    authorR. Diekmann, R. Preis
    editorR. Diekmann, R. Preis
    kind2D/3D problem
    2D/3D problem?yes

    Additional fieldssize and type
    coordfull 20141-by-2


    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.                                

    Ordering statistics:result
    nnz(chol(P*(A+A'+s*I)*P')) with AMD256,006
    Cholesky flop count1.2e+07
    nnz(L+U), no partial pivoting, with AMD491,871
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD429,543
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD786,327

    SVD-based statistics:
    null space dimension0
    full numerical rank?yes

    singular values (MAT file):click here
    SVD method used:s = svd (full (R)) ; where [~,R,E] = spqr (A) with droptol of zero

    AG-Monien/crack_dual svd

    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.