Matrix: Bindel/ted_B_unscaled

Description: FEM, coupled linear thermoeslasticity eqns on a bar. D Bindel, UC Berkeley

Bindel/ted_B_unscaled graph
(undirected graph drawing)


Bindel/ted_B_unscaled dmperm of Bindel/ted_B_unscaled

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: Bindel
  • Click here for a description of the Bindel 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: 262 KB. Use UFget(1409) or UFget('Bindel/ted_B_unscaled') in MATLAB.
  • download in Matrix Market format, file size: 434 KB.
  • download in Rutherford/Boeing format, file size: 284 KB.

    Matrix properties
    number of rows10,605
    number of columns10,605
    nonzeros144,579
    structural full rank?yes
    structural rank10,605
    # of blocks from dmperm4,245
    # strongly connected comp.4,245
    explicit zero entries0
    nonzero pattern symmetrysymmetric
    numeric value symmetrysymmetric
    typereal
    structuresymmetric
    Cholesky candidate?yes
    positive definite?yes

    authorD. Bindel
    editorT. Davis
    date2006
    kindthermal problem
    2D/3D problem?yes

    Ordering statistics:result
    nnz(chol(P*(A+A'+s*I)*P')) with AMD85,611
    Cholesky flop count1.1e+06
    nnz(L+U), no partial pivoting, with AMD160,617
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD94,116
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD250,194

    SVD-based statistics:
    norm(A)1
    min(svd(A))7.81889e-12
    cond(A)1.27895e+11
    rank(A)10,605
    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

    Bindel/ted_B_unscaled 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.