Supplementary material for Continuous-action planning for discounted infinite-horizon nonlinear optimal control with Lipschitz values
|
|
- Regina Quinn
- 5 years ago
- Views:
Transcription
1 Supplementary material or Continuous-action planning or discounted ininite-horizon nonlinear optimal control with Lipschitz values List o main notations x, X, u, U state, state space, action, action space, u dynamics, sequence o actions γ, r, ρ, v discount actor, reward, reward cn., value L,L ρ,l v Lipschitz constants o respective cns. U box in the space o action sequences i,k;i,k box and dimension indices; selected indices K number o discretized box dimensions µ, d action interval, interval length n computation budget M number o subintervals or splitting T, T, L tree, near-optimal tree, set o leaves h,s depth in tree, number o splits bi), δi) b-value, diameter o box i m branching actor o near-optimal tree h max n) maximum depth unction, c, C constants O ),Õ ) bounded by up to const., log. terms ceiling smallest integer still larger than ) diag[ ] diagonal matrix with on diagonal A Proos Proo o Lemma 3: We will prove the inequality rom the theorem or any two sequences u and u, which directly implies it or the particular case u = u rom 3). Denote by x k, x k, r k, r k or k the state and reward trajectories generated by the two sequences, with x = x. Then, by induction: k 1 x k x k Indeed, at k = 1, we have: j= L k j uj u j A.1) x 1 x 1 L x x + u u ) = L u u and assuming the relation holds at k 1, we get: x k x k L xk 1 x k 1 + uk 1 u k 1 ) k L j= L k 1 j equivalent to A.1). Then: uj u j + L uk 1 u k 1 vu ) vu ) γ k r k r k γ k L ρ x k x k + u k u k ) L ρ γ k k j= L k j u j u j = L ρ u k u k γ k+j L j L ρ = 1 γl j= γ k u k u k Here, we used the Lipschitz continuity o ρ, and then applied A.1). The three equalities simply rewrite the right hand side, isolating the contribution o each u k u k ; the middle equality swaps indices k and j, and can be veriied by writing out explicitly the summations. The last step holds because γl < 1. Thus the inequality is proven with L v = Lρ 1 γl. Proo o Theorem 6: Our goal is to ind an upper bound or the diameter o an arbitrary box i at some depth h. Since we deal with this single box, we will omit its index i or most o the derivation. Indeed, due to dimension selection 7), all the boxes at a given depth have the same shape. Recall unction sk), the number o splits per dimension k, which is clearly decreasing, see Fig. A.1 or an example. In addition s decreases in steps o at most 1. To see this, consider k like in the igure, the irst dimension in a constant-s range, which will always be preerred to later dimensions in the same range. To increase the gap to, dimension k 1 must be expanded beore k, which means γ k 1 M sk)+1) γ k M sk), or M 1/γ. This contradicts Assumption 5ii). Denote now the lengths o the ranges in s by, 1,..., N where N is the last, ininitely long range where s =. Let j be the index o the range starting with k. By direct computation like above, we ind that i node k is expanded: j log M log 1/γ, j 1 < log M log 1/γ i j 1 A.) Recall that = log M log 1/γ, so A.) implies j, j 1 < 1. Keeping in mind that s and so N, j ) depend on h, we prove by induction that at any depth h, we have: j { 1,} N = or 1 j < N A.3)
2 For any, the irst h = 3 + are done in the same order, shown in the igure. To see this, consider any step and try to expand any other dimension; one inds that A.) is violated. Clearly any unction s so ar obeys A.3). Consider now an arbitrary h 3+ that satisies A.3). To study h + 1, our cases must be considered or the next expanded dimension, denoted a)-d) inside dotted squares in the igure. Call the next unction s, with N ranges j. Case a): Since k = 1 is expanded, = due to A.), A.3). Hence = 1, 1 = 1, and later ranges remain unchanged. Case b): We must have 1, 1 =. Hence,, 1 = 1, and the later ranges are unchanged. Case c): Some arbitrary k in some range 1 < j < N is expanded. We must have j 1 =, j = 1, leading to j 1 = 1, j =, and the other ranges remain the same. Case d): Finally, when the irst undiscretized dimension K is split, we have N 1 = 1, N =, leading to N = N, N 1 =, N =, with no change to the prior ranges. In all cases, the new unction satisies A.3), so the induction is complete. The next step is to ind, or ixed h, a lower bound on sk) under constraints 4), A.3). I the length K o the box is number o splits s k) a 3+1 b j-1 { k c j { d K dimension Fig. A.1. An example o a split unction is shown as a thick black line. The irst unsplit dimension is K, and a dimension k is highlighted with the constant-s ranges to its let and right, j 1 and j. Each square at a certain value o k indicates a split o dimension k, and the squares stack together to obtain sk). The irst 3 + splits, shown on the bottom-let, always occur in the same order, indicated by indices inside the squares. The dotted squares above sk) indicate possibilities or the next split o sk). number o splits s 1 s K... s K -1-1 K K K dimension Fig. A.. Various split unction bounds used in the proo, see there or their meaning. Dotted: s K or arbitrary K; gray: s yielding K; dashed: s K where K K. ixed and 4) is ignored thereby relaxing the problem), then a lower bound s K on any unction or this K is obtained by illing in s with ranges o ; see Fig. A.. Now s K k) is decreasing with K or any k, so we must ind a lower bound on K, denoted K. To this end, we ill in a unction s with all ranges o 1, except which is equal to 1, see again Fig. A.; while imposing a relaxed version o 4), namely h sk). Denote N the number o ranges in s, then by explicit computation we get: h sk) = N 1)N 1)+N rom which we get N computation and replacing N: h 1 N + 1) 1) 1 =: N. Again by K = + N 1) 1) 4 + h 1) =: K K k Since s K = K k or k < K, we inally obtain a lower-bound split unction as s K, which at k < K is explicitly: s K = and or k K. h 1 k + 4/ ) To complete the proo, we use this unction in the diameter ormula: δi) = L v γ k M sk) K 1 L v γ k M s K + γk 1 γ [ L ] h v c 1 h 1)M 1 + c γ h 1 c h 1)γ h 1 where we have omitted some tedious derivations. An intermediate step was highlighted to show that some conservativeness is introduced in the tail term, notably by decreasing its rate o convergence via the division by. Here, c 1,c,c denote positive constants whose value is not important in the asymptotic analysis. Proo o Lemma 8: For the irst part, consider any iteration t, and denote by i t the box expanded at this iteration. Since the lea boxes on the current tree T cover the entire space, there exists a lea box j containing an optimal solution, or which bj) v by 6). As the expanded box i t is selected by maximizing the b-value,
3 bi t ) bj) v. Further, vi t ) + δ h bi t ), where h is the depth o i t, and thereore inally i t T. For the second part, among the descendants o i t there exists a lea j on the inal tree so that vj) vi t ), due to Assumption 5i). Since û maximizes the value among the leaves, vû) vj) vi t ). Combining this with bi t ) v rom the irst part, we get v vû)) bi t ) vi t ) = δi t ). Since this holds at any iteration, the bound δ min = min t δi t ) ollows. Proo o Theorem 9: For a given budget n the branching actor is used to iner a lower bound on the depth reached by OPC. For m > 1, take the smallest depth h so that Cm h+1 Mh n. The let-hand side is chosen since there are less than Cm h+1 nodes in the explored tree up to depth h, and each o them takes at most Mh computation to expand, see Fig. A.3. Thereore, we are sure h h T T h * up to up to Cm h Cm h+1 nodes nodes total M trajectories, h steps Fig. A.3. To reach depth h, at most Cm h nodes must be expanded on T h at depths h h, or a total o Cm h+1. Each o these expansions requires, at worst, simulating M trajectories with h steps. that at least a node at depth h min = h 1 has been expanded, and by solving the inequality we get ater some computation: h min log n log lognα)β log m log m or α,β > and suiciently large n. Replacing this in the ormula or δ hmin, we obtain: δ min δ hmin 1) log n 1 log m 1 γ )ˆ 1 1) log n log m 1 γ )ˆ 1 [ log n log lognα)β log m log m log lognα) β log m log lognα) β log m ) ] ) 1) log n γ log m [lognα)] β 1) log n log m where β > is a constant and we temporarily use notation zˆy = z y or readability. In the second step, the square root can be split in this way or suiciently large n; then we show that the second term enters in act the logarithmic, negligible part o the expression. When m = 1, take the smallest h so that Ch M n. Since at most C nodes must be expanded at each depth, this guarantees that some node was expanded at depth h min n/mc 1. Replacing this in the diameter ormula leads to the desired result. Note that we did not make explicit the term h min 1) in the diameter bounds. However, trivial upper bounds or h min are on the order o log n in the irst case since a tree with branching actor greater than 1 must asymptotically be explored, larger depths than this cannot be reached), and n in the second case. Both o these remain in the logarithmic part o the bound. Proo o Lemma 1: Consider one top-level loop o SOPC in Alg., and denote the number o elapsed such loops by l. The major part o the proo will be to show by induction that, or any h h max n), i l C h h =, mh then at least a box tree node) containing an optimal sequence at h has been expanded. For the base case, i l Cm 1, then the root has been expanded, and it contains the optimal solution by deinition. Take now an arbitrary h < h max n), and deine l h to be the loop where the irst node i h at h that contains an optimal solution was expanded. By the induction hypothesis, l h C h h =. Node i mh h has itsel some child i h+1 that contains an optimal solution. Note that another optimal node i h+1 may be expanded beore this particular child; we will be interested in i h+1 below.) Consider now any iteration l h +l where some other node i h+1, dierent rom i h+1, is expanded at depth h + 1. Then it must be that: vi h+1) vi h+1 ) v δi h+1 ) v δ h+1 where the middle inequality holds because i h+1 contains an optimal solution. But then i h+1 T h+1, and since there are at most Cm h+1 nodes in this set, including i h+1 which was not yet expanded, it means at most Cm h+1 1 loops can pass beore i h+1 must be expanded. Thus the loop l h+1 where i h+1 is expanded is, at worst, l h + Cm h+1 C h+1 h = mh, and the induction is proven. Observe next that each loop l expands at most h max n) nodes, where each node expansion takes at most
4 Mh max n) model calls. Then, by combining this with the bound on l obtained above, the algorithm is sure to expand an optimal node at hn) when this is smaller than h max n) or, when hn) > h max n), it expands an optimal node at h max n). Thus inally it expands some optimal node i h at h, and thereore the solution returned by SOPC satisies: vi ) vi h) v δ h and inally: δ h 1 [ { } ] 3 ) 1 n min CM,1 1 n 1/6 1 min { 1 CM,1})) which is the desired result. i.e. it is δ h -optimal. Note that here we streamlined the proo o the SOO depth bound rom [18] so as to take advantage o the act that, unlike SOO, SOPC always expands a ull path down to h max n). Proo o Theorem 11: Consider irst m > 1. Since hn) is the smallest or which 8) holds, we have: hn) 1 n > CMh maxn) m h = CMh maxn) mhn) 1 Thereore: h = hn) < 1 log m log [ n) CMh maxn) + 1] < c 3 log n 1 ε or some constant c 3 >, where h max n) = n ε was used. Thus hn) is logarithmic in n and, or large n, smaller than h max n) since the latter is a power o n. Thus, or large n, h = hn) in Lemma 1. Similarly solving 8) or a lower bound on hn), we get: hn) 1 log m log [ n) ] 1 CMh maxn) = 1 [ log n 1 ε log ecm ] log m and plugging this into δ hn) : δ hn) 1 log m 1)1 ε)log n log m [ log n 1 ε log ecm ) ] ) where the elimination o the subtracted term holds due to n being large. By Lemma 1 this is also the nearoptimality o the algorithm. When m = 1, 8) becomes simply CMh max n)hn) + 1) n, leading via h max n) = n 1/3 to hn) 3 n CM 1. Thereore { 3 } { } n h = min CM 1, 3 n 3 1 n min CM,1 1 B Execution time o planning algorithms Fig. B.1 shows the execution time o the planning algorithms evaluated in Sec. 5 o the main paper. These results conirm the expectation that the budget n is the most important actor: the execution time is very close to linear in n, with minor dierences between the algorithms due to their varying overhead o e.g. searching the tree in dierent ways. SOPC is the astest. planning time [s] SOPC, planning time OPC, planning time LP, planning time SOOP, planning time n Fig. B.1. Runtime o one call to the planner, averaged over the 5 steps in the trajectory. C Extension o SOPC to multiple actions Although our analysis does not cover it, we briely illustrate an extension o SOPC to control actions. Here, each time step k is associated with intervals rather than just 1. The idea is simple: boxes and steps k are selected or expansion using the same rules as in SOPC, but when a box must be expanded along step k, we split both intervals into M pieces, leading to M = 9 child boxes. More reined rules could be given that avoid this direct exponential growth with the number o inputs. To evaluate this extension, we use the rotational pendulum system rom Sec. 5 o the main paper, but a second motor is added to the vertical joint o the pendulum. This motor has the same viscous damping and torque constant as the irst one, but its model is simpliied in that the torque is linearly related to the voltage u [ 9,9] V, rather than dynamically like or the irst motor. The unnormalized reward unction is x diag[.5,.5,1,.5]x u diag[.,.]u. The C++ implementation o SOPC is used with a budget n = and ε =.33 in h max. The resulting trajectory rom the pointing-down state is shown in Fig. C.1. The angles are approximately stabilized, although with worse perormance and larger input adjustments than
5 r α, α 5 5 α [rad] α [rad/s] θ [rad] θ [rad/s] θ, θ u u 1 [V] u [V] k T s Fig. C.1. Two-input trajectory. in the single-input case, since this simple extension has exponential complexity in the number o actions and we increased the budget less than quadratically).
Problem Set. Problems on Unordered Summation. Math 5323, Fall Februray 15, 2001 ANSWERS
Problem Set Problems on Unordered Summation Math 5323, Fall 2001 Februray 15, 2001 ANSWERS i 1 Unordered Sums o Real Terms In calculus and real analysis, one deines the convergence o an ininite series
More informationDefinition: Let f(x) be a function of one variable with continuous derivatives of all orders at a the point x 0, then the series.
2.4 Local properties o unctions o several variables In this section we will learn how to address three kinds o problems which are o great importance in the ield o applied mathematics: how to obtain the
More informationFigure 1: Bayesian network for problem 1. P (A = t) = 0.3 (1) P (C = t) = 0.6 (2) Table 1: CPTs for problem 1. (c) P (E B) C P (D = t) f 0.9 t 0.
Probabilistic Artiicial Intelligence Problem Set 3 Oct 27, 2017 1. Variable elimination In this exercise you will use variable elimination to perorm inerence on a bayesian network. Consider the network
More informationMaximum Flow. Reading: CLRS Chapter 26. CSE 6331 Algorithms Steve Lai
Maximum Flow Reading: CLRS Chapter 26. CSE 6331 Algorithms Steve Lai Flow Network A low network G ( V, E) is a directed graph with a source node sv, a sink node tv, a capacity unction c. Each edge ( u,
More informationRoberto s Notes on Differential Calculus Chapter 8: Graphical analysis Section 1. Extreme points
Roberto s Notes on Dierential Calculus Chapter 8: Graphical analysis Section 1 Extreme points What you need to know already: How to solve basic algebraic and trigonometric equations. All basic techniques
More informationThe Clifford algebra and the Chevalley map - a computational approach (detailed version 1 ) Darij Grinberg Version 0.6 (3 June 2016). Not proofread!
The Cliord algebra and the Chevalley map - a computational approach detailed version 1 Darij Grinberg Version 0.6 3 June 2016. Not prooread! 1. Introduction: the Cliord algebra The theory o the Cliord
More informationNumerical Methods - Lecture 2. Numerical Methods. Lecture 2. Analysis of errors in numerical methods
Numerical Methods - Lecture 1 Numerical Methods Lecture. Analysis o errors in numerical methods Numerical Methods - Lecture Why represent numbers in loating point ormat? Eample 1. How a number 56.78 can
More informationSTAT 801: Mathematical Statistics. Hypothesis Testing
STAT 801: Mathematical Statistics Hypothesis Testing Hypothesis testing: a statistical problem where you must choose, on the basis o data X, between two alternatives. We ormalize this as the problem o
More informationThe 2nd Texas A&M at Galveston Mathematics Olympiad. September 24, Problems & Solutions
nd Math Olympiad Solutions Problem #: The nd Teas A&M at Galveston Mathematics Olympiad September 4, 00 Problems & Solutions Written by Dr. Lin Qiu A runner passes 5 poles in 30 seconds. How long will
More information( x) f = where P and Q are polynomials.
9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational
More informationTheorem Let J and f be as in the previous theorem. Then for any w 0 Int(J), f(z) (z w 0 ) n+1
(w) Second, since lim z w z w z w δ. Thus, i r δ, then z w =r (w) z w = (w), there exist δ, M > 0 such that (w) z w M i dz ML({ z w = r}) = M2πr, which tends to 0 as r 0. This shows that g = 2πi(w), which
More informationOn High-Rate Cryptographic Compression Functions
On High-Rate Cryptographic Compression Functions Richard Ostertág and Martin Stanek Department o Computer Science Faculty o Mathematics, Physics and Inormatics Comenius University Mlynská dolina, 842 48
More informationFeedback Linearization
Feedback Linearization Peter Al Hokayem and Eduardo Gallestey May 14, 2015 1 Introduction Consider a class o single-input-single-output (SISO) nonlinear systems o the orm ẋ = (x) + g(x)u (1) y = h(x) (2)
More information9.3 Graphing Functions by Plotting Points, The Domain and Range of Functions
9. Graphing Functions by Plotting Points, The Domain and Range o Functions Now that we have a basic idea o what unctions are and how to deal with them, we would like to start talking about the graph o
More information(C) The rationals and the reals as linearly ordered sets. Contents. 1 The characterizing results
(C) The rationals and the reals as linearly ordered sets We know that both Q and R are something special. When we think about about either o these we usually view it as a ield, or at least some kind o
More informationCurve Sketching. The process of curve sketching can be performed in the following steps:
Curve Sketching So ar you have learned how to ind st and nd derivatives o unctions and use these derivatives to determine where a unction is:. Increasing/decreasing. Relative extrema 3. Concavity 4. Points
More information2. ETA EVALUATIONS USING WEBER FUNCTIONS. Introduction
. ETA EVALUATIONS USING WEBER FUNCTIONS Introduction So ar we have seen some o the methods or providing eta evaluations that appear in the literature and we have seen some o the interesting properties
More information( 1) ( 2) ( 1) nan integer, since the potential is no longer simple harmonic.
. Anharmonic Oscillators Michael Fowler Landau (para 8) considers a simple harmonic oscillator with added small potential energy terms mα + mβ. We ll simpliy slightly by dropping the term, to give an equation
More informationSEPARATED AND PROPER MORPHISMS
SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN Last quarter, we introduced the closed diagonal condition or a prevariety to be a prevariety, and the universally closed condition or a variety to be complete.
More informationReview of Prerequisite Skills for Unit # 2 (Derivatives) U2L2: Sec.2.1 The Derivative Function
UL1: Review o Prerequisite Skills or Unit # (Derivatives) Working with the properties o exponents Simpliying radical expressions Finding the slopes o parallel and perpendicular lines Simpliying rational
More informationSupplement for In Search of the Holy Grail: Policy Convergence, Experimentation and Economic Performance Sharun W. Mukand and Dani Rodrik
Supplement or In Search o the Holy Grail: Policy Convergence, Experimentation and Economic Perormance Sharun W. Mukand and Dani Rodrik In what ollows we sketch out the proos or the lemma and propositions
More informationRATIONAL FUNCTIONS. Finding Asymptotes..347 The Domain Finding Intercepts Graphing Rational Functions
RATIONAL FUNCTIONS Finding Asymptotes..347 The Domain....350 Finding Intercepts.....35 Graphing Rational Functions... 35 345 Objectives The ollowing is a list o objectives or this section o the workbook.
More informationDiscrete Mathematics. On the number of graphs with a given endomorphism monoid
Discrete Mathematics 30 00 376 384 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc On the number o graphs with a given endomorphism monoid
More informationEXPANSIONS IN NON-INTEGER BASES: LOWER, MIDDLE AND TOP ORDERS
EXPANSIONS IN NON-INTEGER BASES: LOWER, MIDDLE AND TOP ORDERS NIKITA SIDOROV To the memory o Bill Parry ABSTRACT. Let q (1, 2); it is known that each x [0, 1/(q 1)] has an expansion o the orm x = n=1 a
More information3. Several Random Variables
. Several Random Variables. Two Random Variables. Conditional Probabilit--Revisited. Statistical Independence.4 Correlation between Random Variables. Densit unction o the Sum o Two Random Variables. Probabilit
More informationThu June 16 Lecture Notes: Lattice Exercises I
Thu June 6 ecture Notes: attice Exercises I T. Satogata: June USPAS Accelerator Physics Most o these notes ollow the treatment in the class text, Conte and MacKay, Chapter 6 on attice Exercises. The portions
More informationFluctuationlessness Theorem and its Application to Boundary Value Problems of ODEs
Fluctuationlessness Theorem and its Application to Boundary Value Problems o ODEs NEJLA ALTAY İstanbul Technical University Inormatics Institute Maslak, 34469, İstanbul TÜRKİYE TURKEY) nejla@be.itu.edu.tr
More informationPhysics 742, Standard Model: Homework #8 Solution
Physics 74, Standard Model: Homework #8 Solution Quark masses The isospin-violating ratio o quark masses is given as, Using Eq. (8.63) in the textbook, m u r m d. () m d + m u m =(m ± u + m d ) c, () m
More informationMath 2412 Activity 1(Due by EOC Sep. 17)
Math 4 Activity (Due by EOC Sep. 7) Determine whether each relation is a unction.(indicate why or why not.) Find the domain and range o each relation.. 4,5, 6,7, 8,8. 5,6, 5,7, 6,6, 6,7 Determine whether
More informationSolution of the Synthesis Problem in Hilbert Spaces
Solution o the Synthesis Problem in Hilbert Spaces Valery I. Korobov, Grigory M. Sklyar, Vasily A. Skoryk Kharkov National University 4, sqr. Svoboda 677 Kharkov, Ukraine Szczecin University 5, str. Wielkopolska
More informationFIXED POINTS OF RENORMALIZATION.
FIXED POINTS OF RENORMALIZATION. XAVIER BUFF Abstract. To study the geometry o a Fibonacci map o even degree l 4, Lyubich [Ly2] deined a notion o generalized renormalization, so that is renormalizable
More informationTelescoping Decomposition Method for Solving First Order Nonlinear Differential Equations
Telescoping Decomposition Method or Solving First Order Nonlinear Dierential Equations 1 Mohammed Al-Reai 2 Maysem Abu-Dalu 3 Ahmed Al-Rawashdeh Abstract The Telescoping Decomposition Method TDM is a new
More informationChristoffel symbols and Gauss Theorema Egregium
Durham University Pavel Tumarkin Epiphany 207 Dierential Geometry III, Solutions 5 (Week 5 Christoel symbols and Gauss Theorema Egregium 5.. Show that the Gauss curvature K o the surace o revolution locally
More informationRESOLUTION MSC.362(92) (Adopted on 14 June 2013) REVISED RECOMMENDATION ON A STANDARD METHOD FOR EVALUATING CROSS-FLOODING ARRANGEMENTS
(Adopted on 4 June 203) (Adopted on 4 June 203) ANNEX 8 (Adopted on 4 June 203) MSC 92/26/Add. Annex 8, page THE MARITIME SAFETY COMMITTEE, RECALLING Article 28(b) o the Convention on the International
More informationAnalysis of the regularity, pointwise completeness and pointwise generacy of descriptor linear electrical circuits
Computer Applications in Electrical Engineering Vol. 4 Analysis o the regularity pointwise completeness pointwise generacy o descriptor linear electrical circuits Tadeusz Kaczorek Białystok University
More informationBasic mathematics of economic models. 3. Maximization
John Riley 1 January 16 Basic mathematics o economic models 3 Maimization 31 Single variable maimization 1 3 Multi variable maimization 6 33 Concave unctions 9 34 Maimization with non-negativity constraints
More informationOn a Closed Formula for the Derivatives of e f(x) and Related Financial Applications
International Mathematical Forum, 4, 9, no. 9, 41-47 On a Closed Formula or the Derivatives o e x) and Related Financial Applications Konstantinos Draais 1 UCD CASL, University College Dublin, Ireland
More informationMesa College Math SAMPLES
Mesa College Math 6 - SAMPLES Directions: NO CALCULATOR. Write neatly, show your work and steps. Label your work so it s easy to ollow. Answers without appropriate work will receive NO credit. For inal
More informationChapter 11 Collision Theory
Chapter Collision Theory Introduction. Center o Mass Reerence Frame Consider two particles o masses m and m interacting ia some orce. Figure. Center o Mass o a system o two interacting particles Choose
More informationOPTIMAL PLACEMENT AND UTILIZATION OF PHASOR MEASUREMENTS FOR STATE ESTIMATION
OPTIMAL PLACEMENT AND UTILIZATION OF PHASOR MEASUREMENTS FOR STATE ESTIMATION Xu Bei, Yeo Jun Yoon and Ali Abur Teas A&M University College Station, Teas, U.S.A. abur@ee.tamu.edu Abstract This paper presents
More informationIn the index (pages ), reduce all page numbers by 2.
Errata or Nilpotence and periodicity in stable homotopy theory (Annals O Mathematics Study No. 28, Princeton University Press, 992) by Douglas C. Ravenel, July 2, 997, edition. Most o these were ound by
More informationSEPARATED AND PROPER MORPHISMS
SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN The notions o separatedness and properness are the algebraic geometry analogues o the Hausdor condition and compactness in topology. For varieties over the
More informationObjectives. By the time the student is finished with this section of the workbook, he/she should be able
FUNCTIONS Quadratic Functions......8 Absolute Value Functions.....48 Translations o Functions..57 Radical Functions...61 Eponential Functions...7 Logarithmic Functions......8 Cubic Functions......91 Piece-Wise
More informationAnalysis of Algorithms - Using Asymptotic Bounds -
Analysis of Algorithms - Using Asymptotic Bounds - Andreas Ermedahl MRTC (Mälardalens Real-Time Research Center) andreas.ermedahl@mdh.se Autumn 004 Rehersal: Asymptotic bounds Gives running time bounds
More informationWeb Appendix for The Value of Switching Costs
Web Appendix or The Value o Switching Costs Gary Biglaiser University o North Carolina, Chapel Hill Jacques Crémer Toulouse School o Economics (GREMAQ, CNRS and IDEI) Gergely Dobos Gazdasági Versenyhivatal
More informationStrong Lyapunov Functions for Systems Satisfying the Conditions of La Salle
06 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 49, NO. 6, JUNE 004 Strong Lyapunov Functions or Systems Satisying the Conditions o La Salle Frédéric Mazenc and Dragan Ne sić Abstract We present a construction
More informationAlgebra II Notes Inverse Functions Unit 1.2. Inverse of a Linear Function. Math Background
Algebra II Notes Inverse Functions Unit 1. Inverse o a Linear Function Math Background Previously, you Perormed operations with linear unctions Identiied the domain and range o linear unctions In this
More informationLeast-Squares Spectral Analysis Theory Summary
Least-Squares Spectral Analysis Theory Summary Reerence: Mtamakaya, J. D. (2012). Assessment o Atmospheric Pressure Loading on the International GNSS REPRO1 Solutions Periodic Signatures. Ph.D. dissertation,
More information1 Relative degree and local normal forms
THE ZERO DYNAMICS OF A NONLINEAR SYSTEM 1 Relative degree and local normal orms The purpose o this Section is to show how single-input single-output nonlinear systems can be locally given, by means o a
More informationit simpliies the notation, we write unary unction symbols without parenthesis, e.g., h((h(x);a)) would be written as h(hx; a). By s[t] we indicate tha
Fast Algorithms or Uniorm Semi-Uniication Alberto Oliart Λ Laboratorio Nacional de Inormática Avanzada, A.C. Rébsamen 8, Xalapa, Veracruz, Mexico aoliart@lania.mx Wayne Snyder Boston University Computer
More informationPhysics 5153 Classical Mechanics. Solution by Quadrature-1
October 14, 003 11:47:49 1 Introduction Physics 5153 Classical Mechanics Solution by Quadrature In the previous lectures, we have reduced the number o eective degrees o reedom that are needed to solve
More information8.4 Inverse Functions
Section 8. Inverse Functions 803 8. Inverse Functions As we saw in the last section, in order to solve application problems involving eponential unctions, we will need to be able to solve eponential equations
More informationSIO 211B, Rudnick. We start with a definition of the Fourier transform! ĝ f of a time series! ( )
SIO B, Rudnick! XVIII.Wavelets The goal o a wavelet transorm is a description o a time series that is both requency and time selective. The wavelet transorm can be contrasted with the well-known and very
More informationMath 754 Chapter III: Fiber bundles. Classifying spaces. Applications
Math 754 Chapter III: Fiber bundles. Classiying spaces. Applications Laurențiu Maxim Department o Mathematics University o Wisconsin maxim@math.wisc.edu April 18, 2018 Contents 1 Fiber bundles 2 2 Principle
More informationVALUATIVE CRITERIA BRIAN OSSERMAN
VALUATIVE CRITERIA BRIAN OSSERMAN Intuitively, one can think o separatedness as (a relative version o) uniqueness o limits, and properness as (a relative version o) existence o (unique) limits. It is not
More informationAP Calculus Notes: Unit 1 Limits & Continuity. Syllabus Objective: 1.1 The student will calculate limits using the basic limit theorems.
Syllabus Objective:. The student will calculate its using the basic it theorems. LIMITS how the outputs o a unction behave as the inputs approach some value Finding a Limit Notation: The it as approaches
More informationOnline Appendix: The Continuous-type Model of Competitive Nonlinear Taxation and Constitutional Choice by Massimo Morelli, Huanxing Yang, and Lixin Ye
Online Appendix: The Continuous-type Model o Competitive Nonlinear Taxation and Constitutional Choice by Massimo Morelli, Huanxing Yang, and Lixin Ye For robustness check, in this section we extend our
More informationVALUATIVE CRITERIA FOR SEPARATED AND PROPER MORPHISMS
VALUATIVE CRITERIA FOR SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN Recall that or prevarieties, we had criteria or being a variety or or being complete in terms o existence and uniqueness o limits, where
More informationThe First-Order Theory of Ordering Constraints over Feature Trees
Discrete Mathematics and Theoretical Computer Science 4, 2001, 193 234 The First-Order Theory o Ordering Constraints over Feature Trees Martin Müller 1 and Joachim Niehren 1 and Ral Treinen 2 1 Programming
More informationOn Picard value problem of some difference polynomials
Arab J Math 018 7:7 37 https://doiorg/101007/s40065-017-0189-x Arabian Journal o Mathematics Zinelâabidine Latreuch Benharrat Belaïdi On Picard value problem o some dierence polynomials Received: 4 April
More informationIntroduction to Algorithms
Introduction to Algorithms, Lecture 5 // Introduction to Algorithms 6.46J/.4J LECTURE Shortest Paths I Properties o shortest paths Dijkstra s Correctness Analysis Breadth-irst Pro. Manolis Kellis March,
More informationSyllabus Objective: 2.9 The student will sketch the graph of a polynomial, radical, or rational function.
Precalculus Notes: Unit Polynomial Functions Syllabus Objective:.9 The student will sketch the graph o a polynomial, radical, or rational unction. Polynomial Function: a unction that can be written in
More informationLecture 8 Optimization
4/9/015 Lecture 8 Optimization EE 4386/5301 Computational Methods in EE Spring 015 Optimization 1 Outline Introduction 1D Optimization Parabolic interpolation Golden section search Newton s method Multidimensional
More informationFeedback Linearization Lectures delivered at IIT-Kanpur, TEQIP program, September 2016.
Feedback Linearization Lectures delivered at IIT-Kanpur, TEQIP program, September 216 Ravi N Banavar banavar@iitbacin September 24, 216 These notes are based on my readings o the two books Nonlinear Control
More informationm f f unchanged under the field redefinition (1), the complex mass matrix m should transform into
PHY 396 T: SUSY Solutions or problem set #8. Problem (a): To keep the net quark mass term L QCD L mass = ψ α c m ψ c α + hermitian conjugate (S.) unchanged under the ield redeinition (), the complex mass
More informationFinger Search in the Implicit Model
Finger Search in the Implicit Model Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen MADALGO, Department o Computer Science, Aarhus University, Denmark. {gerth,jasn,jakobt}@madalgo.au.dk Abstract.
More informationScattering of Solitons of Modified KdV Equation with Self-consistent Sources
Commun. Theor. Phys. Beijing, China 49 8 pp. 89 84 c Chinese Physical Society Vol. 49, No. 4, April 5, 8 Scattering o Solitons o Modiied KdV Equation with Sel-consistent Sources ZHANG Da-Jun and WU Hua
More informationOn the Girth of (3,L) Quasi-Cyclic LDPC Codes based on Complete Protographs
On the Girth o (3,L) Quasi-Cyclic LDPC Codes based on Complete Protographs Sudarsan V S Ranganathan, Dariush Divsalar and Richard D Wesel Department o Electrical Engineering, University o Caliornia, Los
More informationProduct Matrix MSR Codes with Bandwidth Adaptive Exact Repair
1 Product Matrix MSR Codes with Bandwidth Adaptive Exact Repair Kaveh Mahdaviani, Soheil Mohajer, and Ashish Khisti ECE Dept, University o Toronto, Toronto, ON M5S3G4, Canada ECE Dept, University o Minnesota,
More information9.1 The Square Root Function
Section 9.1 The Square Root Function 869 9.1 The Square Root Function In this section we turn our attention to the square root unction, the unction deined b the equation () =. (1) We begin the section
More informationELEG 3143 Probability & Stochastic Process Ch. 4 Multiple Random Variables
Department o Electrical Engineering University o Arkansas ELEG 3143 Probability & Stochastic Process Ch. 4 Multiple Random Variables Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Two discrete random variables
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Processing Pro. Mark Fowler Note Set #10 Fourier Analysis or DT Signals eading Assignment: Sect. 4.2 & 4.4 o Proakis & Manolakis Much o Ch. 4 should be review so you are expected
More informationExponential and Logarithmic. Functions CHAPTER The Algebra of Functions; Composite
CHAPTER 9 Exponential and Logarithmic Functions 9. The Algebra o Functions; Composite Functions 9.2 Inverse Functions 9.3 Exponential Functions 9.4 Exponential Growth and Decay Functions 9.5 Logarithmic
More informationLecture : Feedback Linearization
ecture : Feedbac inearization Niola Misovic, dipl ing and Pro Zoran Vuic June 29 Summary: This document ollows the lectures on eedbac linearization tought at the University o Zagreb, Faculty o Electrical
More informationScattered Data Approximation of Noisy Data via Iterated Moving Least Squares
Scattered Data Approximation o Noisy Data via Iterated Moving Least Squares Gregory E. Fasshauer and Jack G. Zhang Abstract. In this paper we ocus on two methods or multivariate approximation problems
More information2 Frequency-Domain Analysis
2 requency-domain Analysis Electrical engineers live in the two worlds, so to speak, o time and requency. requency-domain analysis is an extremely valuable tool to the communications engineer, more so
More informationExact Inference: Variable Elimination
Readings: K&F 9.2 9. 9.4 9.5 Exact nerence: Variable Elimination ecture 6-7 Apr 1/18 2011 E 515 tatistical Methods pring 2011 nstructor: u-n ee University o Washington eattle et s revisit the tudent Network
More informationOnline Appendix for Lerner Symmetry: A Modern Treatment
Online Appendix or Lerner Symmetry: A Modern Treatment Arnaud Costinot MIT Iván Werning MIT May 2018 Abstract Tis Appendix provides te proos o Teorem 1, Teorem 2, and Proposition 1. 1 Perect Competition
More informationTHE CAUCHY PROBLEM VIA THE METHOD OF CHARACTERISTICS
THE CAUCHY PROBLEM VIA THE METHOD OF CHARACTERISTICS ARICK SHAO In this short note, we solve the Cauchy, or initial value, problem or general ully nonlinear irst-order PDE. Throughout, our PDE will be
More informationA Simple Explanation of the Sobolev Gradient Method
A Simple Explanation o the Sobolev Gradient Method R. J. Renka July 3, 2006 Abstract We have observed that the term Sobolev gradient is used more oten than it is understood. Also, the term is oten used
More informationEstimation and detection of a periodic signal
Estimation and detection o a periodic signal Daniel Aronsson, Erik Björnemo, Mathias Johansson Signals and Systems Group, Uppsala University, Sweden, e-mail: Daniel.Aronsson,Erik.Bjornemo,Mathias.Johansson}@Angstrom.uu.se
More informationEXISTENCE OF ISOPERIMETRIC SETS WITH DENSITIES CONVERGING FROM BELOW ON R N. 1. Introduction
EXISTECE OF ISOPERIMETRIC SETS WITH DESITIES COVERGIG FROM BELOW O R GUIDO DE PHILIPPIS, GIOVAI FRAZIA, AD ALDO PRATELLI Abstract. In this paper, we consider the isoperimetric problem in the space R with
More informationEssential Microeconomics : EQUILIBRIUM AND EFFICIENCY WITH PRODUCTION Key ideas: Walrasian equilibrium, first and second welfare theorems
Essential Microeconomics -- 5.2: EQUILIBRIUM AND EFFICIENCY WITH PRODUCTION Key ideas: Walrasian equilibrium, irst and second welare teorems A general model 2 First welare Teorem 7 Second welare teorem
More informationA Faster Randomized Algorithm for Root Counting in Prime Power Rings
A Faster Randomized Algorithm or Root Counting in Prime Power Rings Leann Kopp and Natalie Randall July 17, 018 Abstract Let p be a prime and Z[x] a polynomial o degree d such that is not identically zero
More informationMath 216A. A gluing construction of Proj(S)
Math 216A. A gluing construction o Proj(S) 1. Some basic deinitions Let S = n 0 S n be an N-graded ring (we ollows French terminology here, even though outside o France it is commonly accepted that N does
More informationCLASS NOTES MATH 527 (SPRING 2011) WEEK 6
CLASS NOTES MATH 527 (SPRING 2011) WEEK 6 BERTRAND GUILLOU 1. Mon, Feb. 21 Note that since we have C() = X A C (A) and the inclusion A C (A) at time 0 is a coibration, it ollows that the pushout map i
More informationFall 2017 November 10, Written Homework 5
CS1800 Discrete Structures Profs. Aslam, Gold, & Pavlu Fall 2017 November 10, 2017 Assigned: Mon Nov 13 2017 Due: Wed Nov 29 2017 Instructions: Written Homework 5 The assignment has to be uploaded to blackboard
More informationDifferentiation. The main problem of differential calculus deals with finding the slope of the tangent line at a point on a curve.
Dierentiation The main problem o dierential calculus deals with inding the slope o the tangent line at a point on a curve. deinition() : The slope o a curve at a point p is the slope, i it eists, o the
More informationSimpler Functions for Decompositions
Simpler Functions or Decompositions Bernd Steinbach Freiberg University o Mining and Technology, Institute o Computer Science, D-09596 Freiberg, Germany Abstract. This paper deals with the synthesis o
More informationThe Deutsch-Jozsa Problem: De-quantization and entanglement
The Deutsch-Jozsa Problem: De-quantization and entanglement Alastair A. Abbott Department o Computer Science University o Auckland, New Zealand May 31, 009 Abstract The Deustch-Jozsa problem is one o the
More informationA PROBABILISTIC POWER DOMAIN ALGORITHM FOR FRACTAL IMAGE DECODING
Stochastics and Dynamics, Vol. 2, o. 2 (2002) 6 73 c World Scientiic Publishing Company A PROBABILISTIC POWER DOMAI ALGORITHM FOR FRACTAL IMAGE DECODIG V. DRAKOPOULOS Department o Inormatics and Telecommunications,
More informationCS 361 Meeting 28 11/14/18
CS 361 Meeting 28 11/14/18 Announcements 1. Homework 9 due Friday Computation Histories 1. Some very interesting proos o undecidability rely on the technique o constructing a language that describes the
More informationClassification of effective GKM graphs with combinatorial type K 4
Classiication o eective GKM graphs with combinatorial type K 4 Shintarô Kuroki Department o Applied Mathematics, Faculty o Science, Okayama Uniervsity o Science, 1-1 Ridai-cho Kita-ku, Okayama 700-0005,
More informationProducts and Convolutions of Gaussian Probability Density Functions
Tina Memo No. 003-003 Internal Report Products and Convolutions o Gaussian Probability Density Functions P.A. Bromiley Last updated / 9 / 03 Imaging Science and Biomedical Engineering Division, Medical
More informationOpen Access Dynamic Parameters Identification for the Feeding System of Commercial Numerical Control Machine
Send Orders or Reprints to reprints@benthamscience.net The Open Automation and Control Systems Journal, 13, 5, 161-166 161 Open Access Dynamic Parameters Identiication or the Feeding System o Commercial
More information1. Definition: Order Statistics of a sample.
AMS570 Order Statistics 1. Deinition: Order Statistics o a sample. Let X1, X2,, be a random sample rom a population with p.d.. (x). Then, 2. p.d.. s or W.L.O.G.(W thout Loss o Ge er l ty), let s ssu e
More informationNumerical Solution of Ordinary Differential Equations in Fluctuationlessness Theorem Perspective
Numerical Solution o Ordinary Dierential Equations in Fluctuationlessness Theorem Perspective NEJLA ALTAY Bahçeşehir University Faculty o Arts and Sciences Beşiktaş, İstanbul TÜRKİYE TURKEY METİN DEMİRALP
More informationSection 1.2 Domain and Range
Section 1. Domain and Range 1 Section 1. Domain and Range One o our main goals in mathematics is to model the real world with mathematical unctions. In doing so, it is important to keep in mind the limitations
More informationarxiv:quant-ph/ v2 12 Jan 2006
Quantum Inormation and Computation, Vol., No. (25) c Rinton Press A low-map model or analyzing pseudothresholds in ault-tolerant quantum computing arxiv:quant-ph/58176v2 12 Jan 26 Krysta M. Svore Columbia
More informationRobust Residual Selection for Fault Detection
Robust Residual Selection or Fault Detection Hamed Khorasgani*, Daniel E Jung**, Gautam Biswas*, Erik Frisk**, and Mattias Krysander** Abstract A number o residual generation methods have been developed
More information