On Optimizing Sensor Placement for Spatio-Temporal Temperature Estimation in Large Battery Packs

Size: px
Start display at page:

Download "On Optimizing Sensor Placement for Spatio-Temporal Temperature Estimation in Large Battery Packs"

Transcription

1 On Optimizing Sensor Placement for Spatio-Temporal Temperature Estimation in Large Battery Packs Philipp Wolf 1, Scott Moura 2 an Miroslav Krstic 2 Abstract This paper optimizes the number of sensors an their locations for estimating the 2-D spatio-temporal temperature ynamics in large battery packs. Monitoring temperature in battery packs is crucial for safety, efficiency, an longterm enurance. The temperature ynamics in large battery packs evolve in space an time, whereas sensors only provie pointwise ata. Moreover, the number of sensors shoul be minimize to reuce costs. The temperature ynamics are moele by a system of linear two-imensional heat partial ifferential equations (PDEs). In this paper we perform eigenecomposition of the PDEs to prouce a finite-imensional moel. Moal observability is efine from the magnitue of these eigenmoes. The process of optimizing the number an location of sensors involves two steps: First, a binary optimization minimizes the number of sensors. Secon, a constraine nonlinear programming problem is solve to optimize the previously foun sets with respect to a min-max-type objective function. The optimization proceure is inepenent of the estimator esign. I. INTRODUCTION This paper presents a systematic metho to optimally place a minimally-size sensor set for estimation of battery pack thermal ynamics. Monitoring an controlling battery pack temperature ynamics is a critically important problem. Large-scale evices, such as electric vehicles an gri-scale energy storage, require high energy an power. Consequently, battery packs are often constructe with thousans of cells. One important challenge with such battery packs is that an iniviual cell may become thermally unstable. The heat generate from this unstable cell can transfer to neighboring cells, thereby causing a chain reaction commonly calle thermal runaway. Even when cells o not enter this unstable region, high temperatures can accelerate egraation mechanisms an low temperatures limit available power/energy [1]. Consequently, accurately monitoring an regulating battery pack temperature is a crucial component of battery management systems [2], [3], [4]. CFD moeling, moel reuction, an analysis of battery pack thermal ynamics is currently an active research area [5], [6], [7], [8]. Intelligent sensor placement is the next step towars avance thermal management. Nonetheless, sensor placement in istribute parameter systems bears several challenges. First, placing multiple sensors is NP- This work was supporte by the German Acaemic Exchange Service (DAAD) an the National Science Founation 1 P. Wolf is with the Institute for System Dynamics, Faculty 7, University of Stuttgart, Stuttgart, Germany 2 S. Moura an M. Krstic are with the Department of Mechanical an Aerospace Engineering, University of California, San Diego, CA 92093, USA ( smoura@ucs.eu; krstic@ucs.eu) har [9]. The current work aresses this issue. Secon, the optimization problem is non-convex, in general. The engineering literature on optimal sensor placement examines various optimization criteria. These can be classifie into open-loop an close-loop consierations. Open-loop methos often focus on observability metrics, e.g. the spatial H 2 norm [10], [11]. Close-loop methos simultaneously esign the observer gains an sensor locations [12], [13], an consier metrics such as estimation error regulation, isturbance rejection, an robustness [14]. The survey paper [15] provies an excellent analysis of various aspects of actuator/sensor placement. The current work focuses on placement of a minimally size sensor set, with respect to a particular observability metric, inspire by eigenanalysis. We focus on a 2D PDE moel for battery pack thermal ynamics recently propose in [16]. Our main iea is to erive a finite-imensional moal moel from the aforementione PDE moel via eigenanalysis. The moal setting provies a natural efinition for an observability measure we use for sensor placement. In aition, we focus on computing the minimal sensor set to achieve a given observability criterion. This problem is solve by capitalizing on a submoularity property [17], which substantially reuces computational effort. Finally, the sensor placement problem is mathematically cast as a nonlinear optimization problem. In Section II, the moal moel is erive from the PDE moel. Next, a systematic metho for optimal sensor placement is presente in Section III, followe by some exemplary results in Section IV. The paper s main ieas are summarize in Section V. II. MODELLING We use the PDE moel evelope in [16]. The two spatial imensions are enote x an y, with pack bounaries at x = ±L x an y = ±L y, so that the battery pack resembles a rectangular shape within a rectangular omain Ω = [ L x, L x ] [ L y, L y ]. (1) Time is assume to run from t = 0 to t =. A. PDE moel The moel for temperature istribution in the battery pack has three states, Θ, T h, T c, which respectively represent temperature in the pack material, cells, an cooling channels.

