Matrix: GHS_psdef/copter1

Description: Gould, Hu, & Scott: Helicoptor rotor blade, from Pothen & Kumfert

GHS_psdef/copter1 graph
(undirected graph drawing)


GHS_psdef/copter1

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: GHS_psdef
  • Click here for a description of the GHS_psdef 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: 296 KB. Use UFget(1255) or UFget('GHS_psdef/copter1') in MATLAB.
  • download in Matrix Market format, file size: 219 KB.
  • download in Rutherford/Boeing format, file size: 222 KB.

    Matrix properties
    number of rows17,222
    number of columns17,222
    nonzeros211,064
    structural full rank?yes
    structural rank17,222
    # of blocks from dmperm1
    # strongly connected comp.1
    explicit zero entries0
    nonzero pattern symmetrysymmetric
    numeric value symmetrysymmetric
    typebinary
    structuresymmetric
    Cholesky candidate?yes
    positive definite?no

    authorG. Kumfert, A. Pothen
    editorN. Gould, Y. Hu, J. Scott
    date2004
    kindcomputational fluid dynamics problem
    2D/3D problem?yes

    Ordering statistics:result
    nnz(chol(P*(A+A'+s*I)*P')) with AMD2,337,186
    Cholesky flop count1.1e+09
    nnz(L+U), no partial pivoting, with AMD4,657,150
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD5,886,754
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD14,232,397

    SVD-based statistics:
    norm(A)15.2599
    min(svd(A))0.00158395
    cond(A)9634.12
    rank(A)17,222
    sprank(A)-rank(A)0
    null space dimension0
    full numerical rank?yes

    singular values (MAT file):click here
    SVD method used:s = svd (full (A)) ;
    status:ok

    GHS_psdef/copter1 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.