Matrix: VDOL/kineticBatchReactor_9

Description: kineticBatchReactor optimal control problem (matrix 9 of 9)

VDOL/kineticBatchReactor_9 graph
(undirected graph drawing)


VDOL/kineticBatchReactor_9 dmperm of VDOL/kineticBatchReactor_9
scc of VDOL/kineticBatchReactor_9

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: VDOL
  • Click here for a description of the VDOL 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: 707 KB. Use UFget(2704) or UFget('VDOL/kineticBatchReactor_9') in MATLAB.
  • download in Matrix Market format, file size: 614 KB.
  • download in Rutherford/Boeing format, file size: 562 KB.

    Matrix properties
    number of rows8,115
    number of columns8,115
    nonzeros86,183
    structural full rank?yes
    structural rank8,115
    # of blocks from dmperm11
    # strongly connected comp.3
    explicit zero entries0
    nonzero pattern symmetrysymmetric
    numeric value symmetrysymmetric
    typereal
    structuresymmetric
    Cholesky candidate?no
    positive definite?no

    authorB. Senses, A. Rao
    editorT. Davis
    date2015
    kindoptimal control problem
    2D/3D problem?no

    Additional fieldssize and type
    bfull 8115-by-1
    rownamefull 8115-by-101
    mappingfull 8115-by-1

    Notes:

    Optimal control problem, Vehicle Dynamics & Optimization Lab, UF       
    Anil Rao and Begum Senses, University of Florida                       
    http://vdol.mae.ufl.edu                                                
                                                                           
    This matrix arises from an optimal control problem described below.    
    Each optimal control problem gives rise to a sequence of matrices of   
    different sizes when they are being solved inside GPOPS, an optimal    
    control solver created by Anil Rao, Begum Senses, and others at in VDOL
    lab at the University of Florida.  This is one of the matrices in one  
    of these problems.  The matrix is symmetric indefinite.                
                                                                           
    Rao, Senses, and Davis have created a graph coarsening strategy        
    that matches pairs of nodes.  The mapping is given for this matrix,    
    where map(i)=k means that node i in the original graph is mapped to    
    node k in the smaller graph.  map(i)=map(j)=k means that both nodes    
    i and j are mapped to the same node k, and thus nodes i and j have     
    been merged.                                                           
                                                                           
    This matrix consists of a set of nodes (rows/columns) and the          
    names of these rows/cols are given                                     
                                                                           
    Anil Rao, Begum Sense, and Tim Davis, 2015.                            
                                                                           
    VDOL/kineticBatchReactor                                               
    

    Ordering statistics:result
    nnz(chol(P*(A+A'+s*I)*P')) with AMD132,028
    Cholesky flop count3.0e+06
    nnz(L+U), no partial pivoting, with AMD255,941
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD12,663,001
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD19,332,337

    For a description of the statistics displayed above, click here.

    Maintained by Tim Davis, last updated 04-Jun-2015.
    Matrix pictures by cspy, a MATLAB function in the CSparse package.
    Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.