2 Fig. 1. Illustration of the PDE approximation for battery packs with a large number of cells. Cells are illustrate in re, cooling channels in blue, an pack material in white. Note that states Θ, T c, T h exist over the entire omain Ω in the final PDE moel. It is mathematically given by t Θ(x, y, t) = a Θ(x, y, t) + b [T h(x, y, t) Θ(x, y, t)] + c [T c (x, y, t) Θ(x, y, t)], (2) t T h(x, y, t) = [Θ(x, y, t) T h (x, y, t)] + eφ h (x, y, t), t T c(x, y, t) = f [Θ(x, y, t) T c (x, y, t)] gφ c (x, y, t), where = 2 x y 2 are constant coefficients, is the Laplacian operator, (3) (4) a, b, c,, e, f, g R, (5) Θ(x, y, 0), T h (x, y, 0), an T c (x, y, 0), (6) enote the initial conitions, an Θ(x, y, t) x = λ Θ(x, y, t) x=±lx k p (7) x=±lx Θ(x, y, t) y = λ Θ(x, y, t) y=±ly k p (8) y=±ly enote the Robin-type bounary conitions. The variables Φ h an Φ c enote the heat generate by the cells an the heat taken by the cooling system, respectively. The PDE moel was erive in [16] by iviing the battery pack omain into subomains, each of which containe either a cell, cooling channel, or the pack material. Then the imensions of these subomains were taken to zero. This represents a large number of cells (see Figure 1). Please note that we have moifie the moel by subtracting the ambient temperature from each state, thus maintaining the structure of the PDE system. This positions us to perform an eigenanalysis an erive the moal moel, escribe next. B. Moal moel We achieve the moal version of the PDEs by calculating an orthonormal basis of eigenmoes over the omain Ω an projecting the PDEs onto this basis. This process prouces an infinite set of ODEs, which we summarize next (for more etails please refer to [18]). Assuming Θ(x, y, t) = µ Θ (t)z(x, y), the homogeneous part of (2) becomes t µ Θ + b + c = 2k = Z aµ Θ a Z with the separation constant 2k. We separate this into two inepenent ODEs governing the temporal an spatial parts of the solution as t µ Θ(t) = (2ka + b + c)µ Θ (t), (10) Z(x, y) = 2kZ(x, y). (11) The solution of (10) is given by (9) µ Θ (t) = µ Θ (t)e (2ka+b+c)t. (12) For the spatial part, we assume Z(x, y) = X(x)Y (y) an (11) can be arrange as 2 2 x X 2 X + k = h = y Y 2 k. (13) Y which is separate into two Sturm-Liouville equations with the bounary conitions X + (k h)x = 0, (14) Y + (k + h)y = 0 (15) X (±L x ) = λ k p X(±L x ), (16) Y (±L y ) = λ k p Y (±L y ), (17) erive from (7) an (8). The solution of (14), (16) for X is an infinite set (i N) of eigenfunctions { cos(γxi x) for o i X i (x) = (18) sin(γ xi x) for even i where γ x = k h solves for the cosine eigenfunctions an tan(γ x L x ) = λ k p 1 γ x (19) tan(γ x L x ) = k p λ γ x (20) for the sine eigenfunctions. We get a structurally ientical solution for Y an in combination, these sets form the eigenmoes for (2), consisting of the moe shapes Z ij (x, y) = X i (x)y j (y), i, j = 1,..., with corresponing separation constants k ij = (γ 2 xi + γ2 yj )/2. Note from (12) that the eigenvalues, given by (2k ij a + b + c), are real, negative, an increase in an approximately quaratic fashion towars as the inices i, j increase. The eigenmoes are L 2 -orthogonal [18], [19] an are normalize by pre-multiplying by the constant K ij = 1 Ω Z2 ij Ω, (21)

3 forming an orthonormal basis K ij Z ij, i, j = 1,.., for (2). Equations (3) an (4) are ODEs in time, parameterize over space. Since they are couple with (2), their solutions inherit the same spatial structure. For this reason, an the fact that the eigenmoes provie an orthogonal basis, the whole system of PDEs is projecte onto the eigenmoes. Thus, we obtain an infinite set of systems of ODEs (n = 1,..., ), t µ Θn = (2ak n + b + c) µ Θn + bµ Th n + cµ Tcn (22) t µ T h n = µ Th n + µ Θn + ek n Φ h Z n Ω (23) Ω t µ T cn = fµ Tcn + fµ Θn + gk n Φ c Z n Ω (24) Ω where n inexes the Cartesian prouct of i = 1,..., an j = 1,...,. The moal coefficients µ Θn, µ Th n an µ Tcn characterize the temporal part of the solution. A finite-imensional ODE moel is obtaine by taking a finite subset of (22) - (24), containing only the first N eigenmoes. This truncation is justifie by the fact that the moel is stable an the eigenvalues increase approximately quaratically towars, as the inex number increases. III. SENSOR PALCEMENT Next we investigate optimal in-omain placement of temperature sensors for a moal moel-base estimator. Sensor placement, in general, has many ifferent aspects, which inclue, but are not limite to observability, robustness, an noise/isturbance rejection. We choose one of these aspects to explicitly account for in our optimization: the moal observability. In view of this requirement, the task is two-fol. First, etermine the minimal number of sensors. Secon, place the sensors over the omain in some optimal sense. This problem is, in general, an NP-har, constraine, mixeinteger, nonlinear program. For the approach presente here, the problem is split into two steps: First, we efine a fixe minimum threshol for the observability an a gri on the omain. On the gri points, we perform a binary integer search, minimizing the number of sensors an fining sets that satisfy the minimum observability requirement. In the secon step, we take all sensor sets from the first step an optimize their location, now with respect to maximizing the observability in a constraine nonlinear optimization. A. Moal observability measure Moal observability is a well known concept for spatially istribute systems. It can be efine accoring to open-loop specifications (e.g. the spatial H 2 norm [10], [11]), or closeloop specifications (e.g. LQG metrics [14]). We investigate the following efinition of moal observability for the n th eigenmoe at location (x p, y p ), M(n, x p, y p ) := K nz n (x p, y p ) max (x,y) Ω K n Z n (x, y), (25) where M : N [ L x, L x ] [ L y, L y ] R. Equation (25) can be simplifie to M(n, x p, y p ) = Z n (x p, y p ). (26) Fig. 2. Sample visualization of S x(x s) for two sensors. The global optima are enote by black circles. using (18) an (21). Note that M(n, x p, y p ) [0, 1], where M(n, x p, y p ) = 0 signifies no observability an M(n, x p, y p ) = 1 signifies best case observability. Conceptually, the moel observability for an eigenmoe at a particular spatial location is given by the magnitue of the corresponing eigenfunction. This efinition is novel, an is motivate by the iea that one shoul place sensors where the eigenfunction magnitue is large. B. Optimization scheme 1) Separation an Symmetry: The structure of the moal moel contains the separation property, which consequently reuces the complexity of the optimization. We ecompose the moe shapes of the N eigenmoes into their constituting eigenfunctions Z n (x, y) = X i (x)y j (y) an from this point on, we work on the x imension only. The proceure for the y imension involves ientical steps. At the en, the results are recombine. The moal observability measure (26) also separates in two parts M x (i, x p ) := X i (x p ) an M y (j, y p ) := Y j (y p ), (27) since M(n, x p, y p ) = M x (i, x p )M y (j, y p ). Aitionally, we reuce the optimization to the positive half of the x subomain (the interval (0, L x )) to avoi multiple isomorphic solutions since the moe shapes are symmetric with respect to the origin, in terms of moal observability. 2) Objective Function Analysis: The nonlinear program, escribe in Section III-B.4, optimizes the set, x s, of sensor locations on the continuous interval (0, L x ) with respect to maximizing the lowest moal observability over all eigenfunctions. Mathematically, the objective function is efine as S x (x s ) = min i {1,...,N} { max x p x s M x (i, x p ) }. (28)

