Continuous Piecewise Linear Control for Nonlinear Systems: The Parallel Model Technique
|
|
- Leslie Harmon
- 7 years ago
- Views:
Transcription
1 Continuous Piecewise Linear Control for Nonlinear Systems: The Parallel Model Technique Andrés G. García Universidad Nacional del Sur Dto. de Ing. Eléctrica y de Computadoras Instituto de Investigación en Ing. Eléctrica (IIIE, UNS-CONICET) Av. Alem 1253, B. Blanca Argentina Osvaldo E. Agamennoni Universidad Nacional del Sur Dto. de Ing. Eléctrica y de Computadoras Instituto de Investigación en Ing. Eléctrica (IIIE, UNS-CONICET) Av. Alem 1253, B. Blanca Argentina Abstract: This paper describes a systematic technique for obtaining controllers for Nonlinear Systems using a Continuous Piecewise Linear Approximation (CPWL) of the given Nonlinear vector field. The method proposes the use of a CPWL approximation of the Nonlinear System and then a theory is developed to show that the stabilization of the CPWL aproximation ODE yields stability for the Nonlinear ODE. An example is presented in order to show the capabilities of this idea but also the practical applicability. Finally some conclusions and future work are depicted. Key Words: Nonlinear ODE s, Continuous Piecewise Linear ODE s, Control Systems. 1 Introduction Nonlinear Controller design is a very involved issue into the control community. While for linear systems there exists a wide range of methodologies from analysis to readily implementable strategies (see [1], [2] and [4]), for Nonlinear dynamics only a few methodologies are known to be effective and usually encounter in practice hard problems regarding time consuming or demanding tremendous amounts of capabilities from computer resources (see [6],[7] and [8]). Since Control problems are not more than a parameterized Initial Value Problem (IVP) for Ordinary Differential Equations (ODE s), for designing control strategies, is natural to resort primarily to techniques able to solve -or approximate- such a problems. One methodology which has shown to be effective either from numerical issues or theoretical analysis is the use of Continuous Piecewise Linear Approximations (CPWL), this idea was early studied by Sacks in a qualitative fashion (see [14]) and later extended to approximate solutions by Girard, De Feo, Storace and Johansson (see [13], [19] and [11]). Is worth noticing that two main research streams are related to Continuous Piecewise Linear (CPWL) ODE s: Dynamic Systems which are written as CPWL ODE s. As approximation to Nonlinear Continuous ODE s. First item was pioneered studied and defined by Chua in the early s 70 s (see [16] and [17]). This work gave origin to a Canonical Representation for a CPWL Basis able to represent any CPWL vector field developed by Julián (see [9]). Using this basis a reliably toolbox written in Matlab code were developed in order to approximate a given vector field with some desired degree of error (see [10]), on the other hand with a different procedure than a CPWL basis the Phd thesis of Johansson also leads a Matlab toolbox (see [11]). Second item was conducted by Storace and De Feo who made several numerical experiments to investigate topological properties of Nonlinear ODE s of low dimensions. However, this work is not proving in rigor that the properties of the given the Nonlinear ODE and the CPWL approximation are shared by both systems, they only present extensive simulations and Continuation numerical packages to show this idea (see [15]). One attempt to overcome this inconvenient providing a way to decide if both (Nonlinear ODe and its CPWL approximation) share properties, are the works in [13] and [18] where Dynamic Error Bounds are derived. The former paper proved that the trajectories of the Nonlinear ODE and the trajectories of the approximation CPWL differs in norm around the order of the grid size -see [9] for a precise definition of gride size, while the second paper proved that the dynamics of 39 ISSN
2 the error bound introduced in that paper is the same as the CPWL approximation ODE. As is evident, the result in [18] when applied to a system with a stable CPWL approximation will lead the conclusion that the trajectories of both systems are stable and this precisely the topic of the present paper, the concept of Parallel Model, that means, given a Nonlinear control system to the type x(t = f(x) + B u and a CPWL approximation of f(x), f CP W L (x), then a CPWL controller u CP W L (x) stabilizing x CP W L (t) = f CP W L (x CP W L )+B u CP W L is also stabilizing x(t = f(x) + B u. A remarkable point here is the fast implementation of CPWL functions with microelectronics suggests that the future implementation of electronic controller could be appealing via CPWL vector fields which approximate any nonlinear dynamical system with some degree of accuracy, see [20] This paper is organized as follows: Section 2 introduces precise definitions for the kind of Nonlinear systems considered in this paper and the goal addressed,section 2.1 presents the formulation of an error bound able to ensure stability for both systems, Section 3 provides an analysis of the asymptotic properties of the approximate and real systems, Section 4 shows how the developed theory works in practice applicability in a real case and finally Section 5 depict some conclusions and future directions for research. 2 ABOUT THE PROBLEM CON- SIDERED A Nonlinear Control System is a set of ODEs to the form Ẋ(t) = f(x, u) where X Rn and with X R m. In this context, one important aim is to determine a suitable controller u endowing the system with some desired properties (stability, asymptotic stability, robustness, performance, etc). As is very well known this aim is very difficult in practice for general cases with any nonlinear control system as exposed above, being available only a few partial results for special cases. The idea in what follows is to produce an approximation of the Nonlinear Vector Field with a CPWL one, moving the task of designing the controller to the side of the approximate vector field and keeping track some error bound. Notice that the design procedure for the obtained CPWL ODE can be carried out with the available techniques for designing of controllers for Piecewise Linear ODE s in general as the one in [11] or [24]. However, the theory that it will be developed in the present paper will give support to the techniques in [11]. In this paper we aim to develop a controller u(t) for the following class of Nonlinear Systems: X(t) = f(x) + B u(t), (1) where X R n, f : R n R n is a smooth vector field and B is a constant matrix B R nm. The point is to approximate the Nonlinear vector field f by using a CPWL one as follows: X CP W L = f CP W L (X CP W L ) + B u(t), (2) where X are the approximate trajectories to X in (1). Incidentally notice that the same controller u(t) is applied to both systems, moreover, if we define the control vector u(t) to be Continuous Piecewise Linear 1 with the same partition as for f(x), we have: Ẋ = f(x) + B u CP W L X CP W L = f CP W L (X CP W L ) + B u CP W L u CP W L = A i u X CP W L + B i u (3) where the notation A i and B i was introduced in [18] indicating the matrices forming the linear approximation into the simplex i th. This is the reason why this technique will be called Parallel Model, since we need the trajectories of the CPWL model in order to be applied into u CP W L to effectively control Ẋ = f(x) + B u CP W L 2.1 CPWL Approximations for Nonlinear Control Systems The class of Nonlinear control systems defined in (1) can be described in a formal way as follows: Ẋ(t) = f(x) + B u CP W L f(x) = [f 1 (X) f n (X)] T f i U R n R i = 1,..., n X = [X 1 X n ] T, where T stands for transpose. Let us consider U divided in r simplices using a boundary configuration H as described in [9] with the CPWL approximation f CP W L in the simplex i th to the given vector field f denoted by: f i CP W L (X) = [f i 1CP W L (X) f i ncp W L (X)]T f i CP W L (X) = Ai X + B i 1 u(t) could be Piecewise Linear Discontinuous as discussed in [11], pp ISSN
3 In what follows we use the idea presented in [9],pp. 100, where the maximum norm was used in order to characterize the size of the error: f 1 (X) f i 1CP W L (X) ε 1 f 2 (X) f i 2CP W L (X) ε 2 i = 1,..., r.. f n (X) fncp i W L (X) ε n (4) Then we are looking for an error bound for the trajectories such that: X X i h i (ε), i = 1,..., r, (5) where h i : R n R + is a continuous function, ε = [ε 1... ε n ] T, X i is the approximate trajectory to X(t) running into the i th simplex and. stand for the maximum norm. In this way, the approximating CPWL control system will be: Ẋ i = f i CP W L(X i ) + B (A (i) u X i + B (i) u ) where X i = [X i 1 Xi n] T is the state vector of the CPWL approximation ODE while X(t) are the trajectories of the Nonlinear ODE. 2. Next subsection develop Error Bounds in the sense of (5) which share the dynamics of the CPWL approximation ODE. 2.2 Obtaining an Error Bound for the Approximate Trajectories Taking into account (4), is possible to obtain an error bound in the spirit of (5) as follows: f j (X) f i jcp W L (X) ε j, j = 1,..., n, i = 1,..., r, (6) Defining the Error for the Trajectories for the i th simplex as follows: E i (t) = X X i (t). (7) Adding and subtracting B u CP W L, u CP W L = A i u X i + Bu i and considering the notation introduced in previous section: f CP W L (X) = A i X + B i, then equation (6) becomes: 2 This notation is providing a formal statement of equation (2) Ėi j (Ai + B A i u) E i ε j, j = 1,..., n, i = 1,..., r. (8) Here we wrote E i = [E1 i Ei n] T. Notice that (8) is in fact a differential inequality in Ej i for each j = 1,..., n, however this equation can be recast in a matrix way as follows: ε Ė i (A i + B A i u) E i ε, i = 1,..., r, (9) where ε = [ε 1 ε n ] T. The last step will be then to solve the Matrix Inequality in equation (9) and for that a Theorem by Coppel will be used -see [21], pp ): Theorem 1 Let y(x) be a solution of the scalar ODE dy(x) dx = f(x, y) where f(x, y) is continuous. If u(x) is continuous and satisfies u(a) y(a) and du(x) dx f(x, u) on [a, b], then: Similarly, if s(a) y(a) and ds(x) dx then s(x) y(x) on [a, b]. u(x) y(x) (10) f(x, s) on [a, b], Then the Error Bounds in equation (9) can be restated now: E 1 (t) E(t) E 2 (t) Ė 1 (t) = (A i + B A i u) E i ε Ė 2 (t) = (A i + B A i u) E i + ε j = 1,.., n (11) It is worth noticing that the stability issues of the Error Bound in (11) are shared by the CPWL ODE X CP W L = f CP W L (X CP W L ) + B u CP W L (X CP W L ). On the other hand, the point missing it is to provide a way to determine when a CPWL system is stable and for that we have the following Theorem 3 : Theorem 2 Given an Continuous CPWL ODE: Ẋ = A i X+B i for a Domain Ω with only equilibrium points in the interior of the simplices 4 with all the matrices A i stable (negative definite) and such that the trajectories remains inside Ω for all x Ω, then the ODE is stable in the sense that the equilibrium points are attractive for any initial condition x(0) Ω. 3 The proof is given in the appendix. 4 That means to exclude the possibility for equilibrium points in the frontiers 41 ISSN
4 3 CPWL AND NONLINEAR SYS- TEMS SHARE PROPERTIES As depicted in previous section, for systems which all the matrices A i are stable for any simplex in the CPWL approximation ODE, then the Error Bounds in equation (11) also go to an equilibrium point showing that the Nonlinear ODE is following the CPWL approxiamtion when the same CPWL controller is used in both systems. Here arises the important remark that for a sufficient amount of simplices (ensuring low values of ε), the properties imposed to the CPWL approximating system are also Shared by the Nonlinear given system. In this way, we can design a controller to track some reference using the CPWL system, regulate some given outputs, check stability, design optimal controllers, etc. One of the most important properties in a Nonlinear control system is the concept of controllability (observability), where a controller u is required in order to drive the system from an initial point x(0) to a point x(t ) for some time T (see [23], pp. 511). In this way, is useful to introduce the concept of quasicontrollability: Definition 3 (ρ-quasi-controllability): A Nonlinear system to the form Ẋ = f(x) + g(x) u is called ε- Quasi-Controllable if there exists a controller u, such that the trajectories are close to the point X T in ε when t goes to infinity: X(T ) = X T X(0) = X 0 ρ lim t X(t) X T ρ ρ > 0 (12) Theorem 4 : Given a Nonlinear system Ẋ = f(x) + B u and its CPWL approximation: Ẋ i = f i P W L (Xi ) + B u(t), then the Nonlinear system is ρ-quasi-controllable. Proof: According to the definition in (12), we only have to realize that the quantity ρ is not more than equilibrium of the Error Bound: (A i + B A i u) 1 ε obtained in equation (11), for some simplex I where the point X(T ) belongs. Is interesting to notice that the definition of Quasi-Controllability becomes the classic Controllability definition when the number of simplices tend to infinity. In this way this concept is telling how possible is to drive a non-linear system close to some desired point using a controller designed in the basis of the CPWL approximation. 4 EXAMPLE: Academic Example A simpel example taken from [11] is the inverted pendulum: ẋ1 (t) = x 2 ẋ 2 (t) = 0.1 x 2 + sin(x 1 ) + u CP W L (13) In this way and using 10 simplices in each coordinate with a range of [ 1, 1] in the x coordinate and [ 10, 10] for y to produce a CPWL of the Drift [x 2, 0.1 x 2 + sin(x 1 )], it is possible to apply the stabilization technique depicted in [11], pp. 102, to design a control law give by u CP W L = [ ] [x, y]. With this controller we, the maximum error is of 0.03 in absolute value, so both CPWL and Nonlinear systems are stabilized by the same controller. 5 Conclusion A methodology for designing controllers for some a class of Nonlinear Control systems was presented. In this methodology an approximation of the Nonlinear Drift of the given Control system is approximated with a CPWL one. Using the CPWL approximation ODE as a Parallel Control system, the design of a controller with any desired property (stability, optimal strategy, etc) for the Nonlinear system is then translated into the design for the CPWL one. It was shown that the same properties assigned to the CPWL system are shared by the Nonlinear system when the same controller is applied to both dynamics. An example showed an application of the theory developed, specially the idea of Quasi-controllability introduced in section 3. This concept is pointing into the direction of proving strong properties using the CPWL control system, let s say it would be interesting to show that the controllability of CPWL and Nonlinear systems are equivalent. 6 Appendix Proof of Theorem 2 Then is possible to define an auxiliary ODE as follows: Ai X + B Z = i = Ẋ, X V ertices Z(T vertex ), Otherwise then: (14) 42 ISSN
5 Ż = A i, X V ertices 0, Otherwise where T vertex are the instants where the trajectories of the CPWL ODE is crossing from one simplex to the next one. Notice that this definition is preventing problems whit the discontinuities of Ż at the vertices. In this way, we have: Ż = A i Z Ż = 1 2 (Z Z) x Consider next the following integral: Ẋ dz = In other words: t 0 Ẋ Ż dt = (15) = 1 X(t) 2 (Z Z) dx X(0) } X } d(z Z) Ẋ dz = Z(t) 2 2 In order to solve this integral, the continuity of the variable Z(t) in the borders or frontiers in virtue of definition (14) is invoked. Then: = 1 2 Ẋ dz = m 1 i=1 m i=1 X(Ti+1 ) + X(T i ) X(t) X(T m 1 ) Ti+1 T i Ẋ Ż dt = (Z Z) dx + X (Z Z) dx. X where. 2 is the l2-norm (see [28] for a further reading) and T i, i = 1,.., m are the crossing times or the times where the trajectories cross from one simples to the next one. On the other hand the integral in equation (15) also means: t 0 t Ẋ Ż dt = Ẋ A i Ẋ dt (16) If we require ẋ A i Ẋ < 0, then this equation leads: 0 ẋ dz < 0 Z(t) 2 2 < 0 Notice that only for the very special case of Piecewise Quadratic functions as Ẋ Ai Ẋ, the requirement Ẋ A i Ẋ < 0 is equivalent to say that A i is asymptotically stable or negative definite (see [27]). Focusing the aim of stability we need to consider the integral in equation (16) whit t tending to infinity, which yields: i=1 Ti+1 T i Ẋ A i ẋ dt = finite It is well known that a necessary condition for a convergence of a an infinite sum is the limit at infinity of the general term tending to zero, in this case this leads: lim i Ti+1 T i Ẋ A i ẋ dt = 0 (17) This only leaves two possibilities: Ẋ A i ẋ 0 as t lim i (T i T i+1 ) = 0 The first case is our desired objective since Ẋ A i ẋ 0 means ẋ 0, however the second possibility requires a special care, it is indicating that the equilibriums are allocated in the frontiers leaving the possibility of instabilities even when the dynamics of the individuals simplices are stable as reported in [26] and [25]. Acknowledgements: The research was supported by CIC, ONICET, Universidad Nacional del Sur and Agencia Nacional de Promoción Científica y Técnica. References: [1] A. Bemporad, F. Borrelli and M.Morari, Model Predictive Control Based on Linear Programming-The Explicit Solution, IEEE Transactions on Automatic Control. 47, 2004, pp [2] A. Bemporad, M. Morari and V.D. Pistikopoulos, The Explicit Solution of Model Predictive Control Via Multiparametric Quadratic Programming, Proceedings of the American Control Conference, Chicago. Illinois, 2000, pp ISSN
6 [3] A. Bemporad, M. Morari and V.D. Pistikopoulos, The Explicit Linear Quadratic Regulator for Constrained Systems, Automatica, 38, 2002, pp [4] F. Borrelli, A. Bemporad and M. Morari,Geometric Algorithm for Multiparametric Linear Programming, Journal of Optimization theory and applications, 118, 2003, pp [5] A. Bemporad, F. Borrelli, and M. Morari, Optimal Controllers for Hybrid Systems: Stability and Piecewise Linear Explicit Form, Proceedings 39th IEEE Conference on Decision and Control, Sydney, 2000, pp [6] I. Rodrigues and J. How, Automated Control Design for a Piecewise-Affine Approximation of a class of Nonlinear Systems, Proceeding of the American Control Conference, Arlington, 2001, pp [7] L. Rodrigues and S. Boyd, Piecewise-Affine State Feedback Using Convex Optimization, Proceeding of the American Control Conference, Boston, Massachusetts, 2004, pp [8] Z. Wan and M.V. Kothare, Efficient Scheduled Stabilizing Output Feedback Model Predictive Control for Constrained Nonlinear Systems, IEEE Transactions on Automatic Control, 49, 2004, pp [9] P.M. Julián, A High Level Canonical Piecewise Linear Representation: Theory and Applications, Phd. Thesis, 1999, Universidad Nacional del Sur. [10] P.M. Julián, A Toolbox for Piecewise Linear Approximations of Multidimensional Functions, personales/pjulian/cpwl.htm. [11] M. Johansson, Piecewise Linear Control Systems, Springer Verlag, [12] O. De Feo and M. Storace, PWL identification of dynamical systems: some examples, Proceeding of ISCAS, Vancouver, Canada, 2004, pp [13] A. Girard, Approximate Solutions Of ODEs Using Piecewise Linear Vector Fields, Proceedings of Computer Algebra in Scientific Computing, Yalta, Ukraine, 2002, pp [14] E. Sacks, Automatic Qualitative Analysis of Dynamic Systems Using Picewise Linear Approximations, Artificial Intelligence., 3, 1990, pp [15] M. Storace and O. De Feo, Piecewise-LInear Approxiamtions of Nonlinear Dynamical Systems, IEEE Transcations on Circuits and Systems-I:Regular Papers, 51, 2004, [16] L.O. Chua, Efficient computer algorithms for piecewise-linear analysis of resistive nonlinear networks, IEEE Transactions on Circuit Theory, 1, 18, 1971, pp [17] L.O. Chua, S.M. Kang, Section-wise piecewiselinear functions: canonical representation, properties and applications, Proceedings of the IEEE, 6, 65, 1977, pp [18] A. Garcia, S. Biagiola, L. Castro, J. Figueraoa and O. Agamennoni, Approximate Solutions for Non-Linear Autonomous ODEs On the Basis of PWL Approximation Theory, Applied Analysis and Differential Equations- Proceedings of ICAADE, Iasi, Romania, [19] O. De Feo and M. Storace, PWL Identification of Dynamical sysems: some examples, Proceeding of ISCAS, Vancouver, Canada, 2004, pp [20] M. Parodi, M. Storace and P.M. Julián, Synthesis of multiport resistors with piecewise-linear characteristics: A mixedsignal architecture, Journal on Circuit Theory and Applications, 33, 2005, pp [21] W.A. Coppel, Disconjugacy, Lecture Notes in Math., 220, Springer Verlag, Berlin, 1971 [22] G. Inalhan, M. Tillerson and J. How, Relative dynamics and control of spacecrafts formations in eccentric orbits, Journal of Guidance, Control, and Dynamics, 25, 2002, pp [23] S. Sastry, Nonlinear Systems: Analysis, Stabiliy and Control, Springer Verlag, New York, [24] D. Liberzon and S. Morse, Basic Problems in Stability and Design of Switchied Systems, IEE Control Systems Magazine, 9, 19, 1999, pp [25] V. Carmona, E. Freire, E. Ponce, F. Torres and J. Ros, Some Recent Results for Continous Switched Linear Systems, 12th International Power Electronics and Motion Control Conference, [26] V. Carmona, E. Freire, E. Ponce and F. Torres, nstability in the Simplest Class of Continuous Switched Linear Systems with Stable Components, 16th IFAC World Congress. Praga, Chec Republic, [27] H.G. Kwatny and G.L. Blankenship, Nonlinear Control and Analytical Mechanics, [28] R.A. Horn and C.R. Johnson, Matrix Analysis, ISSN
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 informationLecture 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 informationMATH 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 informationMetric 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 information19 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 informationLecture 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 informationOn 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 informationNanociencia et Moletrónica
V Jiménez-Fernández, L Hernández-Martínez, Z Hernández-Paxtián and C Ventura- Arizmendi, Internet Electron J Nanoc Moletrón 2, Vol 9, N, pp 639-654 639 Internet Electronic Journal* Nanociencia et Moletrónica
More informationInner 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 informationThe 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 informationClass Meeting # 1: Introduction to PDEs
MATH 18.152 COURSE NOTES - CLASS MEETING # 1 18.152 Introduction to PDEs, Fall 2011 Professor: Jared Speck Class Meeting # 1: Introduction to PDEs 1. What is a PDE? We will be studying functions u = u(x
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More informationNumerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 10
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 10 Boundary Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
More informationFuzzy 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 informationCONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation
Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in
More informationSECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA
SECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA This handout presents the second derivative test for a local extrema of a Lagrange multiplier problem. The Section 1 presents a geometric motivation for the
More informationDifferentiation of vectors
Chapter 4 Differentiation of vectors 4.1 Vector-valued functions In the previous chapters we have considered real functions of several (usually two) variables f : D R, where D is a subset of R n, where
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationExample 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 informationLinear-Quadratic Optimal Controller 10.3 Optimal Linear Control Systems
Linear-Quadratic Optimal Controller 10.3 Optimal Linear Control Systems In Chapters 8 and 9 of this book we have designed dynamic controllers such that the closed-loop systems display the desired transient
More informationBANACH 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 informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More information7 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 informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
More informationLecture 2: August 29. Linear Programming (part I)
10-725: Convex Optimization Fall 2013 Lecture 2: August 29 Lecturer: Barnabás Póczos Scribes: Samrachana Adhikari, Mattia Ciollaro, Fabrizio Lecci Note: LaTeX template courtesy of UC Berkeley EECS dept.
More informationDERIVATIVES AS MATRICES; CHAIN RULE
DERIVATIVES AS MATRICES; CHAIN RULE 1. Derivatives of Real-valued Functions Let s first consider functions f : R 2 R. Recall that if the partial derivatives of f exist at the point (x 0, y 0 ), then we
More information15 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 informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationScalar Valued Functions of Several Variables; the Gradient Vector
Scalar Valued Functions of Several Variables; the Gradient Vector Scalar Valued Functions vector valued function of n variables: Let us consider a scalar (i.e., numerical, rather than y = φ(x = φ(x 1,
More informationSolving Simultaneous Equations and Matrices
Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering
More informationUsing 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 informationMatLab - Systems of Differential Equations
Fall 2015 Math 337 MatLab - Systems of Differential Equations This section examines systems of differential equations. It goes through the key steps of solving systems of differential equations through
More informationCONTROL SYSTEMS, ROBOTICS AND AUTOMATION Vol. XVI - Fault Accomodation Using Model Predictive Methods - Jovan D. Bošković and Raman K.
FAULT ACCOMMODATION USING MODEL PREDICTIVE METHODS Scientific Systems Company, Inc., Woburn, Massachusetts, USA. Keywords: Fault accommodation, Model Predictive Control (MPC), Failure Detection, Identification
More informationPassive control. Carles Batlle. II EURON/GEOPLEX Summer School on Modeling and Control of Complex Dynamical Systems Bertinoro, Italy, July 18-22 2005
Passive control theory I Carles Batlle II EURON/GEOPLEX Summer School on Modeling and Control of Complex Dynamical Systems Bertinoro, Italy, July 18-22 25 Contents of this lecture Change of paradigm in
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 7: Conditionally Positive Definite Functions Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH 590 Chapter
More informationA characterization of trace zero symmetric nonnegative 5x5 matrices
A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the
More informationMathematical finance and linear programming (optimization)
Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may
More informationSIXTY STUDY QUESTIONS TO THE COURSE NUMERISK BEHANDLING AV DIFFERENTIALEKVATIONER I
Lennart Edsberg, Nada, KTH Autumn 2008 SIXTY STUDY QUESTIONS TO THE COURSE NUMERISK BEHANDLING AV DIFFERENTIALEKVATIONER I Parameter values and functions occurring in the questions belowwill be exchanged
More informationDynamic Eigenvalues for Scalar Linear Time-Varying Systems
Dynamic Eigenvalues for Scalar Linear Time-Varying Systems P. van der Kloet and F.L. Neerhoff Department of Electrical Engineering Delft University of Technology Mekelweg 4 2628 CD Delft The Netherlands
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationMath 120 Final Exam Practice Problems, Form: A
Math 120 Final Exam Practice Problems, Form: A Name: While every attempt was made to be complete in the types of problems given below, we make no guarantees about the completeness of the problems. Specifically,
More information8.2. Solution by Inverse Matrix Method. Introduction. Prerequisites. Learning Outcomes
Solution by Inverse Matrix Method 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix algebra allows us
More informationdegrees of freedom and are able to adapt to the task they are supposed to do [Gupta].
1.3 Neural Networks 19 Neural Networks are large structured systems of equations. These systems have many degrees of freedom and are able to adapt to the task they are supposed to do [Gupta]. Two very
More information1 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 information2.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 informationReliability Guarantees in Automata Based Scheduling for Embedded Control Software
1 Reliability Guarantees in Automata Based Scheduling for Embedded Control Software Santhosh Prabhu, Aritra Hazra, Pallab Dasgupta Department of CSE, IIT Kharagpur West Bengal, India - 721302. Email: {santhosh.prabhu,
More informationHøgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver
Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin e-mail: chechkin@mech.math.msu.su Narvik 6 PART I Task. Consider two-point
More informationLecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization
Lecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization 2.1. Introduction Suppose that an economic relationship can be described by a real-valued
More informationDimension Theory for Ordinary Differential Equations
Vladimir A. Boichenko, Gennadij A. Leonov, Volker Reitmann Dimension Theory for Ordinary Differential Equations Teubner Contents Singular values, exterior calculus and Lozinskii-norms 15 1 Singular values
More information1.2 Solving a System of Linear Equations
1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables
More informationMATH10212 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 information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationLinköping University Electronic Press
Linköping University Electronic Press Report Well-posed boundary conditions for the shallow water equations Sarmad Ghader and Jan Nordström Series: LiTH-MAT-R, 0348-960, No. 4 Available at: Linköping University
More informationAn Introduction to Partial Differential Equations
An Introduction to Partial Differential Equations Andrew J. Bernoff LECTURE 2 Cooling of a Hot Bar: The Diffusion Equation 2.1. Outline of Lecture An Introduction to Heat Flow Derivation of the Diffusion
More informationNEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS
NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS TEST DESIGN AND FRAMEWORK September 2014 Authorized for Distribution by the New York State Education Department This test design and framework document
More informationStability. 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 informationChapter 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 informationLecture 1: Introduction to Dynamical Systems
Lecture 1: Introduction to Dynamical Systems General introduction Modeling by differential equations (inputs, states, outputs) Simulation of dynamical systems Equilibria and linearization System interconnections
More informationMechanics 1: Conservation of Energy and Momentum
Mechanics : Conservation of Energy and Momentum If a certain quantity associated with a system does not change in time. We say that it is conserved, and the system possesses a conservation law. Conservation
More informationCreating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities
Algebra 1, Quarter 2, Unit 2.1 Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned
More informationPolynomial and Rational Functions
Polynomial and Rational Functions Quadratic Functions Overview of Objectives, students should be able to: 1. Recognize the characteristics of parabolas. 2. Find the intercepts a. x intercepts by solving
More informationSection 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4.
Difference Equations to Differential Equations Section. The Sum of a Sequence This section considers the problem of adding together the terms of a sequence. Of course, this is a problem only if more than
More informationhttps://williamshartunionca.springboardonline.org/ebook/book/27e8f1b87a1c4555a1212b...
of 19 9/2/2014 12:09 PM Answers Teacher Copy Plan Pacing: 1 class period Chunking the Lesson Example A #1 Example B Example C #2 Check Your Understanding Lesson Practice Teach Bell-Ringer Activity Students
More informationHello, my name is Olga Michasova and I present the work The generalized model of economic growth with human capital accumulation.
Hello, my name is Olga Michasova and I present the work The generalized model of economic growth with human capital accumulation. 1 Without any doubts human capital is a key factor of economic growth because
More informationDIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents
DIFFERENTIABILITY OF COMPLEX FUNCTIONS Contents 1. Limit definition of a derivative 1 2. Holomorphic functions, the Cauchy-Riemann equations 3 3. Differentiability of real functions 5 4. A sufficient condition
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationMASSACHUSETTS 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 informationNo: 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 informationSeveral Views of Support Vector Machines
Several Views of Support Vector Machines Ryan M. Rifkin Honda Research Institute USA, Inc. Human Intention Understanding Group 2007 Tikhonov Regularization We are considering algorithms of the form min
More informationProperties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationFixed 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 information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationNumerical Matrix Analysis
Numerical Matrix Analysis Lecture Notes #10 Conditioning and / Peter Blomgren, blomgren.peter@gmail.com Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research
More informationAlgebra 2 Chapter 1 Vocabulary. identity - A statement that equates two equivalent expressions.
Chapter 1 Vocabulary identity - A statement that equates two equivalent expressions. verbal model- A word equation that represents a real-life problem. algebraic expression - An expression with variables.
More informationOPTIMAL 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 informationUnified Lecture # 4 Vectors
Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,
More informationChapter 4 One Dimensional Kinematics
Chapter 4 One Dimensional Kinematics 41 Introduction 1 4 Position, Time Interval, Displacement 41 Position 4 Time Interval 43 Displacement 43 Velocity 3 431 Average Velocity 3 433 Instantaneous Velocity
More informationContinuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
More informationLecture L3 - Vectors, Matrices and Coordinate Transformations
S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between
More informationUNIVERSITETET I OSLO
NIVERSITETET I OSLO Det matematisk-naturvitenskapelige fakultet Examination in: Trial exam Partial differential equations and Sobolev spaces I. Day of examination: November 18. 2009. Examination hours:
More informationRandom graphs with a given degree sequence
Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.
More informationBasic Op Amp Circuits
Basic Op Amp ircuits Manuel Toledo INEL 5205 Instrumentation August 3, 2008 Introduction The operational amplifier (op amp or OA for short) is perhaps the most important building block for the design of
More informationAdaptive Control Using Combined Online and Background Learning Neural Network
Adaptive Control Using Combined Online and Background Learning Neural Network Eric N. Johnson and Seung-Min Oh Abstract A new adaptive neural network (NN control concept is proposed with proof of stability
More informationThe Fourth International DERIVE-TI92/89 Conference Liverpool, U.K., 12-15 July 2000. Derive 5: The Easiest... Just Got Better!
The Fourth International DERIVE-TI9/89 Conference Liverpool, U.K., -5 July 000 Derive 5: The Easiest... Just Got Better! Michel Beaudin École de technologie supérieure 00, rue Notre-Dame Ouest Montréal
More informationThe 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 informationA QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS
A QUIK GUIDE TO THE FOMULAS OF MULTIVAIABLE ALULUS ontents 1. Analytic Geometry 2 1.1. Definition of a Vector 2 1.2. Scalar Product 2 1.3. Properties of the Scalar Product 2 1.4. Length and Unit Vectors
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationConstrained optimization.
ams/econ 11b supplementary notes ucsc Constrained optimization. c 2010, Yonatan Katznelson 1. Constraints In many of the optimization problems that arise in economics, there are restrictions on the values
More informationIntroduction to the Finite Element Method
Introduction to the Finite Element Method 09.06.2009 Outline Motivation Partial Differential Equations (PDEs) Finite Difference Method (FDM) Finite Element Method (FEM) References Motivation Figure: cross
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Chapter 1: Initial value problems in ODEs Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the Numerical
More informationOperation Count; Numerical Linear Algebra
10 Operation Count; Numerical Linear Algebra 10.1 Introduction Many computations are limited simply by the sheer number of required additions, multiplications, or function evaluations. If floating-point
More information