ACTIVE FAILURE DETECTION: AUXILIARY SIGNAL DESIGN AND ON-LINE DETECTION

Size: px
Start display at page:

Download "ACTIVE FAILURE DETECTION: AUXILIARY SIGNAL DESIGN AND ON-LINE DETECTION"

Transcription

1 ACTIVE FAILURE DETECTION: AUXILIARY SIGNAL DESIGN AND ON-LINE DETECTION R. Nikoukhah,S.L.Campbell INRIA, Rocquencourt BP 5, 7853 Le Chesna Cedex, France. fax: +( Department of Mathematics, North Carolina State Universit, Raleigh, NC , USA. fax: slc Kewords: Failure detection, Auxiliar Signal, Model Identification. Abstract This paper describes an active approach for model identification and failure detection in the presence of quadraticall bounded uncertaint. After developing the underling geometr, two particular examples of this approach involving static and continuous models are described. Several examples are given. Introduction There are two general approaches to failure detection and isolation. One is a passive approach adetector monitors input and outputs of the sstem and decides whether, and if possible what kind of, a failure has occurred. A passive approach is used for continuous monitoring. The detector has no wa of acting upon the sstem. In contrast, in an active approach the sstem is acted upon on a periodic basis or at critical times using a test signal (auxiliar signal to exhibit abnormal behaviors. The decision of whether or not the sstem has failed should be made b the end of the test period. The active approach has the advantages that it can sometimes detect failures that are not detectable during the normal operation of the sstem. This is especiall important for evaluating subsstem status before the subsstem s performance becomes crucial. An example would be evaluating the brakes Figure : General sstem structure. while moving but before a truck has to stop. An active approach also often permits quicker detection of afailure. Of course, it is usuall important that the test signal be small in some sense in order to not interfere with normal operation. In [2, 3, 4, 5] we have begun the investigation of amulti-model active approach for model identification and failure detection. These earlier papers have focused on the theor and computation for various special cases. As this work has progressed a general framework encompassing all of these cases and several additional ones has begun to become evident. This paper will discuss this general framework for the first time. 2 Geometr of the approach The structure of the active failure detection method considered here is described in Figure. The sstem is acted on b both a control input u and the auxiliar signal v. The sstem is subject to noise ν and there is an output. The information available for

2 A (v A (v Figure 2: No guaranteed detection. Figure 3: Increasing the magnitude of v. the decision is u, v,. The auxiliar signal v is precomputed and known while u, become available in real time during the test period. Thus u, cannot be used in the design of the detection filter. The can onl be used in its application. Failure detection is to be robust with respect to the noise ν. Itisassumed that the noise satisfies a quadratic bound. Depending on the quadratic form we will see that this includes both norm bounded noise and model uncertaint. The approach presented here can be applied to more than two models [2] but we focus here on the two model case. It is assumed that there are two possible models, Model andmodel. For a given auxiliar signal v we define A i (v to be the set of input-output pairs (u, consistent with Model i. That is, those pairs which are realiable b that model. Thus A (v: set of normal input-outputs. A (v: set of input-outputs when failure occurs. Failure detection consists of observing the inputs and outputs and deciding to which set the belong. For guaranteed detection we need that A (v A (v =. ( In this paper we focus on linear models of different tpes. Suppose that a given v does not give guaranteed detection. Then we have the situation in Figure 2. As we appl increasing amounts of v, the A i (v move in the direction of the arrows as indicated in Figure 3. If the A i (v are bounded in the appropriate directions, then we reach a multiple of v the A i (v are tangent as in Figure 4, and after that the are disjoint. Guaranteed detection occurs Figure 4: Guaranteed detection with minimal v. when the sets A i (v are disjoint or tangent. In Figures 2-4 the A i (v staed a constant sie and shape. We will see later that for some choices of noise measure that the A i (v can also grow as v sincreases. The goal then is to have an auxiliar signal v of the smallest possible sie and an easil computed function µ = h(u, so that the value of µ will tell us whether failure has occurred. Sections 3 and 4 develop the needed theor for one model. Section 5 then considers auxiliar signal design when there are two models. 3 Static Case It is instructive to consider first linear sstems in the static case. If one then thinks of the matrices as being operators this motivates a number of later developments. Absence of uncertaint: If we have no uncertaint the model is just = Gu (2

3 Figure 5: Additive uncertaint. Figure 6: Realiable set for Example. G is m n and 4 m. Forthesstem (2 we can use a residual-based test: u µ = T ( Gu =H (3 H = T ( G I. Realiabilit of {u, } is equivalent to µ being ero. Additive uncertaint: Amore realistic case is when we have additive uncertaint = G u + G 2 ν (4 G and G 2 are matrices. We assume G 2 is full row rank. The noise ν is assumed to satisf (here is the usual Euclidian norm: ν 2 <d. (5 as illustrated in Figure 5. Then {u, } will be realiable if there exists a ν satisfing (5 and (4. In order to construct a residual-based test to determine the realiabilit of a given {u, }, weconsider the optimiation problem: subject to γ(u, =min ν ν 2 (6 = G u + G 2 ν. (7 The function γ(u, provides the realiabilit test. If γ(u, <d,then{u, } is realiable. If γ(u, d,then{u, } is not realiable. We must express γ directl in terms of {u, }. The solution to the optimiation problem (6, (7 is γ(u, = ( u T ( G T I Thus if we let µ = H H T H = ( G T I (G2 G T 2 ( G I u. u H satisfies (G2 G T 2 ( G I, we have γ(u, = µ 2.Then the realiabilit test becomes µ 2 <d.if this test does not hold, then we have a failure. Example Consider the following simple example = u + ν, ν 2 <. The realiable set {u, } is given b γ(u, =( u 2 < and is illustrated in Figure 6. Slope uncertaint: Of course, in man applications there is uncertaint in the models themselves. To include this tpe of uncertaint we consider uncertaint in the following form which follows the formulation of [6]: =(G + G 2 (I G 22 G 2 u (8

4 J = I, (7 I and {v, } satisf ( and (2 for given {u, }. These constraints can be expressed as: u ν G = G 2 (8 Figure 7: Model uncertaint. is an matrix whose maximum singular value σ satisfies Note that (8 is a perturbation of σ(. (9 = G u. ( This corresponds to modeling an uncertain gain as shown in Figure 7. The sstem of Figure 7 can be re-expressed as with = G u + G 2 ν ( = G 2 u + G 22 ν (2 ν =. (3 Note that combining (3 with (2 we get ν = (G 2 u + G 22 ν (4 Solving for ν and substituting into ( gives (8. Since (9 holds, we get from (3 that ν 2 2. Thus the characteriation of realiabilit is ν 2 2. (5 To get this in terms of just {u, } we again set up an optimiation problem. Let γ(u, =min ν, T ν J ν (6 G = G I G2, G G 2 2 =.(9 G 22 I Let A be a matrix of maximal full column rank such that AA =.Thatis,A is a maximal rank right annihilator. Then the solution of the above optimiation problem is as follows. Suppose G 2 JG T 2 >. (2 Then the solution to optimiation problem (6 is γ(u, = T u u G T (G 2 JG T 2 G. (2 Example 2 Suppose that (8 is =(+ u (22 with. From (8, it is eas to see that we can take G 22 =and G = G 2 = G 2 =.Thus G =, G 2 =. (23 H can be obtained using the J-spectral factoriation. It is eas to verif that (G 2 JG T 2 = J so that we can let H = G,that is, µ = ( u u The realiabilit test (2 then becomes. (24 γ(u, =µ T Jµ = 2 2u. (25 To see wh this inequalit is correct, simpl note that 2 2u = u 2 ( 2. This inequalit defines the set of realiable {u, } and is illustrated in Figure 8.

5 Figure 9: Realiable set for Example 3. Figure 8: Realiable set for Example 2. Note that in Figure 6 the set of s for a given u stas the same sie while the set varies in sie with u in Figure 8. A similar behavior occurs when designing auxiliar signals later in this paper. The A i (v are fixed sie with additive uncertaint and var in sie with model uncertaint. General uncertaint model: In order to capture both additive and slope uncertainties we consider the more general model u ν G = G 2 (26 with G 2 full row rank and with the noise constraint, T ν J ν <d (27 J = diag(i, I. Thisisalinear model with a quadratic criteria on the possible noises and perturbations. Example 3 Consider the following sstem u ν = with ( ν ν 2 T ( ( ν ν 2 ν 2 (28 <. (29 This sstem is closel related to Example 2. The realiable set is defined b γ(u, = 2 2u < and is illustrated in Figure 9. 4 Dnamical sstems Continuous and discrete sstems are of interest but space allows us onl to consider the continuous case. Our approach builds on the formulations in [6]. The static case just discussed leads to the following uncertain dnamical sstem modeled over [,T]: ẋ = Ax + Bu + Mν, (3 = Gx + Hu, (3 = Cx + Du + Nν (32 ν and are respectivel the noise input and noise output representing model uncertaint. N is full row rank. The constraints on the noises are: x( T P x( + s ν 2 2 dt<d, s [,T]. (33 which is the continuous analogue of (5. No weights on ν, are needed since the can be incorporated into the model coefficients. This formulation includes both additive uncertaint and model uncertaint.

6 For example, as shown in [6] the uncertain sstem (3, (3 can be used to model ẋ = (A + M Gx +(B + M Hu, = (C + N Gx +(D + N Hu σ( (t x( T P x( <d B formulating as an optimiation problem, we obtain the realiabilit test γ s (u, <d, for all s [,T] (34 γ s (u, = s µ T R µdt (35 and µ is the output of the following sstem ˆx = (A SR C PC T R Cˆx +(S + P C Du T R + Bu Hu µ = C Du ˆx Hu with ˆx( = x. P is the solution of the Riccati equation P = (A SR CP + P (A SR C T P C T R CP + Q SR S T,P( = P Q = MM T,S= ( MN T MJ T NN T NJ R = T C JN T, C =. I G We also assume that N T (I J T JN >, t [,T]. 5 Auxiliar signal design The discussion so far has onl addressed how to characterie realiabilit when there is one model present. We now consider the situation there are two models and an auxiliar signal v which is to be constructed to aid in identification. We again begin b considering the static case. 5. Static case Let v be the auxiliar input. Suppose that there are two models. B using ν to represent ν and,andb breaking up the input u into two inputs u and v, we get v Xi Y i Z i u = H i ν i (36 with the constraints, ν T i J i ν i <, (37 for i =,. Thecase i =corresponds to the unfailed sstem and i =,the failed sstem. Here J is asignature matrix (diagonal matrix with + and entries. Vectors u and are the on-line measured input and output as before. We wantatestsignalv that not onl permits perfect identification ( but also is small in some sense. If the minimiation is on the norm of v, our problem becomes that of finding a v of smallest norm for which there exist no solution to (36 and (37, for i =and simultaneousl. Example 4 Consider the following simple sstems: and 4v + = ν (38 ν 2 < (39 v + = ν (4 ν T ν <. (4 Figure shows the input-output sets and the minimal v that provides perfect identification. Non-existence of a solution to (36 and (37 is equivalent to: σ(v = σ(v (42 inf ν,ν,u, max(νt J ν,ν T J ν (43

7 So the optimiation problem (46 can be expressed as follows: subject to φ (v =inf ν νt J ν (48 Gv = Hν (49 Figure : Realiable sets for Example 4 and minimal v. subject to (36, i =,. Itcan be shown that σ(v in (43 can be expressed as: σ(v = max inf ν,ν,u, (νt J ν +( ν T J ν [,] subject to ( X Y Z v u H = X Y Z H ( ν ν. (44 The optimiation problem (43 can then now be expressed as follows: φ (v = σ(v =max φ (v (45 min ν,ν,u, (νt J ν +( ν T J ν (46 subject to (44. Since u and appear onl in the constraint (44, we can eliminate them from the optimiation problem b premultipling (44 with Y Z W W = (47 Y Z A is a maximal rank left annihilator of A. G = X W W, X H = ( H W W ν = ( ν ν,j =, H ( J ( J. Proper auxiliar signal and the separabilit index: An auxiliar signal v is proper if the two realiable sets A (v and A (v are disjoint. Thus an auxiliar signal v is proper if and onl if σ(v. Let V denote the set of proper auxiliar signals v. Suppose that v is measured in an inner product norm so there exists a positive definite matrix Q such that the norm of v is (v T Qv /2.Then γ = 2 min v V vt Qv, (5 is called the separabilit index for positive definite matrix Q. Thev realiing the min is called an optimal proper auxiliar signal. Using the fact that σ(v is quadratic in v,the problem of finding an optimal auxiliar signal can be formulated as follows: = max v σ(v v T Qv = = max v, [,] max φ (v v, [,] v T Qv v T V v v T Qv for some smmetric matrix V. here that H T J H >. Let = max v (5 We are assuming v T V v v T Qv. (52

8 Then clearl = max. But is the largest such that v T V v v T Qv =. (53 So if >, then the set of proper auxiliar signals is not empt and an optimal proper auxiliar signal is a solution of (53 satisfing v T Qv =. (54 If, then the set of proper auxiliar signals is empt. If >,then the separabilit index is given b γ =. (55 Example 5 For Example 4, φ (v is: inf ν,ν,ν ν ν ν T subject to 4 v = ν ν ( ν ν ν. ν We can show that φ (v is defined for all [, ] and is given b φ (v = (9 ( v 2. So σ(v = max [,] φ (v can easil be computed in this case b setting the derivative of φ (v with respect to to ero to get = 5/9. This gives σ(v = 6 9 v2 and thus v =3/4. Alternative solution: Instead of performing two optimiations, we can combine them to have a one step solution. Suppose that H T J H >. Then corresponds to the largest such that Computing det(hj HT GG T =. (56 = max (57 [a,b] a proper auxiliar signal exists if and onl if >. Then an optimal auxiliar signal is v = Kζ (58 K = G l HJ HT,G l is an left-inverse of G, ζ = αζ ζ is an non-ero vector satisfing ( HJ H T GG T ζ = (59 is a value of maximiing in (57, and α = 5.2 Continuous-time case ζ T K T QKζ. (6 B using ν to represent ν and, andb breaking up the input u into two inputs u and v, weobtain the following models: ẋ i = A i x i + B i v + B i u + M i ν i, (6 E i = C i x i + D i v + D i u + N i ν i (62 i =, correspond to normal and failed sstems. N i s are assumed to have full row rank. The noise constraints are S i (v, s = x i ( T P i x i( s + νi T J i ν i dt <, s [,T], (63 the J i s are signature matrices. Non-existence of a solution to (6, (62 and (63 is equivalent to: σ(v, s (64 σ(v, s = inf max(s ν,ν,u, (v, s, S (v, s, (65 x,x subject to (6-(62, i =,. Asinthe static case, we can reformulate (65 as: φ (v, s = σ(v, s = max [,] φ (v, s (66 inf ν,ν,u, x,x S (v, s+( S (v, s

9 subject to (6-(62, i =,. We consider here onl the case there is no u. That is, all the inputs are used as an auxiliar signal for failure detection. Let x ν A x =,ν=,a=, x ν A M M =,N= F M N F N, D = F D + F D,C = ( F C F C, B = ( B B P,P, = ( P,, J J =, ( J E F F =. E Then we can reformulate the problem (65 as: T φ (v, s =inf ν,x x(t P x( + ν T J νdt subject to ẋ = Ax + Bv + Mν = Cx + Dv + Nν. Construction of an optimal proper auxiliar signal: For the sake of simplicit of presentation, we start b considering that the optimalit criterion used for the auxiliar signal is just that of minimiing its L 2 norm. Thus the problem to solve is: min v v 2, subject to max v 2 = T [,] s [,T ] v 2 dt. φ (v, s (67 The reason we take the max over s is that the maximum value of φ (v, s does not alwas occur at s = T.Itdoes in most cases though. As we did in the static case, we reformulate the optimiation problem as follows,s = max v φ (v, s v 2. (68 Suppose for some [, ], that we have N T J N >, t [,T], and that the Riccati equation P = (A SR CP + P (A SR C T PC T R CP + Q SR S T, P( = P Q S S T = R M J N T M (69 N has a solution on [,T]. The values of Q, S, R depend on. Then,s is the smallest for which the Riccati equation P = (A S R CP + P (A S R CT PC T R CP + Q S R ST,P( = P ( Q S M B J M B = N D I N D S T R has a solution on [,s]. The values of Q,S,R depend on as well as. This result allows us to compute = max,s s which can be used to compute = max. This gives the separabilit index as γ =. and is used to compute the optimal auxiliar signal v. Construction of optimal auxiliar signal: Assume (an optimal and are computed. Let (x, ζ T

10 specifictpes of problems. In this approach the auxiliar signal design is done off line. It eas to implement the algorithms in Scilab [] or other CAD packages. The on-line detection test can be implemented efficientl using Kalman tpe filters or hperplane tests but space does not permit discussing this here. Acknowledgements Figure : Tpical minimum proper v. be an non-ero solution of the two-point boundarvalue sstem: d x Ω Ω = 2 x dt ζ Ω 2 Ω 22 ζ with boundar conditions: x( = P ζ( ζ(t =. Ω = Ω T 22 = A S R C Ω 2 = Q S R S T Ω 2 = C T R C This boundar value problem is not well-posed and has non trivial solutions (x,ζ.anoptimal auxiliar signal is (for simplicit suppose D = v = αb T ζ α is a constant such that v =/γ. A tpical auxiliar signal is given in Figure. The shape of the v can var depending on the models, the sie of the weight on the initial condition perturbation, and the length of the interval. Several more examples are in [2] and the other references. Research supported in part b the National Science Foundation under DMS-82, ECS-495 and INT References [] C. Bunks, J. P. Chancelier, F. Delebecque, C. Gome (Editor, M. Goursat, R. Nikoukhah, and S. Steer. Engineering and scientific computing with Scilab, Birkhauser, 999. [2] S. L. Campbell, K. Horton, R. Nikoukhah, F. Delebecque. Auxiliar signal design for rapid multimodel identification using optimiation, Automatica, toappear. [3] R. Nikoukhah. Guaranteed active failure detection and isolation for linear dnamical sstems, Automatica, 34, pp , (998. [4] R. Nikoukhah, S. L. Campbell, F. Delebecque. Detection signal design for failure detection: a robust approach, Int. J. Adaptive Control and Signal Processing, 4, pp , (2. [5] R. Nikoukhah, S. L. Campbell, K. Horton, F. Delebecque. Auxiliar signal design for robust multi-model identification, IEEE Trans. Automatic Control, 47, pp , (22. [6] I.R. Petersen, A.V. Savkin, Robust Kalman filtering for signals and sstems with large uncertainties, Birkhauser, Conclusion We have described a framework for multi-model identification and shown the form it takes for two

Auxiliary signal design for failure detection in uncertain systems

Auxiliary signal design for failure detection in uncertain systems Auxiliary signal design for failure detection in uncertain systems R. Nikoukhah, S. L. Campbell and F. Delebecque Abstract An auxiliary signal is an input signal that enhances the identifiability of a

More information

The Design of Auxiliary Signals for Robust Active Failure Detection in Uncertain Systems

The Design of Auxiliary Signals for Robust Active Failure Detection in Uncertain Systems The Design of Auxiliary Signals for Robust Active Failure Detection in Uncertain Systems Stephen L. Campbell Ramine Nikoukhah Department of Mathematics INRIA North Carolina State University Rocquencourt

More information

A NUMERICAL METHOD TO SOLVE A QUADRATIC CONSTRAINED MAXIMIZATION

A NUMERICAL METHOD TO SOLVE A QUADRATIC CONSTRAINED MAXIMIZATION A NUMERICAL METHOD TO SOLVE A QUADRATIC CONSTRAINED MAXIMIZATION ALIREZA ESNA ASHARI, RAMINE NIKOUKHAH, AND STEPHEN L. CAMPBELL Abstract. The problem of maximizing a quadratic function subject to an ellipsoidal

More information

Stability Analysis for Linear Systems under State Constraints

Stability Analysis for Linear Systems under State Constraints Stabilit Analsis for Linear Sstems under State Constraints Haijun Fang Abstract This paper revisits the problem of stabilit analsis for linear sstems under state constraints New and less conservative sufficient

More information

Week 3 September 5-7.

Week 3 September 5-7. MA322 Weekl topics and quiz preparations Week 3 September 5-7. Topics These are alread partl covered in lectures. We collect the details for convenience.. Solutions of homogeneous equations AX =. 2. Using

More information

Robust Nash Equilibria and Second-Order Cone Complementarity Problems

Robust Nash Equilibria and Second-Order Cone Complementarity Problems Robust Nash Equilibria and Second-Order Cone Complementarit Problems Shunsuke Haashi, Nobuo Yamashita, Masao Fukushima Department of Applied Mathematics and Phsics, Graduate School of Informatics, Koto

More information

PICONE S IDENTITY FOR A SYSTEM OF FIRST-ORDER NONLINEAR PARTIAL DIFFERENTIAL EQUATIONS

PICONE S IDENTITY FOR A SYSTEM OF FIRST-ORDER NONLINEAR PARTIAL DIFFERENTIAL EQUATIONS Electronic Journal of Differential Equations, Vol. 2013 (2013), No. 143, pp. 1 7. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu PICONE S IDENTITY

More information

z = 1 2 x 3 4 y + 3 y dt

z = 1 2 x 3 4 y + 3 y dt Exact First Order Differential Equations This Lecture covers material in Section 2.6. A first order differential equations is exact if it can be written in the form M(x, ) + N(x, ) d dx = 0, where M =

More information

Demonstrate solution methods for systems of linear equations. Show that a system of equations can be represented in matrix-vector form.

Demonstrate solution methods for systems of linear equations. Show that a system of equations can be represented in matrix-vector form. Chapter Linear lgebra Objective Demonstrate solution methods for sstems of linear equations. Show that a sstem of equations can be represented in matri-vector form. 4 Flowrates in kmol/hr Figure.: Two

More information

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures AB = BA = I,

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures AB = BA = I, FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 7 MATRICES II Inverse of a matri Sstems of linear equations Solution of sets of linear equations elimination methods 4

More information

Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013

Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013 Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013 Abstract As in optimal control theory, linear quadratic (LQ) differential games (DG) can be solved, even in high dimension,

More information

Active incipient fault detection with more than two simultaneous faults

Active incipient fault detection with more than two simultaneous faults Proceedings of the 29 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 29 Active incipient fault detection with more than two simultaneous faults Martene Fair

More information

Two Dimensional Linear Systems of ODEs

Two Dimensional Linear Systems of ODEs 34 CHAPTER 3 Two Dimensional Linear Sstems of ODEs A first-der, autonomous, homogeneous linear sstem of two ODEs has the fm x t ax + b, t cx + d where a, b, c, d are real constants The matrix fm is 31

More information

Linear programming: Theory

Linear programming: Theory Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analsis and Economic Theor Winter 2018 Topic 28: Linear programming: Theor 28.1 The saddlepoint theorem for linear programming The

More information

EXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1)

EXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1) EXERCISE SET 5. 6. The pair (, 2) is in the set but the pair ( )(, 2) = (, 2) is not because the first component is negative; hence Axiom 6 fails. Axiom 5 also fails. 8. Axioms, 2, 3, 6, 9, and are easily

More information

Math 181/281. Rumbos Spring 2011 Page 1. Solutions to Assignment #5. Hence, the dynamical system, θ(t, p, q), for (t, p, q) R 3 corresponding = F.

Math 181/281. Rumbos Spring 2011 Page 1. Solutions to Assignment #5. Hence, the dynamical system, θ(t, p, q), for (t, p, q) R 3 corresponding = F. Math 181/281. Rumbos Spring 2011 Page 1 Solutions to Assignment #5 1. For real numbers a and b with a 2 + b 2 = 0, let F : R 2 R 2 be given b ( ) ( ) ( ) x ax b x F =, for all R 2. (1) bx + a (a) Explain

More information

Graph the linear system and estimate the solution. Then check the solution algebraically.

Graph the linear system and estimate the solution. Then check the solution algebraically. (Chapters and ) A. Linear Sstems (pp. 6 0). Solve a Sstem b Graphing Vocabular Solution For a sstem of linear equations in two variables, an ordered pair (x, ) that satisfies each equation. Consistent

More information

State Estimation with Nonlinear Inequality Constraints Based on Unscented Transformation

State Estimation with Nonlinear Inequality Constraints Based on Unscented Transformation 14th International Conference on Information Fusion Chicago, Illinois, USA, Jul 5-8, 2011 State Estimation with Nonlinear Inequalit Constraints Based on Unscented Transformation Jian Lan Center for Information

More information

Lecture 2: Separable Ordinary Differential Equations

Lecture 2: Separable Ordinary Differential Equations Lecture : Separable Ordinar Differential Equations Dr. Michael Doughert Januar 8, 00 Some Terminolog: ODE s, PDE s, IVP s The differential equations we have looked at so far are called ordinar differential

More information

Linear Quadratic Zero-Sum Two-Person Differential Games

Linear Quadratic Zero-Sum Two-Person Differential Games Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard To cite this version: Pierre Bernhard. Linear Quadratic Zero-Sum Two-Person Differential Games. Encyclopaedia of Systems and Control,

More information

Engineering Mathematics I

Engineering Mathematics I Engineering Mathematics I_ 017 Engineering Mathematics I 1. Introduction to Differential Equations Dr. Rami Zakaria Terminolog Differential Equation Ordinar Differential Equations Partial Differential

More information

5 Linear Algebra and Inverse Problem

5 Linear Algebra and Inverse Problem 5 Linear Algebra and Inverse Problem 5.1 Introduction Direct problem ( Forward problem) is to find field quantities satisfying Governing equations, Boundary conditions, Initial conditions. The direct problem

More information

Discontinuous Galerkin method for a class of elliptic multi-scale problems

Discontinuous Galerkin method for a class of elliptic multi-scale problems INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS Int. J. Numer. Meth. Fluids 000; 00: 6 [Version: 00/09/8 v.0] Discontinuous Galerkin method for a class of elliptic multi-scale problems Ling Yuan

More information

Chapter 5: Systems of Equations

Chapter 5: Systems of Equations Chapter : Sstems of Equations Section.: Sstems in Two Variables... 0 Section. Eercises... 9 Section.: Sstems in Three Variables... Section. Eercises... Section.: Linear Inequalities... Section.: Eercises.

More information

Outline. Linear Matrix Inequalities and Robust Control. Outline. Time-Invariant Parametric Uncertainty. Robust stability analysis

Outline. Linear Matrix Inequalities and Robust Control. Outline. Time-Invariant Parametric Uncertainty. Robust stability analysis Outline Linear Matrix Inequalities and Robust Control Carsten Scherer and Siep Weiland 7th Elgersburg School on Mathematical Sstems Theor Class 4 version March 6, 2015 1 Robust Stabilit Against Uncertainties

More information

Eigenvectors and Eigenvalues 1

Eigenvectors and Eigenvalues 1 Ma 2015 page 1 Eigenvectors and Eigenvalues 1 In this handout, we will eplore eigenvectors and eigenvalues. We will begin with an eploration, then provide some direct eplanation and worked eamples, and

More information

Equations of lines in

Equations of lines in Roberto s Notes on Linear Algebra Chapter 6: Lines, planes an other straight objects Section 1 Equations of lines in What ou nee to know alrea: The ot prouct. The corresponence between equations an graphs.

More information

plant-friendly auxiliary detection signals at the cost of a moderate increase in computational

plant-friendly auxiliary detection signals at the cost of a moderate increase in computational Abstract CHOE, DONGKYOUNG. Digital Signal Design for Fault Detection in Linear Continuous Dynamical Systems. (Under the direction of Dr. Stephen L. Campbell.) A systematic approach to detect underlying

More information

10.3 Solving Nonlinear Systems of Equations

10.3 Solving Nonlinear Systems of Equations 60 CHAPTER 0 Conic Sections Identif whether each equation, when graphed, will be a parabola, circle, ellipse, or hperbola. Then graph each equation.. - 7 + - =. = +. = + + 6. + 9 =. 9-9 = 6. 6 - = 7. 6

More information

The Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications

The Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications MAX PLANCK INSTITUTE Elgersburg Workshop Elgersburg February 11-14, 2013 The Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications Timo Reis 1 Matthias Voigt 2 1 Department

More information

BACKWARD FOKKER-PLANCK EQUATION FOR DETERMINATION OF MODEL PREDICTABILITY WITH UNCERTAIN INITIAL ERRORS

BACKWARD FOKKER-PLANCK EQUATION FOR DETERMINATION OF MODEL PREDICTABILITY WITH UNCERTAIN INITIAL ERRORS BACKWARD FOKKER-PLANCK EQUATION FOR DETERMINATION OF MODEL PREDICTABILITY WITH UNCERTAIN INITIAL ERRORS. INTRODUCTION It is widel recognized that uncertaint in atmospheric and oceanic models can be traced

More information

Controlling Human Heart Rate Response During Treadmill Exercise

Controlling Human Heart Rate Response During Treadmill Exercise Controlling Human Heart Rate Response During Treadmill Exercise Frédéric Mazenc (INRIA-DISCO), Michael Malisoff (LSU), and Marcio de Queiroz (LSU) Special Session: Advances in Biomedical Mathematics 2011

More information

Math 369 Exam #1 Practice Problems

Math 369 Exam #1 Practice Problems Math 69 Exam # Practice Problems Find the set of solutions of the following sstem of linear equations Show enough work to make our steps clear x + + z + 4w x 4z 6w x + 5 + 7z + w Answer: We solve b forming

More information

I. D. Landau, A. Karimi: A Course on Adaptive Control Adaptive Control. Part 9: Adaptive Control with Multiple Models and Switching

I. D. Landau, A. Karimi: A Course on Adaptive Control Adaptive Control. Part 9: Adaptive Control with Multiple Models and Switching I. D. Landau, A. Karimi: A Course on Adaptive Control - 5 1 Adaptive Control Part 9: Adaptive Control with Multiple Models and Switching I. D. Landau, A. Karimi: A Course on Adaptive Control - 5 2 Outline

More information

UNCORRECTED SAMPLE PAGES. 3Quadratics. Chapter 3. Objectives

UNCORRECTED SAMPLE PAGES. 3Quadratics. Chapter 3. Objectives Chapter 3 3Quadratics Objectives To recognise and sketch the graphs of quadratic polnomials. To find the ke features of the graph of a quadratic polnomial: ais intercepts, turning point and ais of smmetr.

More information

In applications, we encounter many constrained optimization problems. Examples Basis pursuit: exact sparse recovery problem

In applications, we encounter many constrained optimization problems. Examples Basis pursuit: exact sparse recovery problem 1 Conve Analsis Main references: Vandenberghe UCLA): EECS236C - Optimiation methods for large scale sstems, http://www.seas.ucla.edu/ vandenbe/ee236c.html Parikh and Bod, Proimal algorithms, slides and

More information

Discrete-Time H Gaussian Filter

Discrete-Time H Gaussian Filter Proceedings of the 17th World Congress The International Federation of Automatic Control Discrete-Time H Gaussian Filter Ali Tahmasebi and Xiang Chen Department of Electrical and Computer Engineering,

More information

INRIA Rocquencourt, Le Chesnay Cedex (France) y Dept. of Mathematics, North Carolina State University, Raleigh NC USA

INRIA Rocquencourt, Le Chesnay Cedex (France) y Dept. of Mathematics, North Carolina State University, Raleigh NC USA Nonlinear Observer Design using Implicit System Descriptions D. von Wissel, R. Nikoukhah, S. L. Campbell y and F. Delebecque INRIA Rocquencourt, 78 Le Chesnay Cedex (France) y Dept. of Mathematics, North

More information

DEVELOPMENT AND USE OF OPERATIONAL MODAL ANALYSIS

DEVELOPMENT AND USE OF OPERATIONAL MODAL ANALYSIS Università degli Studi di Napoli Federico II DEVELOPMENT AND USE OF OPERATIONAL MODAL ANALYSIS Examples of Civil, Aeronautical and Acoustical Applications Francesco Marulo Tiziano Polito francesco.marulo@unina.it

More information

For each problem, place the letter choice of your answer in the spaces provided on this page.

For each problem, place the letter choice of your answer in the spaces provided on this page. Math 6 Final Exam Spring 6 Your name Directions: For each problem, place the letter choice of our answer in the spaces provided on this page...... 6. 7. 8. 9....... 6. 7. 8. 9....... B signing here, I

More information

only nite eigenvalues. This is an extension of earlier results from [2]. Then we concentrate on the Riccati equation appearing in H 2 and linear quadr

only nite eigenvalues. This is an extension of earlier results from [2]. Then we concentrate on the Riccati equation appearing in H 2 and linear quadr The discrete algebraic Riccati equation and linear matrix inequality nton. Stoorvogel y Department of Mathematics and Computing Science Eindhoven Univ. of Technology P.O. ox 53, 56 M Eindhoven The Netherlands

More information

Introduction to Differential Equations. National Chiao Tung University Chun-Jen Tsai 9/14/2011

Introduction to Differential Equations. National Chiao Tung University Chun-Jen Tsai 9/14/2011 Introduction to Differential Equations National Chiao Tung Universit Chun-Jen Tsai 9/14/011 Differential Equations Definition: An equation containing the derivatives of one or more dependent variables,

More information

1 HOMOGENEOUS TRANSFORMATIONS

1 HOMOGENEOUS TRANSFORMATIONS HOMOGENEOUS TRANSFORMATIONS Purpose: The purpose of this chapter is to introduce ou to the Homogeneous Transformation. This simple 4 4 transformation is used in the geometr engines of CAD sstems and in

More information

Development of an Extended Operational States Observer of a Power Assist Wheelchair

Development of an Extended Operational States Observer of a Power Assist Wheelchair Development of an Extended Operational States Observer of a Power Assist Wheelchair Sehoon Oh Institute of Industrial Science Universit of Toko 4-6-, Komaba, Meguro, Toko, 53-855 Japan sehoon@horilab.iis.u-toko.ac.jp

More information

Affine Hybrid Systems

Affine Hybrid Systems Affine Hbrid Sstems Aaron D Ames and Shankar Sastr Universit of California, Berkele CA 9472, USA {adames,sastr}@eecsberkeleedu Abstract Affine hbrid sstems are hbrid sstems in which the discrete domains

More information

Prediction, filtering and smoothing using LSCR: State estimation algorithms with guaranteed confidence sets

Prediction, filtering and smoothing using LSCR: State estimation algorithms with guaranteed confidence sets 2 5th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC) Orlando, FL, USA, December 2-5, 2 Prediction, filtering and smoothing using LSCR: State estimation algorithms with

More information

1 Continuous-time Systems

1 Continuous-time Systems Observability Completely controllable systems can be restructured by means of state feedback to have many desirable properties. But what if the state is not available for feedback? What if only the output

More information

Determinants. We said in Section 3.3 that a 2 2 matrix a b. Determinant of an n n Matrix

Determinants. We said in Section 3.3 that a 2 2 matrix a b. Determinant of an n n Matrix 3.6 Determinants We said in Section 3.3 that a 2 2 matri a b is invertible if and onl if its c d erminant, ad bc, is nonzero, and we saw the erminant used in the formula for the inverse of a 2 2 matri.

More information

AM 205: lecture 8. Last time: Cholesky factorization, QR factorization Today: how to compute the QR factorization, the Singular Value Decomposition

AM 205: lecture 8. Last time: Cholesky factorization, QR factorization Today: how to compute the QR factorization, the Singular Value Decomposition AM 205: lecture 8 Last time: Cholesky factorization, QR factorization Today: how to compute the QR factorization, the Singular Value Decomposition QR Factorization A matrix A R m n, m n, can be factorized

More information

Systems of Linear and Quadratic Equations. Check Skills You ll Need. y x. Solve by Graphing. Solve the following system by graphing.

Systems of Linear and Quadratic Equations. Check Skills You ll Need. y x. Solve by Graphing. Solve the following system by graphing. NY- Learning Standards for Mathematics A.A. Solve a sstem of one linear and one quadratic equation in two variables, where onl factoring is required. A.G.9 Solve sstems of linear and quadratic equations

More information

Perturbation theory for eigenvalues of Hermitian pencils. Christian Mehl Institut für Mathematik TU Berlin, Germany. 9th Elgersburg Workshop

Perturbation theory for eigenvalues of Hermitian pencils. Christian Mehl Institut für Mathematik TU Berlin, Germany. 9th Elgersburg Workshop Perturbation theory for eigenvalues of Hermitian pencils Christian Mehl Institut für Mathematik TU Berlin, Germany 9th Elgersburg Workshop Elgersburg, March 3, 2014 joint work with Shreemayee Bora, Michael

More information

1. First-order ODE s

1. First-order ODE s 18.03 EXERCISES 1. First-order ODE s 1A. Introduction; Separation of Variables 1A-1. Verif that each of the following ODE s has the indicated solutions (c i,a are constants): a) 2 + = 0, = c 1 e x +c 2

More information

FIR Filters for Stationary State Space Signal Models

FIR Filters for Stationary State Space Signal Models Proceedings of the 17th World Congress The International Federation of Automatic Control FIR Filters for Stationary State Space Signal Models Jung Hun Park Wook Hyun Kwon School of Electrical Engineering

More information

ESMF Based Multiple UAVs Active Cooperative Observation Method in Relative Velocity Coordinates

ESMF Based Multiple UAVs Active Cooperative Observation Method in Relative Velocity Coordinates Joint 48th IEEE Conference on Decision and Control and 8th Chinese Control Conference Shanghai, P.R. China, December 6-8, 009 WeCIn5.4 ESMF Based Multiple UAVs Active Cooperative Observation Method in

More information

QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS

QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS Journal of the Operations Research Societ of Japan 008, Vol. 51, No., 191-01 QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS Tomonari Kitahara Shinji Mizuno Kazuhide Nakata Toko Institute of Technolog

More information

Marcinkiewicz Interpolation Theorem by Daniel Baczkowski

Marcinkiewicz Interpolation Theorem by Daniel Baczkowski 1 Introduction Marcinkiewicz Interpolation Theorem b Daniel Baczkowski Let (, µ be a measure space. Let M denote the collection of all extended real valued µ-measurable functions on. Also, let M denote

More information

Vectors Primer. M.C. Simani. July 7, 2007

Vectors Primer. M.C. Simani. July 7, 2007 Vectors Primer M.. Simani Jul 7, 2007 This note gives a short introduction to the concept of vector and summarizes the basic properties of vectors. Reference textbook: Universit Phsics, Young and Freedman,

More information

IMPLEMENTATION OF CONTINUOUS-TIME DYNAMICS IN SCICOS. Masoud Najafi Azzedine Azil Ramine Nikoukhah

IMPLEMENTATION OF CONTINUOUS-TIME DYNAMICS IN SCICOS. Masoud Najafi Azzedine Azil Ramine Nikoukhah IMPLEMENTATION OF CONTINUOUS-TIME DYNAMICS IN SCICOS Masoud Najafi Azzedine Azil Ramine Nikoukhah INRIA, Rocquencourt, BP 05, 7853 Le Chesnay cedex, France KEYWORDS: Hybrid systems, Synchronous language,

More information

Mathematics 309 Conic sections and their applicationsn. Chapter 2. Quadric figures. ai,j x i x j + b i x i + c =0. 1. Coordinate changes

Mathematics 309 Conic sections and their applicationsn. Chapter 2. Quadric figures. ai,j x i x j + b i x i + c =0. 1. Coordinate changes Mathematics 309 Conic sections and their applicationsn Chapter 2. Quadric figures In this chapter want to outline quickl how to decide what figure associated in 2D and 3D to quadratic equations look like.

More information

Semidefinite Programming Duality and Linear Time-invariant Systems

Semidefinite Programming Duality and Linear Time-invariant Systems Semidefinite Programming Duality and Linear Time-invariant Systems Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 2 July 2004 Workshop on Linear Matrix Inequalities in Control LAAS-CNRS,

More information

MEMS Gyroscope Control Systems for Direct Angle Measurements

MEMS Gyroscope Control Systems for Direct Angle Measurements MEMS Gyroscope Control Systems for Direct Angle Measurements Chien-Yu Chi Mechanical Engineering National Chiao Tung University Hsin-Chu, Taiwan (R.O.C.) 3 Email: chienyu.me93g@nctu.edu.tw Tsung-Lin Chen

More information

IV. Matrix Approximation using Least-Squares

IV. Matrix Approximation using Least-Squares IV. Matrix Approximation using Least-Squares The SVD and Matrix Approximation We begin with the following fundamental question. Let A be an M N matrix with rank R. What is the closest matrix to A that

More information

The Important State Coordinates of a Nonlinear System

The Important State Coordinates of a Nonlinear System The Important State Coordinates of a Nonlinear System Arthur J. Krener 1 University of California, Davis, CA and Naval Postgraduate School, Monterey, CA ajkrener@ucdavis.edu Summary. We offer an alternative

More information

Denis ARZELIER arzelier

Denis ARZELIER   arzelier COURSE ON LMI OPTIMIZATION WITH APPLICATIONS IN CONTROL PART II.2 LMIs IN SYSTEMS CONTROL STATE-SPACE METHODS PERFORMANCE ANALYSIS and SYNTHESIS Denis ARZELIER www.laas.fr/ arzelier arzelier@laas.fr 15

More information

Laurie s Notes. Overview of Section 3.5

Laurie s Notes. Overview of Section 3.5 Overview of Section.5 Introduction Sstems of linear equations were solved in Algebra using substitution, elimination, and graphing. These same techniques are applied to nonlinear sstems in this lesson.

More information

APPROXIMATE SOLUTION OF A SYSTEM OF LINEAR EQUATIONS WITH RANDOM PERTURBATIONS

APPROXIMATE SOLUTION OF A SYSTEM OF LINEAR EQUATIONS WITH RANDOM PERTURBATIONS APPROXIMATE SOLUTION OF A SYSTEM OF LINEAR EQUATIONS WITH RANDOM PERTURBATIONS P. Date paresh.date@brunel.ac.uk Center for Analysis of Risk and Optimisation Modelling Applications, Department of Mathematical

More information

9 11 Solve the initial-value problem Evaluate the integral. 1. y sin 3 x cos 2 x dx. calculation. 1 + i i23

9 11 Solve the initial-value problem Evaluate the integral. 1. y sin 3 x cos 2 x dx. calculation. 1 + i i23 Mock Exam 1 5 8 Solve the differential equation. 7. d dt te t s1 Mock Exam 9 11 Solve the initial-value problem. 9. x ln x, 1 3 6 Match the differential equation with its direction field (labeled I IV).

More information

New Lyapunov Krasovskii functionals for stability of linear retarded and neutral type systems

New Lyapunov Krasovskii functionals for stability of linear retarded and neutral type systems Systems & Control Letters 43 (21 39 319 www.elsevier.com/locate/sysconle New Lyapunov Krasovskii functionals for stability of linear retarded and neutral type systems E. Fridman Department of Electrical

More information

Algebra 2 Semester Exam Review

Algebra 2 Semester Exam Review Algebra Semester Eam Review 7 Graph the numbers,,,, and 0 on a number line Identif the propert shown rs rs r when r and s Evaluate What is the value of k k when k? Simplif the epression 7 7 Solve the equation

More information

Identification of Nonlinear Dynamic Systems with Multiple Inputs and Single Output using discrete-time Volterra Type Equations

Identification of Nonlinear Dynamic Systems with Multiple Inputs and Single Output using discrete-time Volterra Type Equations Identification of Nonlinear Dnamic Sstems with Multiple Inputs and Single Output using discrete-time Volterra Tpe Equations Thomas Treichl, Stefan Hofmann, Dierk Schröder Institute for Electrical Drive

More information

Flows and Connectivity

Flows and Connectivity Chapter 4 Flows and Connectivit 4. Network Flows Capacit Networks A network N is a connected weighted loopless graph (G,w) with two specified vertices and, called the source and the sink, respectivel,

More information

Floor Control (kn) Time (sec) Floor 5. Displacement (mm) Time (sec) Floor 5.

Floor Control (kn) Time (sec) Floor 5. Displacement (mm) Time (sec) Floor 5. DECENTRALIZED ROBUST H CONTROL OF MECHANICAL STRUCTURES. Introduction L. Bakule and J. Böhm Institute of Information Theory and Automation Academy of Sciences of the Czech Republic The results contributed

More information

LINEAR OPTIMIZATION OF PARAMETERS IN DYNAMIC THRESHOLD GENERATORS

LINEAR OPTIMIZATION OF PARAMETERS IN DYNAMIC THRESHOLD GENERATORS LINEAR OPTIMIZATION OF PARAMETERS IN DYNAMIC THRESHOLD GENERATORS Michael Bask, Andreas Johansson Control Engineering Group Luleå University of Technology SE-971 87 Luleå, Sweden Email: Michael.Bask@csee.ltu.se

More information

Module 3, Section 4 Analytic Geometry II

Module 3, Section 4 Analytic Geometry II Principles of Mathematics 11 Section, Introduction 01 Introduction, Section Analtic Geometr II As the lesson titles show, this section etends what ou have learned about Analtic Geometr to several related

More information

8.7 Systems of Non-Linear Equations and Inequalities

8.7 Systems of Non-Linear Equations and Inequalities 8.7 Sstems of Non-Linear Equations and Inequalities 67 8.7 Sstems of Non-Linear Equations and Inequalities In this section, we stud sstems of non-linear equations and inequalities. Unlike the sstems of

More information

EL 625 Lecture 10. Pole Placement and Observer Design. ẋ = Ax (1)

EL 625 Lecture 10. Pole Placement and Observer Design. ẋ = Ax (1) EL 625 Lecture 0 EL 625 Lecture 0 Pole Placement and Observer Design Pole Placement Consider the system ẋ Ax () The solution to this system is x(t) e At x(0) (2) If the eigenvalues of A all lie in the

More information

A Robust Event-Triggered Consensus Strategy for Linear Multi-Agent Systems with Uncertain Network Topology

A Robust Event-Triggered Consensus Strategy for Linear Multi-Agent Systems with Uncertain Network Topology A Robust Event-Triggered Consensus Strategy for Linear Multi-Agent Systems with Uncertain Network Topology Amir Amini, Amir Asif, Arash Mohammadi Electrical and Computer Engineering,, Montreal, Canada.

More information

Realization of Quantum Hadamard Gate by Applying Optimal Control Fields to a Spin Qubit

Realization of Quantum Hadamard Gate by Applying Optimal Control Fields to a Spin Qubit 00 nd International Conference on Mechanical and Electronics Engineering (ICMEE 00) Realiation of Quantum Hadamard Gate b Appling Optimal Control Fields to a Spin Qubit Sh Mohammad Nejad Nanoptronics Research

More information

CHAPTER 3 Applications of Differentiation

CHAPTER 3 Applications of Differentiation CHAPTER Applications of Differentiation Section. Etrema on an Interval................... 0 Section. Rolle s Theorem and the Mean Value Theorem...... 0 Section. Increasing and Decreasing Functions and

More information

CHAPTER 2. Matrices. is basically the same as

CHAPTER 2. Matrices. is basically the same as CHAPTER Matrices. Blah Blah Matrices will provide a link between linear equations and vector spaces. This chapter first introduces the basic operations of addition, scalar multiplication, and multiplication,

More information

Nonlinear Observer Design for Dynamic Positioning

Nonlinear Observer Design for Dynamic Positioning Author s Name, Company Title of the Paper DYNAMIC POSITIONING CONFERENCE November 15-16, 2005 Control Systems I J.G. Snijders, J.W. van der Woude Delft University of Technology (The Netherlands) J. Westhuis

More information

A comparison of estimation accuracy by the use of KF, EKF & UKF filters

A comparison of estimation accuracy by the use of KF, EKF & UKF filters Computational Methods and Eperimental Measurements XIII 779 A comparison of estimation accurac b the use of KF EKF & UKF filters S. Konatowski & A. T. Pieniężn Department of Electronics Militar Universit

More information

A. Derivation of regularized ERM duality

A. Derivation of regularized ERM duality A. Derivation of regularized ERM dualit For completeness, in this section we derive the dual 5 to the problem of computing proximal operator for the ERM objective 3. We can rewrite the primal problem as

More information

arxiv:solv-int/ v1 7 Jul 1998

arxiv:solv-int/ v1 7 Jul 1998 SCHLESINGER TRANSFORMATIONS FOR LINEARISABLE EQUATIONS arxiv:solv-int/9807003v1 7 Jul 1998 Abstract A. Ramani CPT, Ecole Poltechnique CNRS, UPR 14 91128 Palaiseau, France B. Grammaticos GMPIB, Université

More information

F6 Solving Inequalities

F6 Solving Inequalities UNIT F6 Solving Inequalities: Tet F6 Solving Inequalities F6. Inequalities on a Number Line An inequalit involves one of the four smbols >,, < or The following statements illustrate the meaning of each

More information

Inverse Singular Value Problems

Inverse Singular Value Problems Chapter 8 Inverse Singular Value Problems IEP versus ISVP Existence question A continuous approach An iterative method for the IEP An iterative method for the ISVP 139 140 Lecture 8 IEP versus ISVP Inverse

More information

Designing Information Devices and Systems I Spring 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way

Designing Information Devices and Systems I Spring 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way EECS 16A Designing Information Devices and Systems I Spring 018 Lecture Notes Note 1 1.1 Introduction to Linear Algebra the EECS Way In this note, we will teach the basics of linear algebra and relate

More information

ROBUST PASSIVE OBSERVER-BASED CONTROL FOR A CLASS OF SINGULAR SYSTEMS

ROBUST PASSIVE OBSERVER-BASED CONTROL FOR A CLASS OF SINGULAR SYSTEMS INTERNATIONAL JOURNAL OF INFORMATON AND SYSTEMS SCIENCES Volume 5 Number 3-4 Pages 480 487 c 2009 Institute for Scientific Computing and Information ROBUST PASSIVE OBSERVER-BASED CONTROL FOR A CLASS OF

More information

ENGI 9420 Engineering Analysis Solutions to Additional Exercises

ENGI 9420 Engineering Analysis Solutions to Additional Exercises ENGI 940 Engineering Analsis Solutions to Additional Exercises 0 Fall [Partial differential equations; Chapter 8] The function ux (, ) satisfies u u u + = 0, subject to the x x u x,0 = u x, =. Classif

More information

Functions of Several Variables

Functions of Several Variables Chapter 1 Functions of Several Variables 1.1 Introduction A real valued function of n variables is a function f : R, where the domain is a subset of R n. So: for each ( 1,,..., n ) in, the value of f is

More information

5. Zeros. We deduce that the graph crosses the x-axis at the points x = 0, 1, 2 and 4, and nowhere else. And that s exactly what we see in the graph.

5. Zeros. We deduce that the graph crosses the x-axis at the points x = 0, 1, 2 and 4, and nowhere else. And that s exactly what we see in the graph. . Zeros Eample 1. At the right we have drawn the graph of the polnomial = ( 1) ( 2) ( 4). Argue that the form of the algebraic formula allows ou to see right awa where the graph is above the -ais, where

More information

Figure 1: ET is an oblique-angled diameter

Figure 1: ET is an oblique-angled diameter 1 Snopsis b section of Euler s paper ON SOME PROPERTIES OF CONIC SECTIONS THAT ARE SHARED WITH INFINITELY MANY OTHER CURVED LINES (E08) Thomas J Osler and Edward Greve Mathematics Department Rowan Universit

More information

LS.1 Review of Linear Algebra

LS.1 Review of Linear Algebra LS. LINEAR SYSTEMS LS.1 Review of Linear Algebra In these notes, we will investigate a way of handling a linear system of ODE s directly, instead of using elimination to reduce it to a single higher-order

More information

Delay-dependent Stability Analysis for Markovian Jump Systems with Interval Time-varying-delays

Delay-dependent Stability Analysis for Markovian Jump Systems with Interval Time-varying-delays International Journal of Automation and Computing 7(2), May 2010, 224-229 DOI: 10.1007/s11633-010-0224-2 Delay-dependent Stability Analysis for Markovian Jump Systems with Interval Time-varying-delays

More information

Linear algebra in turn is built on two basic elements, MATRICES and VECTORS.

Linear algebra in turn is built on two basic elements, MATRICES and VECTORS. M-Lecture():.-. Linear algebra provides concepts that are crucial to man areas of information technolog and computing, including: Graphics Image processing Crptograph Machine learning Computer vision Optimiation

More information

Experimental Uncertainty Review. Abstract. References. Measurement Uncertainties and Uncertainty Propagation

Experimental Uncertainty Review. Abstract. References. Measurement Uncertainties and Uncertainty Propagation Experimental Uncertaint Review Abstract This is intended as a brief summar of the basic elements of uncertaint analsis, and a hand reference for laborator use. It provides some elementar "rules-of-thumb"

More information

School of Mechanical Engineering and Automation Harbin Institute of Technology Shenzhen Graduate School Shenzhen, Guangdong Province, China

School of Mechanical Engineering and Automation Harbin Institute of Technology Shenzhen Graduate School Shenzhen, Guangdong Province, China 2016 International Conference on Mechanics Design, Manufacturing and Automation (MDM 2016) ISBN: 978-1-60595-354-0 A New Decoupling Measurement Method of Five-axis Machine ools Geometric Errors Based on

More information

Applied Mathematics 205. Unit II: Numerical Linear Algebra. Lecturer: Dr. David Knezevic

Applied Mathematics 205. Unit II: Numerical Linear Algebra. Lecturer: Dr. David Knezevic Applied Mathematics 205 Unit II: Numerical Linear Algebra Lecturer: Dr. David Knezevic Unit II: Numerical Linear Algebra Chapter II.3: QR Factorization, SVD 2 / 66 QR Factorization 3 / 66 QR Factorization

More information

An efficient algorithm to compute the real perturbation values of a matrix

An efficient algorithm to compute the real perturbation values of a matrix An efficient algorithm to compute the real perturbation values of a matrix Simon Lam and Edward J. Davison 1 Abstract In this paper, an efficient algorithm is presented for solving the nonlinear 1-D optimization

More information

CPS 616 ITERATIVE IMPROVEMENTS 10-1

CPS 616 ITERATIVE IMPROVEMENTS 10-1 CPS 66 ITERATIVE IMPROVEMENTS 0 - APPROACH Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change

More information