4 Conceptually, each moe is assigne the sensor which is locate at the greatest eigenfunction magnitue. Then the objective function value, S x (x s ), gives us the lowest moel observability over the set of moes. Our goal is to maximize the worst case moal observability. Figure 2 provies a sample visualization of S x for two sensors in the x subomain. This problem is rile with multiple local optima. Multiple global optima exist (enote by circles), an we wish to ientify these sensor locations - for two or more sensors. This motivates the following metho for selecting optimization starting points. First, we seek to etermine the minimal number of sensors require to achieve a given level of observability. Secon, we optimize the location of this minimal set of sensors. 3) Minimal Number of Sensors: The first part is formulate as a combinatorial problem. Thus, we establish a binary integer approximation by imposing a gri of Q points on (0, L x ). For every eigenfunction X i, we efine a binary observability criterion for a hypothetical sensor at the gripoint x q, q {1,..., Q} with respect to a moal observability threshol τ int B x (i, q) := x : { 1 for Mx (i, x q ) τ int x 0 else. (29) The value for τx int is chosen a priori. Since this value epens on the structure of the involve eigenfunctions, it must be chosen appropriately. The gri structure requires careful consieration to trae off accuracy with complexity. Specifically, the eigenfunction with the greatest spatial frequency provies the appropriate inicator for the gri imensions. It has feasible regions where its observability is above the threshol τx int. We use an equal-istance gri with a istance small enough to cover each of its feasible regions by at least two gri points. This is a rather conservative choice, but in our tests turne out to be a goo balance between coverage an problem size. One reason is that the optimal sensor locations ten to be at the bounaries of the feasible regions. With this setting, there is at least one gri point less than half of the region away from every bounary for all eigenfunctions. The binary observability information can be organize in matrix form B = [B x (i, q)] i,q i = 1,..., N q = 1,..., Q, (30) an this matrix is the input to the search algorithm. Our immeiate goal is to select a set of sensor locations with minimal carinality, such that for each moe i, there exists at least one sensor location q in this set where B x (i, q) = 1. The brute-force metho to solve this problem is full enumeration. This metho woul fin a complete set (i.e. a set of sensors covering all eigenfunctions), establishing the minimal number of sensors. Since there are likely multiple locations that satisfy the minimum observability criterion, all combinations must be evaluate. However, this metho is computationally expensive an oes not take avantage of the problem s submoularity, a critical property for our metho. TABLE I COMPARISON OF ITERATIONS PERFORMED BY FULL ENUMERATION AND MODIFIED GREEDY ALGORITHM τx int Full Enumeration Moifie Greey Reuction Factor A problem is submoular, if it has a iminishing return property. In our case we choose one gri point after another to buil a set of sensor locations. Each gri point x q, q 1,..., Q satisfies (29) for a fixe number of eigenfunctions that it can contribute to the set of covere eigenfuntions. The later we a a gri point to a sensor location set, the less aitional eigenfunctions it will contribute. This is because more an more eigenfunctions are alreay covere by previously chosen sensor locations. Base on submoularity, we have esigne a moifie greey algorithm (for etails please refer to [18]) that spans a much smaller tree than the complete combinatorial tree, while still covering all branches of interest. This is crucial for achieving a practical algorithm for placing multiple sensors. Full enumeration an the moifie greey algorithm both return the minimal number of sensors P, an the corresponing sets of gri points that satisfy the binary observability criterion. 4) Sensor Location Optimization: In the secon step, the sets of sensors from the first part are use as starting points x s0 for the constraine nonlinear programming problem (NLP) we escribe next. The NLP optimizes the sensor locations x s on the continuous interval (0, L x ) with respect to maximizing the lowest moal observability over all eigenfunctions, S x (x s ) efine in (28). The optimization problem is thus formulate as max S(x s ), (31) x s (0,L x) P s. to x s,1 x s,2 x s,p, (32) for every set of starting points x s0. Constraint (32) prevents permutations in the sensor orer. Note that multiple starting points may converge to ientical optima. This optimization problem can be solve with graient-base algorithms, such as sequential quaratic programming. IV. EXAMPLE RESULTS To illustrate some results, we assume a battery pack with imensions efine by L x = L y = 10. We set the ratio between the thermal conuctivity insie the pack material an the heat transfer rate from pack material to surrouning air to λ k p = 20, (33) corresponing to moerate heat conuctivity insie the pack in combination with high heat transfer over the bounaries.

5 Fig. 3. Example: The first 31 eigenfunctions X i, for the x imension. Green an blue correspon to sine an cosine eigenfunctions, respectively. Fig. 4. Optimal locations for (a) two, (b) three, an (c.1) four sensors. For each number of sensors, multiple optima with ientical objectives S x(x s) exist. The sensor locations in (c.2) are suboptimal, yet exhibit more equally istance spacing after reflecting two sensors onto the left-half of the subomain. The finite subset of eigenmoes is efine by selecting the banwith of interest. Since the eigenvalues ecrease quaratically towars, we truncate the high frequency moes an retain the ominant low frequency moes. In this example, 185 eigenmoes are retaine. This example set of eigenmoes is ecompose into the eigenfunctions. Figure 3 shows the first 31 eigenfunctions for the x imension. Table I shows a comparison of the require iterations for the moifie greey algorithm an full enumeration. In this example, capitalizing on the submoularity property provies a reuction of up to two orers of magnitue. Figure 4(a)-(c) shows the resulting optimal sensor sets. In each case, multiple sensor sets are shown because multiple equivalent optima were ientifie. The sets of two sensors in Figure 4(a) where obtaine by setting τx int = 0.3 for the integer optimization. The maximum observability following the nonlinear optimization is S x (x s) = 0.5. One may see that the NLP successfully ientifies the global optimain shown in Fig. 2,. Setting τx int = 0.65 requires one aitional sensor. The optimal locations for several sets of three sensors are provie in Figure 4(b). These sensor sets achieve S x (x s) = Further increasing the initial τx int = 0.82 provokes a fourth sensor an increases the observability objective to S x (x s) = 0.88, as shown in Figure 4(c.1). Note that the total observability for the eigenmoes is S(x s, y s) = S x (x s)s y (y s). Therefore, S(x s, y s) = 0.25 if S x (x s) = S y (y s) = 0.5, an S(x s, y s) = 0.76 for S x (x s) = S y (y s) = A. Implementation Issues Choosing one of the optimal sensor sets from Fig. 4 is base on the requirements of the application. For estimating temperatures in large battery packs, one critical aspect is the worst case time elay between a local failure an a sensor, ue to thermal conuctivity limits. To minimize this effect, we woul prefer sets with the most equally space istribution. Another aspect is the way the sensor set is moifie to cover the right half of the x subomain. One choice is to uplicate a sensor set by mirroring at the origin, proviing two reunant sensors for each eigenmoe while accepting a lower minimal moal observability. For example, a total of four sensors woul be achieve by mirroring the first location set from Figure 4(a). The other option is to take a sensor set from the results with more sensors an a higher minimal moal observability an completely move half of the sensors to corresponing locations on the other half of the subomain. Figure 4(c.2) illustrates such an example. This set has a slightly lower minimal moal observability (0.87 vs. S x (x s) = 0.88), but is the most equally istance set for the case of moving two sensors to the left half of the x subomain. The key ifference is the former esign choice provies sensor reunancy whereas the latter provies higher minimal moal observability. V. CONCLUSION This paper examines sensor placement for estimation of battery pack thermal ynamics. Specifically, we seek the

