DISCRETE EVENT CONTROL OF TIME VARYING PLANTS

Size: px
Start display at page:

Download "DISCRETE EVENT CONTROL OF TIME VARYING PLANTS"

Transcription

1 DISCRETE EVENT CONTROL OF TIME VARYING PLANTS Ernesto KOFMAN Laboratorio de Sistemas Dinmicos. FCEIA UNR CONICET. Riobamba 245 bis (2) Rosario Argentina Abstract This paper studies the use of Quantized State Control (QSC) in Time Varying (TV) plants. Making use of a Lyapunov analysis, the stability properties of Time Invariant QSC are extended to the non stationary case. Then, based on the resulting stability theorem, a design algorithm is developed. Finally, the use of this algorithm which allows the design of QSC controllers according to stability and convergence speed features is shown with the design and the simulation of an illustrative example. Keywords Digital Control, Nonlinear Control, Discrete Event Systems. I. INTRODUCTION Quantized State Control (Kofman, 23) is a methodology which allows the digital implementation of previously designed continuous controllers based on the quantization of their state variables. The resulting digital controller which can be described by a discrete event system is completed with an asynchronous sampling scheme (Sayiner et al., 1993) so that, ignoring the temporal errors introduced by the clock of the digital device, no time discretization is performed. The use of QSC instead of classic discrete time digital controllers permits to conserve the region of attraction in nonlinear systems improving also the dynamic response and reducing the computational costs as well as the information transmitted between controllers and plants. In the LTI case, digital QSC controllers also ensure that the resulting trayectories do not differ from the ones obtained with the ideal continuous controllers in more than a bound which can be calculated with a closed formula (Kofman, 22). Since QSC takes into account the presence of quantization, it does not guarantee asymptotic stability but ultimately boundedness of the solutions (Khalil, 1996). This fact, which seems to be a disadvantage, is common to all the quantization based approaches (Delchamps, 199; Brockett and Liberzon, 2; Elias and Mitter, 21). Moreover, in any sampled data control system where the effects of A/D and D/A converters are taken into account the theory can only talk about ultimate bounds (Miller et al., 1989; Hou et al., 1997). The original definitions of QSC and the mentioned properties were established under the assumption of a Time Invariant (TI) plant with a TI controller. Although the restriction on the controller cannot be avoided 1, there is no reason to consider only TI plants. Taking into account the last remark, this work attempts to extend the properties and design algorithms of TI QSC to the Time Varying case. The paper is organized as follows: After recalling the principles and properties of QSC (Section II), the main results of QSC with TV plants a stability Theorem and a design algorithm are presented in Section III. Finally, these results are illustrated with the design and simulation of a simple example. II. QUANTIZED STATE CONTROL QSC is a digital control scheme in which a continuous plant is controlled by a discrete event system obtained with the quantization of a continuous controller. A. Quantized State Systems Consider the State Equation System (SES) given by: ẋ(t) = f(x(t),u(t)) (1) y(t) = g(x(t),u(t)) Related to this system, an associated Quantized State System (QSS) (Kofman and Junco, 21) is given by: ẋ(t) = f(q(t),u(t)) (2) y(t) = g(q(t),u(t)) In this system, q(t) (quantized variables) and x(t) (state variables) are related (componentwise) by hysteretic quantization functions, which are defined as follows: Definition 1. Hysteretic Quantization Function. Let Q = Q,Q 1,..., Q r } be a set of real numbers where Q k 1 <Q k with 1 k r. Let Ω be the set of piecewise continuous real valued trajectories and let x i Ω be a continuous trajectory. Let b :Ω Ω be 1 In the general case it is not possible to obtain a discrete event description of a quantized time varying system.

