Matrix: VDOL/spaceStation_3

Description: spaceStation optimal control problem (matrix 3 of 14)

VDOL/spaceStation_3 graph
(undirected graph drawing)

VDOL/spaceStation_3 dmperm of VDOL/spaceStation_3
scc of VDOL/spaceStation_3

  • 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: 63 KB. Use UFget(2736) or UFget('VDOL/spaceStation_3') in MATLAB.
  • download in Matrix Market format, file size: 37 KB.
  • download in Rutherford/Boeing format, file size: 33 KB.

    Matrix properties
    number of rows467
    number of columns467
    structural full rank?yes
    structural rank467
    # of blocks from dmperm7
    # 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 467-by-1
    rownamefull 467-by-99
    mappingfull 467-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.                            
    Space station attitude optimal control problem is taken from           
    Ref.~\cite{betts2010practical}. The goal of the space station          
    attitude control problem is to determine the state and the control     
    that minimize the magnitude of the final momentum while the space      
    statition reaches an orientation at the final time that can be         
    maintained without utilizing additional control torque. The state of   
    the system is defined by the angular velocity of the spacecraft with   
    respect to an inertial reference frame, Euler-Rodriguez parameters     
    used to defined the vehicle attitude, and the angular momentum of the  
    control moment gyroscope and the control of the system is the torque.  
    The specified accuracy tolerance of $10^{-7}$ were satisfied after     
    thirteen mesh iterations. As the mesh refinement proceeds, the size    
    of the KKT matrices increases from 99 to 1640.                         

    Ordering statistics:result
    nnz(chol(P*(A+A'+s*I)*P')) with AMD7,804
    Cholesky flop count1.9e+05
    nnz(L+U), no partial pivoting, with AMD15,141
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD15,763
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD30,405

    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.