Matrix: TOKAMAK/utm3060

Description: Uedge Test Matrix

TOKAMAK/utm3060 graph TOKAMAK/utm3060 graph
(bipartite graph drawing) (graph drawing of A+A')


TOKAMAK/utm3060 dmperm of TOKAMAK/utm3060

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: TOKAMAK
  • Click here for a description of the TOKAMAK 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: 379 KB. Use UFget(825) or UFget('TOKAMAK/utm3060') in MATLAB.
  • download in Matrix Market format, file size: 515 KB.
  • download in Rutherford/Boeing format, file size: 461 KB.

    Matrix properties
    number of rows3,060
    number of columns3,060
    nonzeros42,211
    structural full rank?yes
    structural rank3,060
    # of blocks from dmperm83
    # strongly connected comp.83
    explicit zero entries0
    nonzero pattern symmetry 52%
    numeric value symmetry 0%
    typereal
    structureunsymmetric
    Cholesky candidate?no
    positive definite?no

    authorY. Saad
    editorY. Saad
    date1996
    kindelectromagnetics problem
    2D/3D problem?yes

    Additional fieldssize and type
    bfull 3060-by-1

    Ordering statistics:result
    nnz(chol(P*(A+A'+s*I)*P')) with AMD151,592
    Cholesky flop count1.3e+07
    nnz(L+U), no partial pivoting, with AMD300,124
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD196,452
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD365,373

    SVD-based statistics:
    norm(A)2.60644
    min(svd(A))1.3525e-07
    cond(A)1.92713e+07
    rank(A)3,060
    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

    TOKAMAK/utm3060 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.