2 a mapping and let q i = b(x i ) where the trajectory q i satisfies: Q m if t = t Q k+1 if x i (t) =Q k+1 q q i (t) = i (t )=Q k k<r (3) Q k 1 if x i (t) =Q k ε q i (t )=Q k k> q i (t ) otherwise and if x i (t ) <Q m = r if x i (t ) Q r j if Q j x(t ) <Q j+1 Then, the map b is a hysteretic quantization function. The discrete values Q k are called quantization levels and the distance Q k+1 Q k is defined as the quantum, which is usually constant. The width of the hysteresis window is ε and, as it was shown in (Kofman et al., 21), it should be taken equal to the quantum to improve the accuracy. The values Q and Q r are the lower and upper saturation bounds. A fundamental property of a Quantization Function with hysteresis when t t and Q x i (t) Q r is given by the following inequality q i (t) x i (t) max 1 i r (Q i Q i 1,ε) (4) The role of the quantization functions in (2) is to convert the state trajectories (x(t)) into piecewise constant ones (q(t)). In that way, provided that u(t) is piecewise constant, it results that the derivatives ẋ(t) are also piecewise constant and then the state trajectories are piecewise linear. As a consequence of these properties of the trajectory forms, QSS can be exactly represented by discrete event models within the DEVS formalism framework (Zeigler et al., 2). The DEVS model related to a generic QSS and the proof of the mentioned properties can be found in (Kofman and Junco, 21). The possibility of representing QSS by DEVS models and the fact that DEVS models can be simulated in real time by digital devices 2 (Zeigler and Kim, 1993) suggested the use of QSS as digital controllers and the definition of QSC. B. QSC Definition Consider the Continuous Control System (CCS) consisting of plant and controller, Eqs.(5) and (6) respectively, and their (ideal) interconnection, Eq. (7). ẋp (t) = f p (x p (t),u p (t),t) (5) y p (t) = g p (x p (t),t) ẋc (t) = f c (x c (t),u c (t),u r (t)) (6) y c (t) = g c (x c (t),u c (t),u r (t)) 2 DEVS representation of QSS is exact. However, real time simulation of DEVS has errors related to temporal resolution and round-off in digital devices u p (t) =y c (t), u c (t) =y p (t) (7) It is being considered here that the plant could be time varying. When it comes to the controller, it is assumed that it is stationary and it has an input reference u r (t). Definition 2. Quantized State Controller. A QSS associated to a continuous controller (6) is called Quantized State Controller (QSC controller). Definition 3. QSC System. A QSC system is a control scheme composed by a continuous plant and a QSC controller connected through asynchronous A/D and D/A converters. D/A y c g c u p x p q c f p Controller Plant f c g p q c u c y p A/D Figure 1: Block Diagram of the QSC system Figure 1 shows a block diagram representation of a QSC system. Despite its state equation like representation, the controller is in fact a DEVS model. The QSC implementation of the controller transforms (6) into the new set of equations: ẋc (t) = f c (q c (t),u c (t),u r (t)) (8) y c (t) = g c (q c (t),u c (t),u r (t)) The asynchronous sampling scheme (Sayiner et al., 1993) implies that the A/D conversions are performed only when the analog input and the digital output of the converters differ in a quantity corresponding to one quantization interval. Then, they can be seen as quantization functions with hysteresis where the quantization intervals and the hysteresis windows have the same size. Similarly, D/A converters can be represented by quantization functions (but without hysteresis). Thus, the presence of the asynchronous converters transforms (7) into: u r u p (t) =y cq (t), u c (t) =y pq (t) (9) where variables y cq (t) andy pq (t) are quantized versions of the plant and the controller output variables

3 C. QSC Properties The CCS closed loop equations can be derived from Eqs.(5) (7) arriving to ẋp = f p (x p,g c (x c,g p (x p,t),u r ),t) (1) ẋ c = f c (x c,g p (x p,t),u r ) Let us define x c (t) = q c (t) x c (t) (11a) y p (t) = y pq (t) y p (t) (11b) y c (t) = y cq (t) y c (t) (11c) Thus, from these definitions and Eqs.(5), (8) and (9), the QSC closed loop equations can be written as: ẋ p = f p (x p,g c (x c + x c,g p (x p,t)+ + y p,u r )+ y c,t) ẋ c = f c (x c + x c,g p (x p,t)+ y p,u r ) (12) Then, the QSC system (12) can be seen as a perturbed version of the original CCS (1). From the property of the quantization functions provided that the variables x c, y p and y c do not reach the corresponding saturation bounds 3 it also results that the perturbation terms are bounded by (4). Thus, the properties of the QSC implementation of a CCS can be studied by looking at the effects of bounded perturbations in the original closed loop system. Based on this remark, the stability theorem of TI QSC (Kofman, 23) and the stability and error bound estimation of LTI QSC (Kofman, 22) were proven. The stability theorem of TI QSC tells that, given a CCS in which the origin is an asymptotically stable equilibrium point, an appropriate quantization can be found so that the resulting QSC controller ensures ultimately boundedness of the solutions (for any given ultimate bound) conserving also the estimate region of attraction. That appropriate quantization can be found according to desired ultimate bound following an algorithm which makes use of a Lyapunovfunction of the original CCS. On the other hand, the theorem for LTI QSC tells that the QSC implementation of an asymptotically stable LTI CCS is always globally and ultimately bounded. The ultimate bound can be estimated with a closed formula. Moreover, the trajectories of the CCS and the resulting QSC never differ from each other in more than the mentioned bound. Thus, the quantization choice which completes the QSC design can be made based on these properties, according to the desired ultimate bounds. III. TIME VARYING QSC The stability theorem and the corresponding design algorithm were based on a stationary Lyapunovanalysis. This section introduces the main contributions 3 It will be considered that the non saturation region is enough large so that the trajectories do not leave it. of this work by extending those results to the time varying case. A. Stability of TV QSC When the reference trajectory u r (t) is zero (or constant), the QSC system (12) can be rewritten as ẋ = f(x + x, y, t) (13) where x, [x p,x c ] T, x, [, x c ] T, y, [ y p, y c ] T,andf, [f p,f c ] T. With these definitions, the CCS (1) becomes ẋ = f(x,,t), f(x, t) (14) Then, the following theorem which relates the stability properties of (14) and (13) can be stated: Theorem 1. Let the origin be an asymptotically stable equilibrium point of the closed loop CCS (14). Assume that function f is continuous and a continuously differentiable Lyapunov function V (x, t) is known with W 1 (x) V (x, t) W 2 (x) (15) V f(x, t)+ V t W 3(x) (16) t, x D being D a compact set which contains the origin and W i are continuous positive definite functions in D. Let Ω 2a = x W 2 (x) a} with a being an arbitrary positive constant which is enough small so that x W 1 (x) a} is a closed region inside D. Let Ω 1b = x W 1 (x) b} being b an arbitrary positive constant (b <a) enough small so that Ω 1b Ω 2a. Then, a quantization can be found so that the QSC system trajectories starting in Ω 2a finish inside Ω 1b, reaching this region in finite time. Proof. The derivative of V (x, t) along the solutions of the QSC system (13) is V (x, t) = V = V + V f(x + x, y, t)+ V t f(x,,t)+ V t + Then, using (16) it results that (f(x + x, y, t) f(x,,t)) V (x, t) W 3 (x)+ V (f(x+ x, y, t) f(x,,t)) Consider the sets Ω 2b = x W 2 (x) b} and Ω 1a = x W 1 (x) a}. From the hypotesis made about a and b, it results that Ω 2b Ω 1b Ω 2a Ω 1a D (17) Since W 3 (x) is positive definite in D, it is positive in Ω 1,2, Ω 1a Ω 2b. Moreover, it exists a positive constant s where s, min x Ω 1,2 W 3 (x) (18)

