The inflation of attractors and their discretization: the autonomous case
|
|
- Darleen Horton
- 7 years ago
- Views:
Transcription
1 The inflation of attractors and their discretization: the autonomous case P. E. Kloeden Fachbereich Mathematik, Johann Wolfgang Goethe Universität, D-654 Frankfurt am Main, Germany V.S. Kozyakin, Institute for Information Transmission Problems, Russian Academy of Sciences 19 Bolshoi Karetny Lane, Moscow, Russia AMS Subject Classification: 34A5, 34D45, 54C6 Key words: maximal attractor, inflated attractor, setvalued differential equation, perturbations, discretization. Dedictated to Professor V. Lakshmikantham on the occasion of his 75th birthday 1 Introduction The effects of perturbation or discretization on a maximal attractor of autonomous dynamical systems is now well understood, with the perturbed or discretized system having a nearby maximal attractor [5, 7, 1]. In contrast, for nonautonomous systems the very concept of a nonautonomous attractor itself is still undergoing intensive development and perturbation or discretization results have been obtained This work was supported by the DFG Forschungschwerpunkt Ergodentheorie, Analysis und effiziente Simulation dynamischer Systeme. The author was partially supported by the Russian Foundation for Basic Researches Grant
2 only for specific cases or under very restricted assumptions, see for example [2, 8, 9] and the references therein. There are also some practical problems for specific autonomous dynamical systems and types of perturbation or discretization processes due to the fact that the convergence of the perturbed or discretized attractor to that of the original attractor is usually only upper semicontinuous convergence, which means, roughly speaking, that the attractor may collapse under pertubation or discretization. While this is not unexpected for systems with parameter values near a bifurcation parameter, it does raise concerns about the faithfulness of numerical approximations. Of course, this collapse may not occur for another numerical scheme or step size or under appropriate assumptions about the dynamics inside the original attractor, but such details may not be known or confirmable in practice. In this paper we introduce the concept of inflation of an attractor, which will give us a larger positively invariant set for the original system that contains the maximal attractors of all possible autonomous perturbations and discretizations of a certain size, as well as even the attracting objects of corresponding nonautonomous perturbations and discretizations as described in [8, 9]. It also includes the effects of roundoff error and converges continuously to the original attractor. The existence of such an inflated attractor follows as in [7] from the uniform asymptotic stability of the original maximal attractor. While the details and underlying ideas are not really new in the autonomous case considered here, the interpretation is new and is more transparent here than in the technically more difficult nonautonomous case, to be treated in another paper [6], where it provides a means for handling the nonuniformities that are intrinsic in nonautonomous systems. The paper is organised as follows. Preliminary and background results are presented in the next section. Inflated dynamics are introduced in Section 3 in terms of a differential inclusion expanding the vector field of the given autonomous dynamical system. The existence and continuous convergence of a maxmal attractor, the inflated attractor, for this inflated system is formulated as Theorem 2 in Section 4 and its interpretation discussed. Proofs of the Theorem and an ancilliary proposition are then presented in the remaining two sections of the paper. 2 Maximal attractors Under assumptions assuring global uniqueness and extendability the solution x(t) = x(t; x ) of an autonomous differential equation dx dt = f(x), (1) 2
3 with initial value x(; x ) = x generates a continuous time semigroup φ = {φ t } t R + on R d defined by φ t (x ) := x(t; x ) for each t and x R d. We will assume that f in (1) satisfies a uniform Lipschitz condition on R d, i.e. there exists a constant K > such that f(x) f(y) K x y for all x, y R d, (2) and that the semidynamical system φ generated by (1) has a maximal attractor, by which we mean a nonempty compact subset A of R d which is φ invariant, i.e. with φ t (A ) = A for all t, and attracting, i.e. with lim t H ( φ t (D), A ) = for any bounded subset D R d. Here the Hausdorff separation H (A, B) of nonempty compact subsets A and B of R d is defined as H (A, B) := max dist(a, B) = max a A min a A b B a b, and H(A, B) = max {H (A, B), H (B, A)} is a metric, called the Hausdorff metric, on the space of nonempty compact subsets of R d. The existence of a maximal attractor follows from that of more easily found absorbing sets. A positively invariant compact subset B of R d, i.e. with φ t (B) B for all t, is called an absorbing set for the semidynamical system φ on R d if for every bounded subset D of R d there exists a t D R + such that φ t (D) B for all t t D. The maximal attractor is then given uniquely by A = t φ t (B). A maximal attractor is uniformly asymptotically stable [1]. Yoshizawa [12] gives various necessary and sufficient conditions involving Lyapunov functions for an arbitrarily shaped compact set A to be uniformly asymptotically stable for a differential equation (1); e.g. see Theorem 3 below. Such Lyapunov functions are a very convenient tool that does not require explicit knowledge of the solutions of the differential equation. For example, in Kloeden and Lorenz [7] a Lyapunov function for the maximal attractor was used to construct an absorbing set, hence to establish the existence of a maximal numerical attractor, for a discrete time semidynamical system corresponding to a numerical discretization of the differential equation (1). A similar construction will be used in this paper. 3
4 3 Inflated dynamics We shall inflate of the differential equation (1) to a setvalued differential equation (see, e.g. [1]) defined in terms a setvalued mappng formed by a closed ball about the function f in (1) at each point. Specifically, for ɛ > we define the ɛ inflated setvalued mapping F ɛ of f by F ɛ (x) := {y R d : y f(x) ɛ}. Let N ɛ [A] = {x R d : dist(x, A) ɛ} denote the closed ɛ neighbourhood of a nonempty compact subset A of R d. Then F ɛ (x) = N ɛ [{f(x)}] = {f(x)} + N ɛ [{}]. The ɛ inflated system corresponding to the differential equation (1) is thus the setvalued differential equation dx dt F ɛ(x). (3) The set F ɛ (x) is obviously nonempty, compact and convex. The mapping x F ɛ (x) also satisfies a uniform Lipschitz condition on R d with the same Lipschitz constant as in (2) for the function f. To see this we use Propostion from [3] to obtain H (F ɛ (x), F ɛ (y)) = H ({f(x)} + N ɛ [{}], {f(y)} + N ɛ [{}]) = H ({f(x)}, {f(y)}) = f(x) f(y) K x y. These properties ensure the maximal existence (see [1]) of an absolutely continuous solutions with initial value x() = x satisfying x(t) {x } + F ɛ (x(s)) ds for all t. Moreover, the attainability set Φ ɛ t(x ) formed by all such solutions is a nonempty compact connected subset of R d and generates a setvalued semigroup [11] on R d, i.e. satisfying Φ ɛ (x ) = {x }, Φ ɛ s (Φ ɛ t(x )) = Φ ɛ s+t(x ) for all s, t, x R d, for which the setvalued mapping (t, x ) Φt(x ɛ ) is continuous with respect to the Hausdorff metric. In fact, here the setvalued mapping (ɛ, t, x ) Φt(x ɛ ) is also continuous with φ t (x ) = ɛ> Φ ɛ t(x ) for all t and x R d. The following estimate will be proved in Section 5. Proposition 1 H ({φ τ (x )}, Φ ɛ τ(x )) K 1 e Kτ τɛ for all τ. 4
5 4 Inflated attractors and their interpretation Our main result is to show that the setvalued inflated semidynamical system has a maximal attractor that contains and converges to the maximal attractor of the original singlevalued dynamical system. Theorem 2 Suppose that f : R d R d satisfies the uniformly Lipschitz condition (2) and that the semidynamical system φ has a maximal attractor A. Then for every ɛ > the ɛ inflated semidynamical system Φ ɛ has a maximal attractor A ɛ such that A A ɛ and lim H ( A ɛ, A ) =. ɛ We call A ɛ the ɛ inflated attractor of the original singlevalued semidynamical system φ generated by the differential equation (1). From proof of Theorem 2, to be given in Section 6, we will see that A ɛ is in fact a positively invariant absorbing set for the singlevalued semidynamical system φ. For the remainder of this section we wish to provide an interpretation for A ɛ and to discuss its usefulness in connection with perturbed or numerical approximated dynamics of the original system φ and its maximal attractor A. A pth order one-step numerical scheme with constant step size h > [1] x n+1 = x n + hf (h, x n ) (4) applied to the differential equation (1) generates a discrete time semidynamical system, which, as shown in [7], has a maximal attractor A h num that converges upper semicontinuously to A, i.e. H (A h num, A ) as h. In general (see [1]), the Hausdorff separation H here cannot be replaced by Hausdorff metric H, so in the near limit the numerical attractor A h num may approximate only a proper subset of the original attractor A. A similar situation occurs for the maximal attractor of a perturbed differential equation dx dt = f(x) + hg(x) (5) with uniformly bounded perturbations g(x) 1 for all x R d, where g need only be continuous here and the solutions of (5) may even be nonunique, i.e. setvalued. The local discretization error of the numerical scheme (4) satisfies an estimate of the form x n+1 φ h (x n ) C p h p+1 for some constant C p. From Proposition 1 with τ = h, we see that if we choose h (, τ ) small enough so that C p h p+1 K 1 e Kh hɛ, (6) 5
6 then x n+1 Φ ɛ h(x n ). The numerical dynamics will thus be contained within and carried along by the setvalued dynamics of the discrete time system Φ ɛ h and, in particular, the numerical attractor A h num will be contained in the ɛ inflated attractor A ɛ. This also holds for the maximal attractor of a perturbed differential equation (5), provided h ɛ. In fact, it also holds for the numerical scheme with variable time steps h n [h min, h max ] provided C p h p+1 max K 1 e Kh min h min ɛ and for nonautonomous perturbations g(t, x) in (6), but now in the sense that the component subsets of the resulting nonautonomous pullback attractors belong to the inflated attractor A ɛ ; see [8, 9] for appropriate definitions and details. Real computations of a numerical scheme involve roundoff error as well as a theoretical discretization error. The roundoff error usually varies from step to step, so the actual numerical dynamical system generated within the computer will be nonautonomous even if a constant time step h is used. If ρ > denotes the maximum roundoff error and if the (possibly) variable time steps h n [h min, h max ] with C p h p+1 max + ρ K 1 e Kh min h min ɛ, then the component sets of the numerical pullback attractor will be contained in the inflated attractor A ɛ. There is an apparent relationship between the inflated attractor and the set of chain connected points of the original autonomous dynamical system. The latter is defined essentially by inflating the flow or solution mapping rather than the vector field as we have done here. While inflating the solution mapping has a number of theoretical advantages, this mapping is in practice generally not known explicitly. Moreover, in the nonautonomous case to be considered in [6] we will allow the inflation parameter to vary with state and time, in which case it is more convenient to work directly with the vector field. Finally, we note that it is always possible to construct, albeit artificial, approximate systems contained in the inflated dynamics for which the maximal attractor or pullback attractor components contain any specified point of the inflated attractor (see [6] for details). Hence the inflated attractor A ɛ is the smallest set containing all possible limiting behaviour or approximate autonomous attractors or nonautonomous attractor components resulting from all possible perturbations and approximations of appropriate magnitude of the original semidynamical system φ. In particular, there is no loss of information in the inflated attractor about the original asymptotic dynamics as may occur in using some type of approximate system for which the approximate attractors converge only upper semicontinuously to the original maximal attractor A. 6
7 5 Proof of Proposition 1 Since solution of the differential equation (1) is also a solution of the ɛ inflated system (3), we have φ t (x ) Φt(x ɛ ), and hence H ({φ t (x )}, Φt(x ɛ )), for all t and x R d. Now let x(t) be a solution of (3) with initial condition x() = x, i.e. satisfying (3). Using Propositions and in [3] we obtain { }) x(t) φ t (x ) = H ({x } + F ɛ (x(s)) ds, {x } + f (φ s (x )) ds = H ( { }) F ɛ (x(s)) ds, f (φ s (x )) ds = H (F ɛ (x(s)), {f (φ s (x ))}) ds H ({f(x(s))} + N ɛ [{}], {f (φ s (x ))}) ds H ({f(x(s))} + N ɛ [{}], {f(x(s)}) ds + H ({f(x(s)}, {f (φ s (x ))}) ds ɛ ds + so x(t) φ t (x ) ɛτ + K Hence by the Gronwall inequality we have f(x(s)) f(φ s (x )) ds, x(s) φ s (x ) ds for t τ x(τ) φ τ (x ) K 1 e Kτ τɛ for any τ. Taking the supremum over x(τ) Φτ(x ɛ ), we obtain H (Φ ɛ τ(x ), {φ τ (x )}) K 1 e Kτ τɛ and hence the desired result. 6 Proof of Theorem A Lyapunov inequality for the inflated dynamics Let A be the maximal attractor of the differential equation (1) and let V be a Lyapunov function characterizing the maximal uniform asymptotic stability of A 7
8 as in the following theorem which is a reformulation of Theorem 22.5 of Yoshizawa [12] to the maximal context considered here. Theorem 3 Suppose that f in (1) satisfies a uniform Lipschitz condition (2) on R d. Then a nonempty compact subset A of R d is globally uniformly asymptotically stable for the semidynamical system φ generated by differential equation (1) if and only if there exists a function V : R d [, ) for which: 1. V is uniformly Lipschitz on R d, i.e. there exists a constant L > such that V (x) V (y) L x y for all x, y R d ; 2. there exist continuous strictly increasing functions α, β : R d [, ) with α() = β() = and < α(r) < β(r) for all r > such that α(dist(x, A )) V (x) β(dist(x, A )) for all x R d ; 3. there exists a constant c > such that V (φ t (x ) e ct V (x ) for all t, x R d. (7) Similarly as in [7], the key tool in our proof is provided by the following Lyapunov function inequality. Lemma 4 V (x(t)) e ct V (x ) + L K 1 e Kt tɛ (8) for any solution x = x(t) of the ɛ inflated equation (3) with initial condition x() = x and any t. Proof: From the Lipschitz property of V in Theorem 3 we have V (x(t)) V (φ t (x )) + L x(t) φ t (x ). Applying the exponential decay inequality (7) of V in Theorem 3 to the first term on the right side and the inequality of Proposition 1 to the second then gives V (x(t)) e ct V (x ) + L K 1 e Kt tɛ for all t. 8
9 6.2 Existence of an absorbing set for the inflated dynamics Fix ɛ > and τ > and define η = η(ɛ, τ) := 2LK 1 e Kτ τɛ 1 e cτ. Lemma 5 Λ(η) := { x R d : V (x) η } is a nonempty compact subset of R d with H ( Λ(η), A ) α 1 (η). (9) Proof: Λ(η) is nonempty because it contains A = { x R d : V (x) = } and is closed in view of the continuity of V. Its boundedness and the inequality (9) follow from the inequality α(dist(x, A )) V (x) in the second property of V in Theorem 3 and the definition of Λ(η), giving dist(x, A ) α 1 (V (x)) α 1 (η) for all x Λ(η). The set Λ(η) is positively invariant with respect to the discrete time setvalued semigroup formed by iterating Φ ɛ τ with τ fixed, i.e. Lemma 6 Φ ɛ τ (Λ(η)) Λ(η). Proof: It suffices to consider any single point x 1 Φ ɛ τ(x ) for an arbitrary x Λ(η), so V (x ) η = η(ɛ, τ). Then by the key inequality (8) with t = τ and the definition of η(ɛ, τ) we have V (x 1 ) e cτ V (x ) + LK 1 e Kτ τɛ e cτ η(ɛ, τ) + 1 ( ) 1 e cτ η(ɛ, τ) 2 = 1 ( ) 1 + e cτ η(ɛ, τ) η(ɛ, τ), 2 so x 1 Λ(η). The set Λ(η) is in fact an absorbing set for Φτ ɛ provided τ is chosen small enough. Lemma 7 There is a τ > such that for each compact subset D and τ (, τ ) there exists an integer N D,ɛ,τ 1 for which Φ ɛ τ (D) Λ(η) for all n N D,ɛ,τ. 9
10 Proof: As in Lemma 3.4 of [7] there exists a γ > such that 1 + e cγ = 2e cγ/2 and 1 + e cτ < 2e cτ/2 for all < τ < τ = γ. Let x 1 Φ ɛ τ(x ) with x / Λ(η). Then by the key inequality (8) and the definition of η = η(ɛ, τ) we have V (x 1 ) e cτ V (x ) + LK 1 e Kτ τɛ = e cτ V (x ) + 1 ( ) 1 e cτ η(ɛ, τ) 2 < 1 ( ) 1 + e cτ V (x ) 2 < e cτ/2 V (x ) since V (x ) > η(ɛ, τ) and < τ < τ. Repeating this argument, we have V (x n ) < e cnτ/2 V (x ) where x n Φ ɛ τ(x n 1 ), x n 1 Φ ɛ τ(x n 2 ),..., x 1 Φ ɛ τ(x ) as long as x, x 1,..., x n 1 / Λ(η). Now V (x ) β ( dist(x, A ) ) β ( H (D, A ) ) < for all x D, so V (x n ) < e cnτ/2 β ( H (D, A ) ) as long as x, x 1,..., x n 1 / Λ(η). Define N D,ɛ,τ to be the smallest integer n for which e cnτ/2 β ( H (D, A ) ) η < e c(n 1)τ/2 β ( H (D, A ) ). Thus for each x D there exists an integer n N D,ɛ,τ, possibly, such that Φ ɛ nτ(x ) Λ(η). By the positive invariance of Λ(η) proved in Lemma 6 all successive iterates of Φ ɛ τ then remain in Λ(η), so the proof of Lemma 7 is complete. However, we need a nonempty compact subset of R d that is positively invariant and absorbing for the continuous time setvalued system Φt. ɛ For this we fix a τ as in Lemma 7 and define B ɛ := Φs ɛ (Λ(η)). s τ with η = η(ɛ, τ) as above. The B ɛ is compact and contains Λ(η), so is nonempty. Lemma 8 Φ ɛ t (B ɛ ) B ɛ for all t. 1
11 Proof: have First consider ρ (.τ]. Then by the setvalued semigroup property we Φ ɛ ρ (B ɛ ) = Φ ɛ ρ Φs ɛ (Λ(η)) = s τ Φρ+s ɛ (Λ(η)) B ɛ, s τ since Φ ɛ ρ+s (Λ(η)) B ɛ if ρ + s (, τ], whereas Φ ɛ ρ+s (Λ(η)) Φ ɛ ρ+s τ (Φτ ɛ (Λ(η))) Φ ɛ ρ+s τ (Λ(η)) B ɛ if ρ + s (τ, 2τ] by the previous step and Lemma 7. Now consider t > τ and write t = nτ + ρ where ρ (, τ). Then ( Φt ɛ (B ɛ ) Φ ɛ nτ Φ ɛ ρ (B ɛ ) ) Φnτ ɛ (B ɛ ) B ɛ by the step above. Lemma 9 For each compact subset D of R d there exists an integer T D,ɛ such that Φ ɛ t (D) B ɛ for all t T D,ɛ. Proof: Define D = s τ Φ ɛ s (D) and let t = nτ + ρ where ρ (, τ). Then ( Φ ɛ t (D) Φ ɛ nτ Φ ɛ ρ (D) ) Φ ɛ nτ ( D ) and by Lemma 7 there exists an N D,ɛ,τ 1 such that Φ ɛ nτ ( D ) Λ(η) B ɛ for all n N D,ɛ,τ. The result then follows with T D,ɛ = τn D,ɛ,τ. 6.3 Existence and continuous convergence of the inflated attractors We apply standard dynamical systems theoretic methods [11, 1] to the continuous time setvalued semigroup Φ ɛ t and the absorbing set B ɛ defined in the previous subsection to obtain the existence of a maximal attractor A ɛ for Φ ɛ t, namely with A ɛ = t Φ ɛ t (B ɛ ). Note that A ɛ does not depend on the choice of the τ used to construct the absorbing set B ɛ. 11
12 Let A be the maximal attractor for φ. Then A = φ t ( A ) φ t (Λ(η)) Φ ɛ t (Λ(η)) Φ ɛ t (B ɛ ) for all t, so A Φ ɛ t (B ɛ ) = A ɛ t for each ɛ >. Thus H (A, A ɛ ) =. In addition, A ɛ Λ(η(ɛ, τ) B ɛ so H ( A ɛ, A ) H ( B ɛ, A ) = H s τ Φs ɛ (Λ(η(ɛ, τ))), A max ( s τ H Φ ɛ s (Λ(η(ɛ, τ))), A ) K 1 e Kτ ( τɛ + H ( Λ(η(ɛ, τ)), A )) K 1 e Kτ ( τɛ + α 1 (η(ɛ, τ)) ) as ɛ by (9) for the last inequality and by a generalization of Proposition 1 with different initial values (see also Lemma 3.4 of [4]) for the second last inequality. Combining the results, we have lim ɛ H ( A ɛ, A ) =, that is, the inflated attractor A ɛ converges continuously to A as ɛ converges to. This completes the proof of Theorem 2. References [1] J.P. Aubin and A. Cellina, Differential Inclusions. Springer Verlag, Berlin, [2] D.N. Cheban, P.E. Kloeden and B. Schmalfuß, Pullback attractors in dissipative nonautonomous differential equations under discretization, DANSE Preprint, FU Berlin, [3] P. Diamond and P. Kloeden, Metric Spaces of Fuzzy Sets, World Scientific, Singapore, [4] L. Grüne, Convergence rates of perturbed attracting sets with vanishing perturbations, DANSE Preprint, FU Berlin,
13 [5] J. Hale, Asymptotic Behavior of Dissipative Dynamical Systems. Amer. Math. Soc., Providence, RI, [6] P.E. Kloeden and V.S. Kozyakin, Inflated nonautonomnous pullback attractors. in preparation [7] P.E. Kloeden and J. Lorenz, Stable attracting sets in dynamical systems and in their one-step discretizations, SIAM J. Numer. Analysis 23 (1986), [8] P.E. Kloeden and B. Schmalfuß, Lyapunov functions and attractors under variable time step discretization, Discrete & Conts. Dynamical Systems 2 (1996), [9] P.E. Kloeden and D.J. Stonier, Cocycle attractors in nonautonomously perturbed differential equations. Dynamics of Discrete, Continuous and Impulsive Systems. 4 (1998), [1] A.M. Stuart and A.R. Humphries, Numerical Analysis and Dynamical Systems, Cambridge University Press, Cambridge [11] G.P. Szegö and G. Treccani, Semigruppi di Trasformazioni Multivoche, Springer Lecture Notes in Mathematics, Vol. 11, [12] T. Yoshizawa, Stability Theory by Lyapunov s Second Method, The Mathematical Society of Japan, Tokyo,
Fuzzy Differential Systems and the New Concept of Stability
Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationResearch Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationProperties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and
More informationON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS
ON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS I. KIGURADZE AND N. PARTSVANIA A. Razmadze Mathematical Institute
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More information4 Lyapunov Stability Theory
4 Lyapunov Stability Theory In this section we review the tools of Lyapunov stability theory. These tools will be used in the next section to analyze the stability properties of a robot controller. We
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
More informationQuasi Contraction and Fixed Points
Available online at www.ispacs.com/jnaa Volume 2012, Year 2012 Article ID jnaa-00168, 6 Pages doi:10.5899/2012/jnaa-00168 Research Article Quasi Contraction and Fixed Points Mehdi Roohi 1, Mohsen Alimohammady
More information1 Error in Euler s Method
1 Error in Euler s Method Experience with Euler s 1 method raises some interesting questions about numerical approximations for the solutions of differential equations. 1. What determines the amount of
More informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationExample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x
Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationSome stability results of parameter identification in a jump diffusion model
Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More informationLecture 13 Linear quadratic Lyapunov theory
EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationNumerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationStability of Data Networks: Stationary and Bursty Models
Stability of Data Networks: Stationary and ursty Models Heng-Qing Ye School of usiness, National University of Singapore 1 usiness Link, Singapore 117591, bizyehq@nus.edu.sg Jihong Ou School of usiness,
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationMinimizing the Number of Machines in a Unit-Time Scheduling Problem
Minimizing the Number of Machines in a Unit-Time Scheduling Problem Svetlana A. Kravchenko 1 United Institute of Informatics Problems, Surganova St. 6, 220012 Minsk, Belarus kravch@newman.bas-net.by Frank
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationFurther Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationLecture Notes on Elasticity of Substitution
Lecture Notes on Elasticity of Substitution Ted Bergstrom, UCSB Economics 210A March 3, 2011 Today s featured guest is the elasticity of substitution. Elasticity of a function of a single variable Before
More informationCHAPTER IV - BROWNIAN MOTION
CHAPTER IV - BROWNIAN MOTION JOSEPH G. CONLON 1. Construction of Brownian Motion There are two ways in which the idea of a Markov chain on a discrete state space can be generalized: (1) The discrete time
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 7: Conditionally Positive Definite Functions Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH 590 Chapter
More informationPrinciple of Data Reduction
Chapter 6 Principle of Data Reduction 6.1 Introduction An experimenter uses the information in a sample X 1,..., X n to make inferences about an unknown parameter θ. If the sample size n is large, then
More informationContinuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationParabolic Equations. Chapter 5. Contents. 5.1.2 Well-Posed Initial-Boundary Value Problem. 5.1.3 Time Irreversibility of the Heat Equation
7 5.1 Definitions Properties Chapter 5 Parabolic Equations Note that we require the solution u(, t bounded in R n for all t. In particular we assume that the boundedness of the smooth function u at infinity
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationGenOpt (R) Generic Optimization Program User Manual Version 3.0.0β1
(R) User Manual Environmental Energy Technologies Division Berkeley, CA 94720 http://simulationresearch.lbl.gov Michael Wetter MWetter@lbl.gov February 20, 2009 Notice: This work was supported by the U.S.
More informationMaximum Likelihood Estimation
Math 541: Statistical Theory II Lecturer: Songfeng Zheng Maximum Likelihood Estimation 1 Maximum Likelihood Estimation Maximum likelihood is a relatively simple method of constructing an estimator for
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More information15 Limit sets. Lyapunov functions
15 Limit sets. Lyapunov functions At this point, considering the solutions to ẋ = f(x), x U R 2, (1) we were most interested in the behavior of solutions when t (sometimes, this is called asymptotic behavior
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics GLOBAL EXISTENCE AND DECREASING PROPERTY OF BOUNDARY VALUES OF SOLUTIONS TO PARABOLIC EQUATIONS WITH NONLOCAL BOUNDARY CONDITIONS Sangwon Seo Volume 193 No. 1 March 2000
More informationState Feedback Stabilization with Guaranteed Transient Bounds
State Feedback Stabilization with Guaranteed Transient Bounds D. Hinrichsen, E. Plischke, F. Wirth Zentrum für Technomathematik Universität Bremen 28334 Bremen, Germany Abstract We analyze under which
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More informationCascaded nonlinear time-varying systems: analysis and design
Cascaded nonlinear time-varying systems: analysis and design A. Loría C.N.R.S, UMR 5228, Laboratoire d Automatique de Grenoble, ENSIEG, St. Martin d Hères, France, Antonio.Loria@inpg.fr Minicourse at the
More informationON FIBER DIAMETERS OF CONTINUOUS MAPS
ON FIBER DIAMETERS OF CONTINUOUS MAPS PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Abstract. We present a surprisingly short proof that for any continuous map f : R n R m, if n > m, then there
More informationLecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationOPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN. E.V. Grigorieva. E.N. Khailov
DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS Supplement Volume 2005 pp. 345 354 OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN E.V. Grigorieva Department of Mathematics
More informationALMOST COMMON PRIORS 1. INTRODUCTION
ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type
More informationt := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).
1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction
More informationTilings of the sphere with right triangles III: the asymptotically obtuse families
Tilings of the sphere with right triangles III: the asymptotically obtuse families Robert J. MacG. Dawson Department of Mathematics and Computing Science Saint Mary s University Halifax, Nova Scotia, Canada
More informationFixed Point Theorems
Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More information14.451 Lecture Notes 10
14.451 Lecture Notes 1 Guido Lorenzoni Fall 29 1 Continuous time: nite horizon Time goes from to T. Instantaneous payo : f (t; x (t) ; y (t)) ; (the time dependence includes discounting), where x (t) 2
More informationEXISTENCE AND NON-EXISTENCE RESULTS FOR A NONLINEAR HEAT EQUATION
Sixth Mississippi State Conference on Differential Equations and Computational Simulations, Electronic Journal of Differential Equations, Conference 5 (7), pp. 5 65. ISSN: 7-669. UL: http://ejde.math.txstate.edu
More informationArrangements of Stars on the American Flag
Arrangements of Stars on the American Flag Dimitris Koukoulopoulos and Johann Thiel Abstract. In this article, we examine the existence of nice arrangements of stars on the American flag. We show that
More informationFINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS
FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS Abstract. It is shown that, for any field F R, any ordered vector space structure
More informationFourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions
Fourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions Jennifer Zhao, 1 Weizhong Dai, Tianchan Niu 1 Department of Mathematics and Statistics, University of Michigan-Dearborn,
More informationSome Problems of Second-Order Rational Difference Equations with Quadratic Terms
International Journal of Difference Equations ISSN 0973-6069, Volume 9, Number 1, pp. 11 21 (2014) http://campus.mst.edu/ijde Some Problems of Second-Order Rational Difference Equations with Quadratic
More informationThe Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method
The Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method Robert M. Freund February, 004 004 Massachusetts Institute of Technology. 1 1 The Algorithm The problem
More informationMath 120 Final Exam Practice Problems, Form: A
Math 120 Final Exam Practice Problems, Form: A Name: While every attempt was made to be complete in the types of problems given below, we make no guarantees about the completeness of the problems. Specifically,
More informationOn Integer Additive Set-Indexers of Graphs
On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that
More informationOnline Appendix to Stochastic Imitative Game Dynamics with Committed Agents
Online Appendix to Stochastic Imitative Game Dynamics with Committed Agents William H. Sandholm January 6, 22 O.. Imitative protocols, mean dynamics, and equilibrium selection In this section, we consider
More information4. Expanding dynamical systems
4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,
More informationThe Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line
The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line D. Bongiorno, G. Corrao Dipartimento di Ingegneria lettrica, lettronica e delle Telecomunicazioni,
More informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More informationOn a comparison result for Markov processes
On a comparison result for Markov processes Ludger Rüschendorf University of Freiburg Abstract A comparison theorem is stated for Markov processes in polish state spaces. We consider a general class of
More informationON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath
International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationSection 1.4. Difference Equations
Difference Equations to Differential Equations Section 1.4 Difference Equations At this point almost all of our sequences have had explicit formulas for their terms. That is, we have looked mainly at sequences
More informationSumit Chandok and T. D. Narang INVARIANT POINTS OF BEST APPROXIMATION AND BEST SIMULTANEOUS APPROXIMATION
F A S C I C U L I M A T H E M A T I C I Nr 51 2013 Sumit Chandok and T. D. Narang INVARIANT POINTS OF BEST APPROXIMATION AND BEST SIMULTANEOUS APPROXIMATION Abstract. In this paper we generalize and extend
More informationIrreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients
DOI: 10.2478/auom-2014-0007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca
More informationPooja Sharma and R. S. Chandel FIXED POINT THEOREMS FOR WEAKLY COMPATIBLE MAPPINGS IN FUZZY METRIC SPACES. 1. Introduction
F A S C I C U L I M A T H E M A T I C I Nr 51 2013 Pooja Sharma and R. S. Chandel FIXED POINT THEOREMS FOR WEAKLY COMPATIBLE MAPPINGS IN FUZZY METRIC SPACES Abstract. This paper presents some fixed point
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
More informationWHEN DOES A RANDOMLY WEIGHTED SELF NORMALIZED SUM CONVERGE IN DISTRIBUTION?
WHEN DOES A RANDOMLY WEIGHTED SELF NORMALIZED SUM CONVERGE IN DISTRIBUTION? DAVID M MASON 1 Statistics Program, University of Delaware Newark, DE 19717 email: davidm@udeledu JOEL ZINN 2 Department of Mathematics,
More information15 Kuhn -Tucker conditions
5 Kuhn -Tucker conditions Consider a version of the consumer problem in which quasilinear utility x 2 + 4 x 2 is maximised subject to x +x 2 =. Mechanically applying the Lagrange multiplier/common slopes
More informationTHE REGULAR OPEN CONTINUOUS IMAGES OF COMPLETE METRIC SPACES
PACIFIC JOURNAL OF MATHEMATICS Vol 23 No 3, 1967 THE REGULAR OPEN CONTINUOUS IMAGES OF COMPLETE METRIC SPACES HOWARD H WICKE This article characterizes the regular T o open continuous images of complete
More informationExtremal equilibria for reaction diffusion equations in bounded domains and applications.
Extremal equilibria for reaction diffusion equations in bounded domains and applications. Aníbal Rodríguez-Bernal Alejandro Vidal-López Departamento de Matemática Aplicada Universidad Complutense de Madrid,
More informationLectures 5-6: Taylor Series
Math 1d Instructor: Padraic Bartlett Lectures 5-: Taylor Series Weeks 5- Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More informationRANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
More informationAn explicit inversion formula for the exponetial Radon transform using data from 180
ISSN: 40-567 An explicit inversion formula for the exponetial Radon transform using data from 80 Hans Rullgård Research Reports in Mathematics Number 9, 00 Department of Mathematics Stockholm University
More informationMINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS. denote the family of probability density functions g on X satisfying
MINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS I. Csiszár (Budapest) Given a σ-finite measure space (X, X, µ) and a d-tuple ϕ = (ϕ 1,..., ϕ d ) of measurable functions on X, for a = (a 1,...,
More informationScalar Valued Functions of Several Variables; the Gradient Vector
Scalar Valued Functions of Several Variables; the Gradient Vector Scalar Valued Functions vector valued function of n variables: Let us consider a scalar (i.e., numerical, rather than y = φ(x = φ(x 1,
More informationStochastic Inventory Control
Chapter 3 Stochastic Inventory Control 1 In this chapter, we consider in much greater details certain dynamic inventory control problems of the type already encountered in section 1.3. In addition to the
More informationNotes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
More information