6 location of a minimal set of sensors that optimize a particular observability criterion. The critical ieas can be summarize into four points. First, we erive a finite-imensional moal moel via eigenanalysis. Secon, we quantify the observability of an eigenmoe at a given spatial location by the eigenmoe s value. Thir, we etermine the minimal set of sensors which all satisfy a particular observability criterion. This proceure capitalizes on the submoularity property of the optimization problem. Finally, we optimize the locations of this minimal sensor set via a nonlinear program. This paper provies a systematic methoology for placing temperature sensors in large battery packs for estimating thermal ynamics. ACKNOWLEDGMENT P. Wolf thanks Prof. O. Sawony for proviing support uring his tenure as a visiting scholar at UC San Diego. REFERENCES [1] K. Smith an C.-Y. Wang, Power an thermal characterization of a lithium-ion battery pack for hybri-electric vehicles, Journal of Power Sources, vol. 160, no. 1, pp , [2] S. J. Moura, N. Chaturvei, an M. Krstic, PDE Estimation Techniques for Avance Battery Management Systems - Part I: SOC Estimation, in Proceeings of the 2012 American Control Conference, Montreal, Canaa, June [3], PDE Estimation Techniques for Avance Battery Management Systems - Part II: SOH Ientification, in Proceeings of the 2012 American Control Conference, Montreal, Canaa, June [4] S. J. Moura, J. L. Stein, an H. K. Fathy, Battery Health-Conscious Power Management for Plug-in Hybri Electric Vehicles via Stochastic Control, vol. 1, Cambrige, MA, Unite states, 2010, pp [5] C. Park an A. Jaura, Dynamic thermal moel of li-ion battery for preictive behavior in hybri an fuel cell vehicles, SAE transactions, vol. 112, no. 3, pp , [6] M. Guo an R. E. White, Thermal moel for lithium ion battery pack with mixe parallel an series configuration, Journal of the Electrochemical Society, vol. 158, no. 10, pp. A1166 A1176, [7] X. Hu, S. Lin, S. Stanton, an W. Lian, A state space thermal moel for hev/ev battery moeling, SAE 2011 Worl Congress an Exhibition, [8] H. Sun, X. Wang, B. Tossan, an R. Dixon, Three-imensional thermal moeling of a lithium-ion battery pack, Journal of Power Sources, [9] D. Uciński, Optimal measurement methos for istribute parameter system ientification. CRC, [10] D. Halim an S. Reza Moheimani, An optimization approach to optimal placement of collocate piezoelectric actuators an sensors on a thin plate, Mechatronics, vol. 13, no. 1, pp , [11] A. Armaou an M. A. Demetriou, Optimal actuator/sensor placement for linear parabolic PDEs using spatial H2 norm, Chemical Engineering Science, vol. 61, no. 22, pp , [12] Y. Lou an P. D. Christofies, Optimal actuator/sensor placement for nonlinear control of the kuramoto-sivashinsky equation, IEEE Transactions on Control Systems Technology, vol. 11, no. 5, pp , [13] K. K. Chen an C. W. Rowley, H2 optimal actuator an sensor placement in the linearise complex Ginzburg-Lanau system, Journal of Flui Mechanics, vol. 681, pp , [14] J. Borggaar, J. Burns, an L. Zietsman, On using lqg performance metrics for sensor placement, in Proc. American Control Conf. (ACC), 2011, pp [15] C. Kubrusly an H. Malebranche, Sensors an controllers location in istribute systems a survey, Automatica, vol. 21, no. 2, pp , [16] A. Smyshlyaev, M. Krstic, N. Chaturvei, J. Ahme, an A. Kojic, PDE Moel for Thermal Dynamics of a Large Li-ion Battery Pack, in Proc. American Control Conf. (ACC), 2011, pp [17] A. Krause, J. Leskovec, C. Guestrin, J. VanBriesen, an C. Faloutsos, Efficient sensor placement optimization for securing large water istribution networks, Journal of Water Resources Planning an Management, vol. 134, no. 6, pp , [18] P. Wolf, Spatio-temporal temperature estimation for large battery packs, Diploma Thesis, Institute for System Dynamics, University of Stuttgart, [19] G. Cain an G. Meyer, Separation of variables for partial ifferential equations: an eigenfunction approach. CRC Press, 2006.

'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21

'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21 Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting

More information

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013 Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing

More information

Table of Common Derivatives By David Abraham

Table of Common Derivatives By David Abraham Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec

More information

APPROXIMATE SOLUTION FOR TRANSIENT HEAT TRANSFER IN STATIC TURBULENT HE II. B. Baudouy. CEA/Saclay, DSM/DAPNIA/STCM Gif-sur-Yvette Cedex, France

APPROXIMATE SOLUTION FOR TRANSIENT HEAT TRANSFER IN STATIC TURBULENT HE II. B. Baudouy. CEA/Saclay, DSM/DAPNIA/STCM Gif-sur-Yvette Cedex, France APPROXIMAE SOLUION FOR RANSIEN HEA RANSFER IN SAIC URBULEN HE II B. Bauouy CEA/Saclay, DSM/DAPNIA/SCM 91191 Gif-sur-Yvette Ceex, France ABSRAC Analytical solution in one imension of the heat iffusion equation

More information

Lecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations

Lecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations Lecture XII Abstract We introuce the Laplace equation in spherical coorinates an apply the metho of separation of variables to solve it. This will generate three linear orinary secon orer ifferential equations:

More information

Quantum Mechanics in Three Dimensions

Quantum Mechanics in Three Dimensions Physics 342 Lecture 20 Quantum Mechanics in Three Dimensions Lecture 20 Physics 342 Quantum Mechanics I Monay, March 24th, 2008 We begin our spherical solutions with the simplest possible case zero potential.

More information

Sturm-Liouville Theory

Sturm-Liouville Theory LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory

More information

Math Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors

Math Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+

More information

Diagonalization of Matrices Dr. E. Jacobs

Diagonalization of Matrices Dr. E. Jacobs Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is

More information

Separation of Variables

Separation of Variables Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical

More information

Least-Squares Regression on Sparse Spaces

Least-Squares Regression on Sparse Spaces Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction

More information

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent

More information

The derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)

The derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x) Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)

More information

UNIFYING PCA AND MULTISCALE APPROACHES TO FAULT DETECTION AND ISOLATION