4 Let us define the following function α(x, x, y, t), W 3 (x)+ V (19) (f(x + x, y, t) f(x,,t)) The continuity in functions W 3 and f and the fact that V is continuously differentiable implies that α is continuous. From the definition of α and Eq.(18) it results that α(x,,,t) s x Ω 1,2, t (2) Let α M be the function defined by α M ( x, y), sup x Ω 1,2,t (α(x, x, y, t)) (21) It can be easily seen that α M is continuous and α M (, ) s. Then, for any positive number s 1 <s a positive constant r can be found so that the condition ( x, y) r (22a) implies that α M ( x, y) s 1 (22b) and then it results that V (x, t) α(x, x, y, t) α M ( x, y) s 1 (23) in Ω 1,2. From here to the end, the proof follows Theorem 5.3 of (Khalil, 1996). Let Ω a,t = x V (x, t) a} and Ω b,t = x V (x, t) b} be time variable sets. From (15) it results that Ω 2b Ω b,t Ω 1b Ω 2a Ω a,t Ω 1a D (24) The border of Ω a,t is inside Ω 1,2, where V (x, t) is negative. It means that the trajectories of the QSC system (13) cannot abandon Ω a,t. Then, any trajectory starting in Ω 2a cannot abandon Ω 1a. The border of Ω b,t is also inside Ω 1,2. Then the trajectories cannot abandon this time variable set. To complete the proof, we need to ensure that the trajectories initiated in Ω 2a Ω a,t reach Ω b,t in a finite time. Let φ(t) be a solution of (13) starting in Ω a,t (i.e. V (φ(), ) a) and let us suppose that V (φ(t),t) >b t (25) then we have V (φ(t),t) s 1 and after t 1, a b (26) s 1 it results that V (φ(t 1 ),t 1 ) b which yields a contradiction. Then, the region Ω b,t must be reached before the finite time t 1. Since Ω b,t Ω 1b the trajectory also reaches the set before that time. Ω 1b Equation (22a) gives the maximum perturbation allowed to ensure the achievement of the proposed goal (i.e. region of attraction Ω 2a and ultimate bound in Ω 1b ). Since the maximum perturbation in each variable is given by the corresponding quantum, this equation should be used to choose the quantum at the different controller state variables and converters completing in that way the QSC design. Observe that Ω 2a is also the estimation of the region of attraction of the CCS using the Lyapunovfunction V. Then, a QSC implementation can be found so that it conserves the estimated region of attraction. B. Design Algorithm for TV QSC The design of a QSC contoller can be divided in two steps. The first one is the design of the continuous controller, which can be done following any technique. The second step is the choice of the quantization at each variable. The use of a very small quantum yields solutions which are very closed to the trajectories of the CCS. This is due to the property of convergence which tells that under locally Lipchitz conditions on the functions the solutions of the QSC system go to the solutions of the CCS when the quantization go to zero (Kofman, 23). In that way, and also according to Theorem 1, the ultimate bound can be reduced to arbitrary small values. However, the use of a small quantum increases the number of events at the controller and the digital device can fail in its attempt to give the correct output values at the required time. Therefore, there is always a trade off between accuracy and practical considerations related to the computational costs. Then the idea is to exploit Theorem 1 in order to choose the quantization according to some essential features (region of attraction and ultimate bound). In that way, the quantization adopted will be just as small as necessary to ensure those properties and provided that the CCS is not too fast the digital device will be able to correctly implement the resulting QSC controller. The translation of these ideas into a design algorithm for QSC can be written as follows: 1. Design a continuous controller and calculate the Lyapunovfunction V (x, t) and the functions W i (x) according to (15) (16) for the closed loop CCS. 2. Choose the QSC region of attraction Ω 2a and the ultimate region Ω 1b together with the constants a and b. 3. Obtain the perturbed closed loop function f according to (13). 4. Obtain function α according to (19) and α M according to (21).

