CDS 140a Winter 2013 Homework 3: Difference between revisions

From Murray Wiki
Jump to navigationJump to search
No edit summary
No edit summary
Line 78: Line 78:
router fills up.  Consider the case where $N = 2$ (so that we have
router fills up.  Consider the case where $N = 2$ (so that we have
three states, $x_1$, $x_2$ and $b$) and take $b_{\text{max}} = 1$ Mb
three states, $x_1$, $x_2$ and $b$) and take $b_{\text{max}} = 1$ Mb
and $c = 2$ Mb\per\second.
and $c = 2$ Mb/s.
</li>
</li>
</ol>
</ol>

Revision as of 18:04, 18 January 2013

WARNING: This homework set is still being written. Do not start working on these problems until this banner is removed.
R. Murray, D. MacMartin Issued: 19 Jan 2011 (Tue)
ACM 101/AM 125b/CDS 140a, Winter 2013 Due: 26 Jan 2011 (Tue)

__MATHJAX__

Note: In the upper left hand corner of the second page of your homework set, please put the number of hours that you spent on this homework set (including reading).

  1. Perko, Section 2.2, problem 5:
  2. Perko, Section 2.3, problem 1:
  3. Perko, Section 2.5, problem 4:
  4. Perko, Section 2.5, problem 5:
  5. Choose one of the following systems and determine all of the equilibrium points for the system, indicating whether each is a sync, source, or saddle.
    (a) Moore-Greitzer model: The Moore-Greitzer equations model rotating stall and surge in gas turbine engines are given by
    <amsmath>
     \aligned 
       \frac{d\psi}{dt} &= \frac{1}{4 B^2 l_c}\left(\phi - \Phi_T(\psi) \right), \\
       \frac{d\phi}{dt} &= \frac{1}{l_c}\left( \Phi_c(\phi) - \psi + \frac{J}{8} 
         \frac{\partial^2 \Psi_c}{\partial \phi^2} \right), \\
       \frac{dJ}{dt} &= \frac{2}{\mu + m} \left(
          \frac{\partial \Phi_c}{\partial \phi} + \frac{J}{8}
             \frac{\partial^3 \Phi_c}{\partial \phi^3} \right) J,
     \endaligned
    
    </amsmath>

    where

    <amsmath>
     \aligned 
         B &= 0.2, & \Phi_T(\psi) &= \sqrt{\psi},\\
         l_c &= 6, & \Psi_c(\phi) &= 1 + 1.5 \phi - 0.5 \phi^3, \\
         \mu &= 1.256, &\qquad\qquad m &= 2.
     \endaligned
    
    </amsmath>

    This is a model for the dynamics of the compression system (first part of a jet engine) with $\psi$ representing the pressure rise across the compressor, $\phi$ representing the mass flow through the compressor and $J$ representing the amplitude squared of the first modal flow perturbation (corresponding to a rotating stall disturbance).

    (b) Genetic toggle switch: Consider the dynamics of two transcriptional repressors connected together in a cycle. It can be shown that the normalized dynamics of the system can be written as

    <amsmath>
     \frac{dz_1}{d\tau} = \frac{\mu}{1 + z_2^n} - z_1 - v_1,\qquad
     \frac{dz_2}{d\tau} = \frac{\mu}{1 + z_1^n} - z_2 - v_2.
    
    </amsmath>

    where $z_1$ and $z_2$ represent scaled versions of the protein concentrations, $v_1$ and $v_2$ represent external inputs and the time scale has been changed. Let $\mu = 2.16$, $n = 2$ and $v_1 = v_2 = 0$.

    (c) Congestion control: A simplified model for congestion control between $N$ computers connected by a router is given by the differential equation

    <amsmath>
     \aligned 
       \frac{dx_i}{dt} &= -b \frac{x_i^2}{2} + (b_{\text{max}} - b), \qquad
       \frac{db}{dt} &= \Bigl( \sum_{i=1}^N x_i \Bigr) - c,
    \endaligned 
    
    </amsmath>

    where $x_i \in {\mathbb R}$, $i = 1, \ldots, N$ are the transmission rates for the sources of data, $b \in {\mathbb R}$ is the current buffer size of the router, $b_{\text{max}} > 0$ is the maximum buffer size and $c > 0$ is the capacity of the link connecting the router to the computers. The $\dot x_i$ equation represents the control law that the individual computers use to determine how fast to send data across the network and the $\dot b$ equation represents the rate at which the buffer on the router fills up. Consider the case where $N = 2$ (so that we have three states, $x_1$, $x_2$ and $b$) and take $b_{\text{max}} = 1$ Mb and $c = 2$ Mb/s.


Notes:

  • The problems are transcribed above in case you don't have access to Perko. However, in the case of discrepancy, you should use Perko as the definitive source of the problem statement.