UNIFYING PCA AND MULTISCALE APPROACHES TO FAULT DETECTION AND ISOLATION UNIFYING AND MULISCALE APPROACHES O FAUL DEECION AND ISOLAION Seongkyu Yoon an John F. MacGregor Dept. Chemical Engineering, McMaster University, Hamilton Ontario Canaa L8S 4L7 yoons@mcmaster.ca macgreg@mcmaster.ca

More information

Agmon Kolmogorov Inequalities on l 2 (Z d )

Agmon Kolmogorov Inequalities on l 2 (Z d ) Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,

More information

We G Model Reduction Approaches for Solution of Wave Equations for Multiple Frequencies

We G Model Reduction Approaches for Solution of Wave Equations for Multiple Frequencies We G15 5 Moel Reuction Approaches for Solution of Wave Equations for Multiple Frequencies M.Y. Zaslavsky (Schlumberger-Doll Research Center), R.F. Remis* (Delft University) & V.L. Druskin (Schlumberger-Doll

More information

7.1 Support Vector Machine

7.1 Support Vector Machine 67577 Intro. to Machine Learning Fall semester, 006/7 Lecture 7: Support Vector Machines an Kernel Functions II Lecturer: Amnon Shashua Scribe: Amnon Shashua 7. Support Vector Machine We return now to

More information

Thermal conductivity of graded composites: Numerical simulations and an effective medium approximation

Thermal conductivity of graded composites: Numerical simulations and an effective medium approximation JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University

More information

Final Exam Study Guide and Practice Problems Solutions

Final Exam Study Guide and Practice Problems Solutions Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making

More information

Sensors & Transducers 2015 by IFSA Publishing, S. L.

Sensors & Transducers 2015 by IFSA Publishing, S. L. Sensors & Transucers, Vol. 184, Issue 1, January 15, pp. 53-59 Sensors & Transucers 15 by IFSA Publishing, S. L. http://www.sensorsportal.com Non-invasive an Locally Resolve Measurement of Soun Velocity

More information

Calculus of Variations

Calculus of Variations 16.323 Lecture 5 Calculus of Variations Calculus of Variations Most books cover this material well, but Kirk Chapter 4 oes a particularly nice job. x(t) x* x*+ αδx (1) x*- αδx (1) αδx (1) αδx (1) t f t

More information

Problems Governed by PDE. Shlomo Ta'asan. Carnegie Mellon University. and. Abstract

Problems Governed by PDE. Shlomo Ta'asan. Carnegie Mellon University. and. Abstract Pseuo-Time Methos for Constraine Optimization Problems Governe by PDE Shlomo Ta'asan Carnegie Mellon University an Institute for Computer Applications in Science an Engineering Abstract In this paper we

More information

Design of an Industrial Distributed Controller Near Spatial Domain Boundaries

Design of an Industrial Distributed Controller Near Spatial Domain Boundaries Design of an Inustrial Distribute Controller Near Spatial Domain Bounaries Stevo Mijanovic, Greg E. Stewart, Guy A. Dumont, an Michael S. Davies ABSTRACT This paper proposes moifications to an inustrial

More information

θ x = f ( x,t) could be written as

θ x = f ( x,t) could be written as 9. Higher orer PDEs as systems of first-orer PDEs. Hyperbolic systems. For PDEs, as for ODEs, we may reuce the orer by efining new epenent variables. For example, in the case of the wave equation, (1)

More information

BEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS. Mauro Boccadoro Magnus Egerstedt Paolo Valigi Yorai Wardi

BEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS. Mauro Boccadoro Magnus Egerstedt Paolo Valigi Yorai Wardi BEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS Mauro Boccaoro Magnus Egerstet Paolo Valigi Yorai Wari {boccaoro,valigi}@iei.unipg.it Dipartimento i Ingegneria Elettronica

More information

TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE

TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS Yannick DEVILLE Université Paul Sabatier Laboratoire Acoustique, Métrologie, Instrumentation Bât. 3RB2, 8 Route e Narbonne,

More information

12.11 Laplace s Equation in Cylindrical and

12.11 Laplace s Equation in Cylindrical and SEC. 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential 593 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential One of the most important PDEs in physics an engineering

More information

Lower Bounds for the Smoothed Number of Pareto optimal Solutions

Lower Bounds for the Smoothed Number of Pareto optimal Solutions Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.

More information

inflow outflow Part I. Regular tasks for MAE598/494 Task 1

inflow outflow Part I. Regular tasks for MAE598/494 Task 1 MAE 494/598, Fall 2016 Project #1 (Regular tasks = 20 points) Har copy of report is ue at the start of class on the ue ate. The rules on collaboration will be release separately. Please always follow the

More information

A Course in Machine Learning

A Course in Machine Learning A Course in Machine Learning Hal Daumé III 12 EFFICIENT LEARNING So far, our focus has been on moels of learning an basic algorithms for those moels. We have not place much emphasis on how to learn quickly.

More information

Thermal runaway during blocking

Thermal runaway during blocking Thermal runaway uring blocking CES_stable CES ICES_stable ICES k 6.5 ma 13 6. 12 5.5 11 5. 1 4.5 9 4. 8 3.5 7 3. 6 2.5 5 2. 4 1.5 3 1. 2.5 1. 6 12 18 24 3 36 s Thermal runaway uring blocking Application

More information

Time-of-Arrival Estimation in Non-Line-Of-Sight Environments

Time-of-Arrival Estimation in Non-Line-Of-Sight Environments 2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor

More information

Physics 505 Electricity and Magnetism Fall 2003 Prof. G. Raithel. Problem Set 3. 2 (x x ) 2 + (y y ) 2 + (z + z ) 2

Physics 505 Electricity and Magnetism Fall 2003 Prof. G. Raithel. Problem Set 3. 2 (x x ) 2 + (y y ) 2 + (z + z ) 2 Physics 505 Electricity an Magnetism Fall 003 Prof. G. Raithel Problem Set 3 Problem.7 5 Points a): Green s function: Using cartesian coorinates x = (x, y, z), it is G(x, x ) = 1 (x x ) + (y y ) + (z z

More information

19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control

19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control 19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior

More information

Predictive Control of a Laboratory Time Delay Process Experiment

Predictive Control of a Laboratory Time Delay Process Experiment Print ISSN:3 6; Online ISSN: 367-5357 DOI:0478/itc-03-0005 Preictive Control of a aboratory ime Delay Process Experiment S Enev Key Wors: Moel preictive control; time elay process; experimental results

More information

1 dx. where is a large constant, i.e., 1, (7.6) and Px is of the order of unity. Indeed, if px is given by (7.5), the inequality (7.

1 dx. where is a large constant, i.e., 1, (7.6) and Px is of the order of unity. Indeed, if px is given by (7.5), the inequality (7. Lectures Nine an Ten The WKB Approximation The WKB metho is a powerful tool to obtain solutions for many physical problems It is generally applicable to problems of wave propagation in which the frequency

More information

Schrödinger s equation.

Schrödinger s equation. Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of

More information

Influence of weight initialization on multilayer perceptron performance

Influence of weight initialization on multilayer perceptron performance Influence of weight initialization on multilayer perceptron performance M. Karouia (1,2) T. Denœux (1) R. Lengellé (1) (1) Université e Compiègne U.R.A. CNRS 817 Heuiasyc BP 649 - F-66 Compiègne ceex -

More information

Optimized Schwarz Methods with the Yin-Yang Grid for Shallow Water Equations

Optimized Schwarz Methods with the Yin-Yang Grid for Shallow Water Equations Optimize Schwarz Methos with the Yin-Yang Gri for Shallow Water Equations Abessama Qaouri Recherche en prévision numérique, Atmospheric Science an Technology Directorate, Environment Canaa, Dorval, Québec,

More information

1 Lecture 20: Implicit differentiation

1 Lecture 20: Implicit differentiation Lecture 20: Implicit ifferentiation. Outline The technique of implicit ifferentiation Tangent lines to a circle Derivatives of inverse functions by implicit ifferentiation Examples.2 Implicit ifferentiation

More information

Chapter 9 Method of Weighted Residuals

Chapter 9 Method of Weighted Residuals Chapter 9 Metho of Weighte Resiuals 9- Introuction Metho of Weighte Resiuals (MWR) is an approimate technique for solving bounary value problems. It utilizes a trial functions satisfying the prescribe

More information

Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets

Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets Proceeings of the 4th East-European Conference on Avances in Databases an Information Systems ADBIS) 200 Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets Eleftherios Tiakas, Apostolos.

More information

Generalizing Kronecker Graphs in order to Model Searchable Networks

Generalizing Kronecker Graphs in order to Model Searchable Networks Generalizing Kronecker Graphs in orer to Moel Searchable Networks Elizabeth Boine, Babak Hassibi, Aam Wierman California Institute of Technology Pasaena, CA 925 Email: {eaboine, hassibi, aamw}@caltecheu

More information

Linear First-Order Equations

Linear First-Order Equations 5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)

More information

On Characterizing the Delay-Performance of Wireless Scheduling Algorithms

On Characterizing the Delay-Performance of Wireless Scheduling Algorithms On Characterizing the Delay-Performance of Wireless Scheuling Algorithms Xiaojun Lin Center for Wireless Systems an Applications School of Electrical an Computer Engineering, Purue University West Lafayette,

More information

Chapter 4. Electrostatics of Macroscopic Media

Chapter 4. Electrostatics of Macroscopic Media Chapter 4. Electrostatics of Macroscopic Meia 4.1 Multipole Expansion Approximate potentials at large istances 3 x' x' (x') x x' x x Fig 4.1 We consier the potential in the far-fiel region (see Fig. 4.1

More information

Situation awareness of power system based on static voltage security region

Situation awareness of power system based on static voltage security region The 6th International Conference on Renewable Power Generation (RPG) 19 20 October 2017 Situation awareness of power system base on static voltage security region Fei Xiao, Zi-Qing Jiang, Qian Ai, Ran

More information

Math 342 Partial Differential Equations «Viktor Grigoryan

Math 342 Partial Differential Equations «Viktor Grigoryan Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite

More information

On the Aloha throughput-fairness tradeoff

On the Aloha throughput-fairness tradeoff On the Aloha throughput-fairness traeoff 1 Nan Xie, Member, IEEE, an Steven Weber, Senior Member, IEEE Abstract arxiv:1605.01557v1 [cs.it] 5 May 2016 A well-known inner boun of the stability region of

More information

Switching Time Optimization in Discretized Hybrid Dynamical Systems

Switching Time Optimization in Discretized Hybrid Dynamical Systems Switching Time Optimization in Discretize Hybri Dynamical Systems Kathrin Flaßkamp, To Murphey, an Sina Ober-Blöbaum Abstract Switching time optimization (STO) arises in systems that have a finite set

More information

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische

More information

. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences.

. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences. S 63 Lecture 8 2/2/26 Lecturer Lillian Lee Scribes Peter Babinski, Davi Lin Basic Language Moeling Approach I. Special ase of LM-base Approach a. Recap of Formulas an Terms b. Fixing θ? c. About that Multinomial

More information

Optimal LQR Control of Structures using Linear Modal Model

Optimal LQR Control of Structures using Linear Modal Model Optimal LQR Control of Structures using Linear Moal Moel I. Halperin,2, G. Agranovich an Y. Ribakov 2 Department of Electrical an Electronics Engineering 2 Department of Civil Engineering Faculty of Engineering,

More information

A new approach to explicit MPC using self-optimizing control

A new approach to explicit MPC using self-optimizing control 28 American Control Conference Westin Seattle Hotel, Seattle, Washington, USA June -3, 28 WeA3.2 A new approach to explicit MPC using self-optimizing control Henrik Manum, Sriharakumar Narasimhan an Sigur

More information

Sparse Reconstruction of Systems of Ordinary Differential Equations

Sparse Reconstruction of Systems of Ordinary Differential Equations Sparse Reconstruction of Systems of Orinary Differential Equations Manuel Mai a, Mark D. Shattuck b,c, Corey S. O Hern c,a,,e, a Department of Physics, Yale University, New Haven, Connecticut 06520, USA

More information

Implicit Differentiation

Implicit Differentiation Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,

More information

Analytic Scaling Formulas for Crossed Laser Acceleration in Vacuum

Analytic Scaling Formulas for Crossed Laser Acceleration in Vacuum October 6, 4 ARDB Note Analytic Scaling Formulas for Crosse Laser Acceleration in Vacuum Robert J. Noble Stanfor Linear Accelerator Center, Stanfor University 575 San Hill Roa, Menlo Park, California 945

More information

Unit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule

Unit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule Unit # - Families of Functions, Taylor Polynomials, l Hopital s Rule Some problems an solutions selecte or aapte from Hughes-Hallett Calculus. Critical Points. Consier the function f) = 54 +. b) a) Fin

More information

Lecture 10: Logistic growth models #2

Lecture 10: Logistic growth models #2 Lecture 1: Logistic growth moels #2 Fugo Takasu Dept. Information an Computer Sciences Nara Women s University takasu@ics.nara-wu.ac.jp 6 July 29 1 Analysis of the stochastic process of logistic growth

More information

Proof of SPNs as Mixture of Trees

Proof of SPNs as Mixture of Trees A Proof of SPNs as Mixture of Trees Theorem 1. If T is an inuce SPN from a complete an ecomposable SPN S, then T is a tree that is complete an ecomposable. Proof. Argue by contraiction that T is not a

More information

Perturbation Analysis and Optimization of Stochastic Flow Networks

Perturbation Analysis and Optimization of Stochastic Flow Networks IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. XX, NO. Y, MMM 2004 1 Perturbation Analysis an Optimization of Stochastic Flow Networks Gang Sun, Christos G. Cassanras, Yorai Wari, Christos G. Panayiotou,

More information

Hyperbolic Systems of Equations Posed on Erroneous Curved Domains

Hyperbolic Systems of Equations Posed on Erroneous Curved Domains Hyperbolic Systems of Equations Pose on Erroneous Curve Domains Jan Norström a, Samira Nikkar b a Department of Mathematics, Computational Mathematics, Linköping University, SE-58 83 Linköping, Sween (

More information

Robust Low Rank Kernel Embeddings of Multivariate Distributions

Robust Low Rank Kernel Embeddings of Multivariate Distributions Robust Low Rank Kernel Embeings of Multivariate Distributions Le Song, Bo Dai College of Computing, Georgia Institute of Technology lsong@cc.gatech.eu, boai@gatech.eu Abstract Kernel embeing of istributions

More information

arxiv:nlin/ v1 [nlin.cd] 21 Mar 2002

arxiv:nlin/ v1 [nlin.cd] 21 Mar 2002 Entropy prouction of iffusion in spatially perioic eterministic systems arxiv:nlin/0203046v [nlin.cd] 2 Mar 2002 J. R. Dorfman, P. Gaspar, 2 an T. Gilbert 3 Department of Physics an Institute for Physical

More information

Function Spaces. 1 Hilbert Spaces

Function Spaces. 1 Hilbert Spaces Function Spaces A function space is a set of functions F that has some structure. Often a nonparametric regression function or classifier is chosen to lie in some function space, where the assume structure

More information

Damage identification based on incomplete modal data and constrained nonlinear multivariable function

Damage identification based on incomplete modal data and constrained nonlinear multivariable function Journal of Physics: Conference Series PAPER OPEN ACCESS Damage ientification base on incomplete moal ata an constraine nonlinear multivariable function To cite this article: S S Kourehli 215 J. Phys.:

More information

State-Space Model for a Multi-Machine System

State-Space Model for a Multi-Machine System State-Space Moel for a Multi-Machine System These notes parallel section.4 in the text. We are ealing with classically moele machines (IEEE Type.), constant impeance loas, an a network reuce to its internal

More information

Applications of the Wronskian to ordinary linear differential equations

Applications of the Wronskian to ordinary linear differential equations Physics 116C Fall 2011 Applications of the Wronskian to orinary linear ifferential equations Consier a of n continuous functions y i (x) [i = 1,2,3,...,n], each of which is ifferentiable at least n times.

More information

Optimization of Geometries by Energy Minimization

Optimization of Geometries by Energy Minimization Optimization of Geometries by Energy Minimization by Tracy P. Hamilton Department of Chemistry University of Alabama at Birmingham Birmingham, AL 3594-140 hamilton@uab.eu Copyright Tracy P. Hamilton, 1997.

More information

Many problems in physics, engineering, and chemistry fall in a general class of equations of the form. d dx. d dx

Many problems in physics, engineering, and chemistry fall in a general class of equations of the form. d dx. d dx Math 53 Notes on turm-liouville equations Many problems in physics, engineering, an chemistry fall in a general class of equations of the form w(x)p(x) u ] + (q(x) λ) u = w(x) on an interval a, b], plus

More information

Domain Decomposition and Model Reduction of Systems with Local Nonlinearities

Domain Decomposition and Model Reduction of Systems with Local Nonlinearities Domain Decomposition an Moel Reuction of Systems with Local Nonlinearities Kai Sun, Rolan Glowinsi, Matthias Heinenschloss, an Danny C. Sorensen Abstract The goal of this paper is to combine balance truncation

More information

SYNCHRONOUS SEQUENTIAL CIRCUITS

SYNCHRONOUS SEQUENTIAL CIRCUITS CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents

More information

Hyperbolic Moment Equations Using Quadrature-Based Projection Methods

Hyperbolic Moment Equations Using Quadrature-Based Projection Methods Hyperbolic Moment Equations Using Quarature-Base Projection Methos J. Koellermeier an M. Torrilhon Department of Mathematics, RWTH Aachen University, Aachen, Germany Abstract. Kinetic equations like the

More information

Advanced Partial Differential Equations with Applications

Advanced Partial Differential Equations with Applications MIT OpenCourseWare http://ocw.mit.eu 18.306 Avance Partial Differential Equations with Applications Fall 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.eu/terms.

More information

A simplified macroscopic urban traffic network model for model-based predictive control

A simplified macroscopic urban traffic network model for model-based predictive control Delft University of Technology Delft Center for Systems an Control Technical report 9-28 A simplifie macroscopic urban traffic network moel for moel-base preictive control S. Lin, B. De Schutter, Y. Xi,

More information

Laplacian Cooperative Attitude Control of Multiple Rigid Bodies

Laplacian Cooperative Attitude Control of Multiple Rigid Bodies Laplacian Cooperative Attitue Control of Multiple Rigi Boies Dimos V. Dimarogonas, Panagiotis Tsiotras an Kostas J. Kyriakopoulos Abstract Motivate by the fact that linear controllers can stabilize the

More information

One-dimensional I test and direction vector I test with array references by induction variable

One-dimensional I test and direction vector I test with array references by induction variable Int. J. High Performance Computing an Networking, Vol. 3, No. 4, 2005 219 One-imensional I test an irection vector I test with array references by inuction variable Minyi Guo School of Computer Science

More information

TIME-DELAY ESTIMATION USING FARROW-BASED FRACTIONAL-DELAY FIR FILTERS: FILTER APPROXIMATION VS. ESTIMATION ERRORS

TIME-DELAY ESTIMATION USING FARROW-BASED FRACTIONAL-DELAY FIR FILTERS: FILTER APPROXIMATION VS. ESTIMATION ERRORS TIME-DEAY ESTIMATION USING FARROW-BASED FRACTIONA-DEAY FIR FITERS: FITER APPROXIMATION VS. ESTIMATION ERRORS Mattias Olsson, Håkan Johansson, an Per öwenborg Div. of Electronic Systems, Dept. of Electrical

More information

Closed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device

Closed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device Close an Open Loop Optimal Control of Buffer an Energy of a Wireless Device V. S. Borkar School of Technology an Computer Science TIFR, umbai, Inia. borkar@tifr.res.in A. A. Kherani B. J. Prabhu INRIA

More information

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5

More information

Capacity Analysis of MIMO Systems with Unknown Channel State Information

Capacity Analysis of MIMO Systems with Unknown Channel State Information Capacity Analysis of MIMO Systems with Unknown Channel State Information Jun Zheng an Bhaskar D. Rao Dept. of Electrical an Computer Engineering University of California at San Diego e-mail: juzheng@ucs.eu,

More information

The total derivative. Chapter Lagrangian and Eulerian approaches

The total derivative. Chapter Lagrangian and Eulerian approaches Chapter 5 The total erivative 51 Lagrangian an Eulerian approaches The representation of a flui through scalar or vector fiels means that each physical quantity uner consieration is escribe as a function

More information

The Exact Form and General Integrating Factors

The Exact Form and General Integrating Factors 7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily

More information

THE ACCURATE ELEMENT METHOD: A NEW PARADIGM FOR NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS

THE ACCURATE ELEMENT METHOD: A NEW PARADIGM FOR NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS THE PUBISHING HOUSE PROCEEDINGS O THE ROMANIAN ACADEMY, Series A, O THE ROMANIAN ACADEMY Volume, Number /, pp. 6 THE ACCURATE EEMENT METHOD: A NEW PARADIGM OR NUMERICA SOUTION O ORDINARY DIERENTIA EQUATIONS

More information

Cascaded redundancy reduction

Cascaded redundancy reduction Network: Comput. Neural Syst. 9 (1998) 73 84. Printe in the UK PII: S0954-898X(98)88342-5 Cascae reunancy reuction Virginia R e Sa an Geoffrey E Hinton Department of Computer Science, University of Toronto,

More information

The Three-dimensional Schödinger Equation

The Three-dimensional Schödinger Equation The Three-imensional Schöinger Equation R. L. Herman November 7, 016 Schröinger Equation in Spherical Coorinates We seek to solve the Schröinger equation with spherical symmetry using the metho of separation

More information

Optimal Variable-Structure Control Tracking of Spacecraft Maneuvers

Optimal Variable-Structure Control Tracking of Spacecraft Maneuvers Optimal Variable-Structure Control racking of Spacecraft Maneuvers John L. Crassiis 1 Srinivas R. Vaali F. Lanis Markley 3 Introuction In recent years, much effort has been evote to the close-loop esign

More information

Exam 2 Review Solutions

Exam 2 Review Solutions Exam Review Solutions 1. True or False, an explain: (a) There exists a function f with continuous secon partial erivatives such that f x (x, y) = x + y f y = x y False. If the function has continuous secon

More information

A new proof of the sharpness of the phase transition for Bernoulli percolation on Z d

A new proof of the sharpness of the phase transition for Bernoulli percolation on Z d A new proof of the sharpness of the phase transition for Bernoulli percolation on Z Hugo Duminil-Copin an Vincent Tassion October 8, 205 Abstract We provie a new proof of the sharpness of the phase transition

More information

Error Floors in LDPC Codes: Fast Simulation, Bounds and Hardware Emulation

Error Floors in LDPC Codes: Fast Simulation, Bounds and Hardware Emulation Error Floors in LDPC Coes: Fast Simulation, Bouns an Harware Emulation Pamela Lee, Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Borivoje Nikolic, an Martin J. Wainwright EECS Department University of

More information

Define each term or concept.

Define each term or concept. Chapter Differentiation Course Number Section.1 The Derivative an the Tangent Line Problem Objective: In this lesson you learne how to fin the erivative of a function using the limit efinition an unerstan

More information

Local Input-to-State Stabilization of 1-D Linear Reaction-Diffusion Equation with Bounded Feedback

Local Input-to-State Stabilization of 1-D Linear Reaction-Diffusion Equation with Bounded Feedback Local Input-to-State Stabilization of -D Linear Reaction-Diffusion Equation with Boune Feeback Aneel Tanwani, Swann Marx, Christophe Prieur To cite this version: Aneel Tanwani, Swann Marx, Christophe Prieur.

More information

Nested Saturation with Guaranteed Real Poles 1

Nested Saturation with Guaranteed Real Poles 1 Neste Saturation with Guarantee Real Poles Eric N Johnson 2 an Suresh K Kannan 3 School of Aerospace Engineering Georgia Institute of Technology, Atlanta, GA 3332 Abstract The global stabilization of asymptotically

More information

Witten s Proof of Morse Inequalities

Witten s Proof of Morse Inequalities Witten s Proof of Morse Inequalities by Igor Prokhorenkov Let M be a smooth, compact, oriente manifol with imension n. A Morse function is a smooth function f : M R such that all of its critical points

More information

WUCHEN LI AND STANLEY OSHER

WUCHEN LI AND STANLEY OSHER CONSTRAINED DYNAMICAL OPTIMAL TRANSPORT AND ITS LAGRANGIAN FORMULATION WUCHEN LI AND STANLEY OSHER Abstract. We propose ynamical optimal transport (OT) problems constraine in a parameterize probability

More information

Euler equations for multiple integrals

Euler equations for multiple integrals Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................

More information

The Principle of Least Action and Designing Fiber Optics

The Principle of Least Action and Designing Fiber Optics University of Southampton Department of Physics & Astronomy Year 2 Theory Labs The Principle of Least Action an Designing Fiber Optics 1 Purpose of this Moule We will be intereste in esigning fiber optic

More information

Physics 2212 GJ Quiz #4 Solutions Fall 2015

Physics 2212 GJ Quiz #4 Solutions Fall 2015 Physics 2212 GJ Quiz #4 Solutions Fall 215 I. (17 points) The magnetic fiel at point P ue to a current through the wire is 5. µt into the page. The curve portion of the wire is a semicircle of raius 2.

More information

Experimental Robustness Study of a Second-Order Sliding Mode Controller

Experimental Robustness Study of a Second-Order Sliding Mode Controller Experimental Robustness Stuy of a Secon-Orer Sliing Moe Controller Anré Blom, Bram e Jager Einhoven University of Technology Department of Mechanical Engineering P.O. Box 513, 5600 MB Einhoven, The Netherlans

More information

A Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential

A Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential Avances in Applie Mathematics an Mechanics Av. Appl. Math. Mech. Vol. 1 No. 4 pp. 573-580 DOI: 10.4208/aamm.09-m0946 August 2009 A Note on Exact Solutions to Linear Differential Equations by the Matrix

More information