5 5. Calculate constant s according to (18) and choose the positive constant s 1 <s. If the goal is just to ensure ultimately boundedness s 1 should be very small. Otherwise, if the speed of convergence is also important, it can be chosen taking into account (26). 6. Compute the value of r according to (22). 7. Choose the quantization at the controller state variables and converters so that (22a) is satisfied. It can be easily seen that this procedure leads to a QSC controller which ensures region of attraction Ω 2a and ultimate region Ω 1b. IV. EXAMPLES AND RESULTS The unstable time varying plant ẋp = x p (1 + sin t +cost)+u p y p = (2 + cos t) x p can be stabilized by the controller ẋc = x c + u c y c = x c u c (27) The resulting closed loop system can be written as ẋp = (1 sin t) x p x c ẋ c = (2 + cos t) x p x c Here, the Lyapunovcandidate verifies (15) with V (x p,x c,t)=x 2 p x2 c x2 p cos t W 1 (x p,x c )= 1 2 x2 p x2 c (28) The ultimate bound Ω 1b will be chosen with b =.5. Then, taking into account (28) it results that Ω 1b = x R 2 x 1}. The perturbed equations (13) can be written as ẋp = (1 sin t) x p x c x c + y c y p ẋ c = (2 + cos t) x p x c x c + y p and then, from (19) function α(x, x, y, t) results α = x 2 c 1 2 x2 p + x p (2 + cos t) ( x c + y c y p )+x c ( x c + y p ) Although the maximum α M in (21) cannot be easily obtained, it can be bounded using the fact that x > 1/3 inω 1,2. Then, after some calculations it results that α M ( ( x c + y c + y p ) ( x c + y p ) 2) 1/2 Thus, taking the quantum equal to.18 in the controller and converters we can ensure that α M.93 in Ω 1,2, which implies that the trajectories finish inside Ω 1b in finite time, with a minimum speed s 1 =.93. Figs.2 5 show the simulation results for an initial condition x p =5,x c = The orbital derivative is W 2 (x p,x c )= 3 2 x2 p x2 c V = (2 + cos t) (sin t 1) x 2 p x 2 c 1 2 x2 p sin t which satisfies (16) with W 3 = 1 2 x2 p x 2 c Then, the closed loop CCS is asymptotically stable and the algorithm resulting from Theorem 1 can be used to design the QSC controller. The first step for the QSC design consists in choosing the region of attraction and the ultimate bound. Since inequalities (15) (16) stand in R 2 (i.e. the CCS stability is global) it is not necessary to restrict the region of attraction except for chosing the saturation values. In this case, the choice of Ω 2a does not affect the calculations Figure 2: x p vs. t Figure 3: Final oscillations in x p vs. t

6 5 4 3 that case, the result was very conservative. If the geometrical analysis for LTI systems of (Kofman, 22) were extended for LPV plants, less conservative results might be obtained. 2 REFERENCES Figure 4: x p vs. x c Figure 5: Final oscillations in x p vs. x c Fig.5 also shows that the design was very conservative. The ultimate bound observed in the simulation is less than.3 (in norm 2) which is more than 3 times smaller than the estimated. There are two reasons which can explain this. The first one is that Lyapunovanalysis often leads to conservative estimations of the ultimate bounds. The second reason is that in this case the D/A converter does not introduce any perturbation since it is exactly matched with the quantizer of x c and the A/D converter. V. CONCLUSIONS This work studied the properties of QSC in time varying systems showing that the main features and advantages of the methodology are also satisfied in these cases. Theorem 1 proved that the QSC control of time varying plants allows to ensure ultimately boundedness conserving the region of attraction. A design algorithm derived from this theorem was also introduced and its use was illustrated with an example. When it comes to future work, it should be considered that the main theoretical properties were already proven for general nonlinear time varying systems and for LTI systems. There is an intermediate case which should be taken into account which corresponds to Linear Parameter Varying (LPV) plants. The example given in fact corresponds to that category and although a Lyapunovanalysis could be done for Brockett, R. and D. Liberzon, Quantized feedback stabilization of linear systems, IEEE Trans. Automat. Contr. 45, (2). Delchamps, D., Stabilizing a linear system with quantized state feedback, IEEE Trans. Automat. Contr. 35, (199). Elias, N. and S. Mitter, Stabilization of Linear Systems with Limited Information, IEEE Trans. Automat. Contr. 46(9), (21). Hou, L., A. Michel, and H. Ye, Some qualitative properties of sampled-data control systems, IEEE Trans. Automat. Contr. 42, (1997). Khalil, H., Nonlinear Systems, Prentice-Hall, New Jersey, 2nd edition (1996). Kofman, E., Quantized-State Control of Linear Systems, Proceedings of AADECA 22, Buenos Aires, Argentina (22). Kofman, E., Quantized-State Control. A Method for Discrete Event Control of Continuous Systems., Latin American Applied Research 33(4), (23). Kofman, E. and S. Junco, Quantized State Systems. A DEVS Approach for Continuous System Simulation, Transactions of SCS 18(3), (21). Kofman, E., J. Lee, and B. Zeigler, DEVS Representation of Differential Equation Systems. Review of Recent Advances, Proceedings of ESS 1 (21). Miller, R., A. Michel, and J. Farrel, Quantizer effects on steady-state error specifications of digital feedback control systems, IEEE Trans. Automat. Contr. 34, (1989). Sayiner, N., H. Sorensen, and T. Viswanathan, A non-uniform sampling technique for A/D conversion, Proceedings of ISCAS 93 2, (1993). Zeigler, B. and J. Kim, Extending the DEVS- Scheme knowledge-based simulation environment for real time event-based control, IEEE Trans. on Robotics and Automation 3(9), (1993). Zeigler, B., T. Kim, and H. Praehofer, Theory of Modeling and Simulation. Second edition, Academic Press, New York (2).

Lecture 13 Linear quadratic Lyapunov theory

Lecture 13 Linear quadratic Lyapunov theory EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time

More information

Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x

Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written

More information

4 Lyapunov Stability Theory

