Matrix: VDOL/kineticBatchReactor_1

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

VDOL/kineticBatchReactor_1 graph
(undirected graph drawing)

VDOL/kineticBatchReactor_1 dmperm of VDOL/kineticBatchReactor_1
scc of VDOL/kineticBatchReactor_1

  • 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: 193 KB. Use UFget(2696) or UFget('VDOL/kineticBatchReactor_1') in MATLAB.
  • download in Matrix Market format, file size: 152 KB.
  • download in Rutherford/Boeing format, file size: 143 KB.

    Matrix properties
    number of rows2,052
    number of columns2,052
    structural full rank?yes
    structural rank2,052
    # of blocks from dmperm11
    # strongly connected comp.3
    explicit zero entries0
    nonzero pattern symmetrysymmetric
    numeric value symmetrysymmetric
    Cholesky candidate?no
    positive definite?no

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

    Additional fieldssize and type
    bfull 2052-by-1
    rownamefull 2052-by-100
    mappingfull 2052-by-1


    Optimal control problem, Vehicle Dynamics & Optimization Lab, UF       
    Anil Rao and Begum Senses, University of Florida                                                                  
    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.                            

    Ordering statistics:result
    nnz(chol(P*(A+A'+s*I)*P')) with AMD27,912
    Cholesky flop count5.2e+05
    nnz(L+U), no partial pivoting, with AMD53,772
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD657,739
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD1,222,477

    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.