4 Lyapunov Stability Theory 4 Lyapunov Stability Theory In this section we review the tools of Lyapunov stability theory. These tools will be used in the next section to analyze the stability properties of a robot controller. We

More information

3. Reaction Diffusion Equations Consider the following ODE model for population growth

3. Reaction Diffusion Equations Consider the following ODE model for population growth 3. Reaction Diffusion Equations Consider the following ODE model for population growth u t a u t u t, u 0 u 0 where u t denotes the population size at time t, and a u plays the role of the population dependent

More information

Lecture 7: Finding Lyapunov Functions 1

Lecture 7: Finding Lyapunov Functions 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1

More information

1 if 1 x 0 1 if 0 x 1

1 if 1 x 0 1 if 0 x 1 Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

More information

15 Limit sets. Lyapunov functions

15 Limit sets. Lyapunov functions 15 Limit sets. Lyapunov functions At this point, considering the solutions to ẋ = f(x), x U R 2, (1) we were most interested in the behavior of solutions when t (sometimes, this is called asymptotic behavior

More information

The Heat Equation. Lectures INF2320 p. 1/88

The Heat Equation. Lectures INF2320 p. 1/88 The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)

More information

4.5 Chebyshev Polynomials

4.5 Chebyshev Polynomials 230 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION 4.5 Chebyshev Polynomials We now turn our attention to polynomial interpolation for f (x) over [ 1, 1] based on the nodes 1 x 0 < x 1 < < x N 1. Both

More information

Predictive Control Algorithms: Stability despite Shortened Optimization Horizons

Predictive Control Algorithms: Stability despite Shortened Optimization Horizons Predictive Control Algorithms: Stability despite Shortened Optimization Horizons Philipp Braun Jürgen Pannek Karl Worthmann University of Bayreuth, 9544 Bayreuth, Germany University of the Federal Armed

More information

TOPIC 4: DERIVATIVES

TOPIC 4: DERIVATIVES TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the

More information

Using the Theory of Reals in. Analyzing Continuous and Hybrid Systems

Using the Theory of Reals in. Analyzing Continuous and Hybrid Systems Using the Theory of Reals in Analyzing Continuous and Hybrid Systems Ashish Tiwari Computer Science Laboratory (CSL) SRI International (SRI) Menlo Park, CA 94025 Email: ashish.tiwari@sri.com Ashish Tiwari

More information

Practice with Proofs

Practice with Proofs Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

More information

Fuzzy Differential Systems and the New Concept of Stability

Fuzzy Differential Systems and the New Concept of Stability Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida

More information

t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).

t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d). 1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction

More information

MATH 425, PRACTICE FINAL EXAM SOLUTIONS.

MATH 425, PRACTICE FINAL EXAM SOLUTIONS. MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator

More information

x a x 2 (1 + x 2 ) n.

x a x 2 (1 + x 2 ) n. Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number

More information

19 LINEAR QUADRATIC REGULATOR

19 LINEAR QUADRATIC REGULATOR 19 LINEAR QUADRATIC REGULATOR 19.1 Introduction The simple form of loopshaping in scalar systems does not extend directly to multivariable (MIMO) plants, which are characterized by transfer matrices instead

More information

On the D-Stability of Linear and Nonlinear Positive Switched Systems

On the D-Stability of Linear and Nonlinear Positive Switched Systems On the D-Stability of Linear and Nonlinear Positive Switched Systems V. S. Bokharaie, O. Mason and F. Wirth Abstract We present a number of results on D-stability of positive switched systems. Different

More information

Systems with Persistent Memory: the Observation Inequality Problems and Solutions

Systems with Persistent Memory: the Observation Inequality Problems and Solutions Chapter 6 Systems with Persistent Memory: the Observation Inequality Problems and Solutions Facts that are recalled in the problems wt) = ut) + 1 c A 1 s ] R c t s)) hws) + Ks r)wr)dr ds. 6.1) w = w +

More information

Real-Time Systems Versus Cyber-Physical Systems: Where is the Difference?

Real-Time Systems Versus Cyber-Physical Systems: Where is the Difference? Real-Time Systems Versus Cyber-Physical Systems: Where is the Difference? Samarjit Chakraborty www.rcs.ei.tum.de TU Munich, Germany Joint work with Dip Goswami*, Reinhard Schneider #, Alejandro Masrur

More information

Nonlinear Systems of Ordinary Differential Equations

Nonlinear Systems of Ordinary Differential Equations Differential Equations Massoud Malek Nonlinear Systems of Ordinary Differential Equations Dynamical System. A dynamical system has a state determined by a collection of real numbers, or more generally

More information

Fixed Point Theorems

Fixed Point Theorems Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation

More information

Roots of Polynomials

Roots of Polynomials Roots of Polynomials (Com S 477/577 Notes) Yan-Bin Jia Sep 24, 2015 A direct corollary of the fundamental theorem of algebra is that p(x) can be factorized over the complex domain into a product a n (x

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric Spaces. Chapter 7. 7.1. Metrics Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

More information

Real Roots of Univariate Polynomials with Real Coefficients

Real Roots of Univariate Polynomials with Real Coefficients Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials

More information

Inner Product Spaces

Inner Product Spaces Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

More information

Section 1.1. Introduction to R n

Section 1.1. Introduction to R n The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

More information

The Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method

The Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method The Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method Robert M. Freund February, 004 004 Massachusetts Institute of Technology. 1 1 The Algorithm The problem

More information

THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE. Contents THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

More information

Orbits of the Lennard-Jones Potential

Orbits of the Lennard-Jones Potential Orbits of the Lennard-Jones Potential Prashanth S. Venkataram July 28, 2012 1 Introduction The Lennard-Jones potential describes weak interactions between neutral atoms and molecules. Unlike the potentials

More information

Recurrent Neural Networks

Recurrent Neural Networks Recurrent Neural Networks Neural Computation : Lecture 12 John A. Bullinaria, 2015 1. Recurrent Neural Network Architectures 2. State Space Models and Dynamical Systems 3. Backpropagation Through Time

More information

OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN. E.V. Grigorieva. E.N. Khailov

OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN. E.V. Grigorieva. E.N. Khailov DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS Supplement Volume 2005 pp. 345 354 OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN E.V. Grigorieva Department of Mathematics

More information

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. 1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

More information

Stability. Chapter 4. Topics : 1. Basic Concepts. 2. Algebraic Criteria for Linear Systems. 3. Lyapunov Theory with Applications to Linear Systems

Stability. Chapter 4. Topics : 1. Basic Concepts. 2. Algebraic Criteria for Linear Systems. 3. Lyapunov Theory with Applications to Linear Systems Chapter 4 Stability Topics : 1. Basic Concepts 2. Algebraic Criteria for Linear Systems 3. Lyapunov Theory with Applications to Linear Systems 4. Stability and Control Copyright c Claudiu C. Remsing, 2006.

More information

1 Error in Euler s Method

1 Error in Euler s Method 1 Error in Euler s Method Experience with Euler s 1 method raises some interesting questions about numerical approximations for the solutions of differential equations. 1. What determines the amount of

More information

FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper. FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is

More information

LS.6 Solution Matrices

LS.6 Solution Matrices LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions

More information

Chapter 1: Financial Markets and Financial Derivatives

Chapter 1: Financial Markets and Financial Derivatives Chapter 1: Financial Markets and Financial Derivatives 1.1 Financial Markets Financial markets are markets for financial instruments, in which buyers and sellers find each other and create or exchange

More information

STABILITY OF LU-KUMAR NETWORKS UNDER LONGEST-QUEUE AND LONGEST-DOMINATING-QUEUE SCHEDULING

STABILITY OF LU-KUMAR NETWORKS UNDER LONGEST-QUEUE AND LONGEST-DOMINATING-QUEUE SCHEDULING Applied Probability Trust (28 December 2012) STABILITY OF LU-KUMAR NETWORKS UNDER LONGEST-QUEUE AND LONGEST-DOMINATING-QUEUE SCHEDULING RAMTIN PEDARSANI and JEAN WALRAND, University of California, Berkeley

More information

General Theory of Differential Equations Sections 2.8, 3.1-3.2, 4.1

General Theory of Differential Equations Sections 2.8, 3.1-3.2, 4.1 A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics General Theory of Differential Equations Sections 2.8, 3.1-3.2, 4.1 Dr. John Ehrke Department of Mathematics Fall 2012 Questions

More information

A New Nature-inspired Algorithm for Load Balancing

A New Nature-inspired Algorithm for Load Balancing A New Nature-inspired Algorithm for Load Balancing Xiang Feng East China University of Science and Technology Shanghai, China 200237 Email: xfeng{@ecusteducn, @cshkuhk} Francis CM Lau The University of

More information

Frequency Response of Filters

Frequency Response of Filters School of Engineering Department of Electrical and Computer Engineering 332:224 Principles of Electrical Engineering II Laboratory Experiment 2 Frequency Response of Filters 1 Introduction Objectives To

More information

1 Review of Newton Polynomials

1 Review of Newton Polynomials cs: introduction to numerical analysis 0/0/0 Lecture 8: Polynomial Interpolation: Using Newton Polynomials and Error Analysis Instructor: Professor Amos Ron Scribes: Giordano Fusco, Mark Cowlishaw, Nathanael

More information

2.3 Convex Constrained Optimization Problems

2.3 Convex Constrained Optimization Problems 42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

More information

Chapter 3 Nonlinear Model Predictive Control

Chapter 3 Nonlinear Model Predictive Control Chapter 3 Nonlinear Model Predictive Control In this chapter, we introduce the nonlinear model predictive control algorithm in a rigorous way. We start by defining a basic NMPC algorithm for constant reference

More information

7 Gaussian Elimination and LU Factorization

7 Gaussian Elimination and LU Factorization 7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method

More information

Load Balancing and Switch Scheduling

Load Balancing and Switch Scheduling EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load

More information

10. Proximal point method

10. Proximal point method L. Vandenberghe EE236C Spring 2013-14) 10. Proximal point method proximal point method augmented Lagrangian method Moreau-Yosida smoothing 10-1 Proximal point method a conceptual algorithm for minimizing

More information

Covariance and Correlation

Covariance and Correlation Covariance and Correlation ( c Robert J. Serfling Not for reproduction or distribution) We have seen how to summarize a data-based relative frequency distribution by measures of location and spread, such

More information

Math 241, Exam 1 Information.

Math 241, Exam 1 Information. Math 241, Exam 1 Information. 9/24/12, LC 310, 11:15-12:05. Exam 1 will be based on: Sections 12.1-12.5, 14.1-14.3. The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/241fa12/241.html)

More information

Lyapunov Stability Analysis of Energy Constraint for Intelligent Home Energy Management System

Lyapunov Stability Analysis of Energy Constraint for Intelligent Home Energy Management System JAIST Reposi https://dspace.j Title Lyapunov stability analysis for intelligent home energy of energ manageme Author(s)Umer, Saher; Tan, Yasuo; Lim, Azman Citation IEICE Technical Report on Ubiquitous

More information

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing

More information

The Quantum Harmonic Oscillator Stephen Webb

The Quantum Harmonic Oscillator Stephen Webb The Quantum Harmonic Oscillator Stephen Webb The Importance of the Harmonic Oscillator The quantum harmonic oscillator holds a unique importance in quantum mechanics, as it is both one of the few problems

More information

Design of a TL431-Based Controller for a Flyback Converter

Design of a TL431-Based Controller for a Flyback Converter Design of a TL431-Based Controller for a Flyback Converter Dr. John Schönberger Plexim GmbH Technoparkstrasse 1 8005 Zürich 1 Introduction The TL431 is a reference voltage source that is commonly used

More information

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding

More information

226-332 Basic CAD/CAM. CHAPTER 5: Geometric Transformation

226-332 Basic CAD/CAM. CHAPTER 5: Geometric Transformation 226-332 Basic CAD/CAM CHAPTER 5: Geometric Transformation 1 Geometric transformation is a change in geometric characteristics such as position, orientation, and size of a geometric entity (point, line,

More information

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

More information

Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

More information

Experiments on the local load balancing algorithms; part 1

Experiments on the local load balancing algorithms; part 1 Experiments on the local load balancing algorithms; part 1 Ştefan Măruşter Institute e-austria Timisoara West University of Timişoara, Romania maruster@info.uvt.ro Abstract. In this paper the influence

More information

MA107 Precalculus Algebra Exam 2 Review Solutions

MA107 Precalculus Algebra Exam 2 Review Solutions MA107 Precalculus Algebra Exam 2 Review Solutions February 24, 2008 1. The following demand equation models the number of units sold, x, of a product as a function of price, p. x = 4p + 200 a. Please write

More information

V(x)=c 2. V(x)=c 1. V(x)=c 3

V(x)=c 2. V(x)=c 1. V(x)=c 3 University of California Department of Mechanical Engineering Linear Systems Fall 1999 (B. Bamieh) Lecture 6: Stability of Dynamic Systems Lyapunov's Direct Method 1 6.1 Notions of Stability For a general

More information

BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBERT SPACE REVIEW BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

More information

2.4 Real Zeros of Polynomial Functions

2.4 Real Zeros of Polynomial Functions SECTION 2.4 Real Zeros of Polynomial Functions 197 What you ll learn about Long Division and the Division Algorithm Remainder and Factor Theorems Synthetic Division Rational Zeros Theorem Upper and Lower

More information

A Passivity Measure Of Systems In Cascade Based On Passivity Indices

A Passivity Measure Of Systems In Cascade Based On Passivity Indices 49th IEEE Conference on Decision and Control December 5-7, Hilton Atlanta Hotel, Atlanta, GA, USA A Passivity Measure Of Systems In Cascade Based On Passivity Indices Han Yu and Panos J Antsaklis Abstract

More information

Quotient Rings and Field Extensions

Quotient Rings and Field Extensions Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

More information

Figure 1.1 Vector A and Vector F

Figure 1.1 Vector A and Vector F CHAPTER I VECTOR QUANTITIES Quantities are anything which can be measured, and stated with number. Quantities in physics are divided into two types; scalar and vector quantities. Scalar quantities have

More information

Rolle s Theorem. q( x) = 1

Rolle s Theorem. q( x) = 1 Lecture 1 :The Mean Value Theorem We know that constant functions have derivative zero. Is it possible for a more complicated function to have derivative zero? In this section we will answer this question

More information

Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

More information

4.3 Lagrange Approximation

4.3 Lagrange Approximation 206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average

More information

1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm

1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok

More information

Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS

Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and

More information

3 Contour integrals and Cauchy s Theorem

3 Contour integrals and Cauchy s Theorem 3 ontour integrals and auchy s Theorem 3. Line integrals of complex functions Our goal here will be to discuss integration of complex functions = u + iv, with particular regard to analytic functions. Of

More information

5 Numerical Differentiation

5 Numerical Differentiation D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives

More information

Mathematical Modeling and Dynamic Simulation of a Class of Drive Systems with Permanent Magnet Synchronous Motors

Mathematical Modeling and Dynamic Simulation of a Class of Drive Systems with Permanent Magnet Synchronous Motors Applied and Computational Mechanics 3 (2009) 331 338 Mathematical Modeling and Dynamic Simulation of a Class of Drive Systems with Permanent Magnet Synchronous Motors M. Mikhov a, a Faculty of Automatics,

More information

THE CENTRAL LIMIT THEOREM TORONTO

THE CENTRAL LIMIT THEOREM TORONTO THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................

More information

School of Engineering Department of Electrical and Computer Engineering

School of Engineering Department of Electrical and Computer Engineering 1 School of Engineering Department of Electrical and Computer Engineering 332:223 Principles of Electrical Engineering I Laboratory Experiment #4 Title: Operational Amplifiers 1 Introduction Objectives

More information

Review of Basic Options Concepts and Terminology

Review of Basic Options Concepts and Terminology Review of Basic Options Concepts and Terminology March 24, 2005 1 Introduction The purchase of an options contract gives the buyer the right to buy call options contract or sell put options contract some

More information

THREE DIMENSIONAL GEOMETRY

THREE DIMENSIONAL GEOMETRY Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,

More information

CPC/CPA Hybrid Bidding in a Second Price Auction

CPC/CPA Hybrid Bidding in a Second Price Auction CPC/CPA Hybrid Bidding in a Second Price Auction Benjamin Edelman Hoan Soo Lee Working Paper 09-074 Copyright 2008 by Benjamin Edelman and Hoan Soo Lee Working papers are in draft form. This working paper

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

Homework # 3 Solutions

Homework # 3 Solutions Homework # 3 Solutions February, 200 Solution (2.3.5). Noting that and ( + 3 x) x 8 = + 3 x) by Equation (2.3.) x 8 x 8 = + 3 8 by Equations (2.3.7) and (2.3.0) =3 x 8 6x2 + x 3 ) = 2 + 6x 2 + x 3 x 8

More information

LEARNING OBJECTIVES FOR THIS CHAPTER

LEARNING OBJECTIVES FOR THIS CHAPTER CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

More information

Some Problems of Second-Order Rational Difference Equations with Quadratic Terms

Some Problems of Second-Order Rational Difference Equations with Quadratic Terms International Journal of Difference Equations ISSN 0973-6069, Volume 9, Number 1, pp. 11 21 (2014) http://campus.mst.edu/ijde Some Problems of Second-Order Rational Difference Equations with Quadratic

More information

COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012

COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012 Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about

More information

ALMOST COMMON PRIORS 1. INTRODUCTION

ALMOST COMMON PRIORS 1. INTRODUCTION ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type

More information

Nonlinear Algebraic Equations. Lectures INF2320 p. 1/88

Nonlinear Algebraic Equations. Lectures INF2320 p. 1/88 Nonlinear Algebraic Equations Lectures INF2320 p. 1/88 Lectures INF2320 p. 2/88 Nonlinear algebraic equations When solving the system u (t) = g(u), u(0) = u 0, (1) with an implicit Euler scheme we have

More information

Optimization of Wireless Resources for Personal Communications Mobility Tracking *

Optimization of Wireless Resources for Personal Communications Mobility Tracking * Optimization of Wireless Resources for Personal Communications Mobility Tracking * Upamanyu Madhow, Michael L. Honig and Ken Steiglitz ABSTRACT In personal communications applications, users communicate

More information

Zeros of Polynomial Functions

Zeros of Polynomial Functions Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n-1 x n-1 + + a 1 x + a 0 has integer coefficients and p/q (where p/q is reduced) is a rational zero, then p is a factor of

More information

Quasi-static evolution and congested transport

Quasi-static evolution and congested transport Quasi-static evolution and congested transport Inwon Kim Joint with Damon Alexander, Katy Craig and Yao Yao UCLA, UW Madison Hard congestion in crowd motion The following crowd motion model is proposed

More information

How To Balance In A Distributed System

How To Balance In A Distributed System 6 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 11, NO. 1, JANUARY 2000 How Useful Is Old Information? Michael Mitzenmacher AbstractÐWe consider the problem of load balancing in dynamic distributed

More information

LOOP TRANSFER RECOVERY FOR SAMPLED-DATA SYSTEMS 1

LOOP TRANSFER RECOVERY FOR SAMPLED-DATA SYSTEMS 1 LOOP TRANSFER RECOVERY FOR SAMPLED-DATA SYSTEMS 1 Henrik Niemann Jakob Stoustrup Mike Lind Rank Bahram Shafai Dept. of Automation, Technical University of Denmark, Building 326, DK-2800 Lyngby, Denmark

More information

Planar Curve Intersection

Planar Curve Intersection Chapter 7 Planar Curve Intersection Curve intersection involves finding the points at which two planar curves intersect. If the two curves are parametric, the solution also identifies the parameter values

More information

OPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS

OPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS ONDERZOEKSRAPPORT NR 8904 OPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS BY M. VANDEBROEK & J. DHAENE D/1989/2376/5 1 IN A OPTIMAl PREMIUM CONTROl NON-liFE INSURANCE BUSINESS By Martina Vandebroek

More information

4. Continuous Random Variables, the Pareto and Normal Distributions

4. Continuous Random Variables, the Pareto and Normal Distributions 4. Continuous Random Variables, the Pareto and Normal Distributions A continuous random variable X can take any value in a given range (e.g. height, weight, age). The distribution of a continuous random

More information

Figure 2.1: Center of mass of four points.

Figure 2.1: Center of mass of four points. Chapter 2 Bézier curves are named after their inventor, Dr. Pierre Bézier. Bézier was an engineer with the Renault car company and set out in the early 196 s to develop a curve formulation which would

More information

CHAPTER 5 Round-off errors

CHAPTER 5 Round-off errors CHAPTER 5 Round-off errors In the two previous chapters we have seen how numbers can be represented in the binary numeral system and how this is the basis for representing numbers in computers. Since any

More information

Understanding Poles and Zeros

Understanding Poles and Zeros MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING 2.14 Analysis and Design of Feedback Control Systems Understanding Poles and Zeros 1 System Poles and Zeros The transfer function

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information