The CAPD library and its applications
|
|
- Gwendoline Cain
- 6 years ago
- Views:
Transcription
1 The CAPD library and its applications Daniel Wilczak Institute of Computer Science and Computational Mathematics Jagiellonian University, Kraków, Poland June 11, 2014
2 Outline: 1 Short history of the CAPD 2 Introduction to CAPD by short examples 3 Applications periodic orbits for the Lorenz system chaotic dynamics in the Rössler system continuation of stable elliptic periodic orbits
3 Computer Assisted Proofs in Dynamics
4 Marian Mrozek First version of rigorous ODE solver M.Mrozek, K.Mischaikow Encyclopedia Britanica: paper on chaos in the Lorenz equations amog 4 best results in mathematics in CAPD publically available at continuously developed at the Jagiellonian University
5 Marian Mrozek First version of rigorous ODE solver M.Mrozek, K.Mischaikow Encyclopedia Britanica: paper on chaos in the Lorenz equations amog 4 best results in mathematics in CAPD publically available at continuously developed at the Jagiellonian University
6 Marian Mrozek First version of rigorous ODE solver M.Mrozek, K.Mischaikow Encyclopedia Britanica: paper on chaos in the Lorenz equations amog 4 best results in mathematics in CAPD publically available at continuously developed at the Jagiellonian University
7 The CAPD 4.0 in 2014: core CAPD: (Multiprecision) IA, linear algebra (dense) capdredhom: (co)-homology software Pawe l Pilarczyk Pawe l D lotko Mateusz Juda capddynsys: validated numerics for dynamical systems Piotr Zgliczyński Tomasz Kapela Daniel Wilczak
8 The capddynsys 4.0 in 2014: C 0 C 1 C r ODE solvers Poincaré maps and their r th order derivatives Differential inclusions supports: double, long double, multiprecision, interval, mpfr-intervals Some applications: C 0 -computations; chaotic dynamics for many textbook systems, bifurcations for reversible systems C 1 -computations; periodic orbits (in quite high dimensions, like 300 for the N-body problem), hyperbolicity, homoclinic and heteroclinic solutions for ODEs both to equilibria and periodic solutions C 2 -computations; cocoon bifurcations, homoclinic tangencies C 3 C 5 computations; bifurcations of periodic orbits for ODEs, KAM stability of periodic solutions, invariant tori around periodic orbits
9 The capddynsys 4.0 in 2014: C 0 C 1 C r ODE solvers Poincaré maps and their r th order derivatives Differential inclusions supports: double, long double, multiprecision, interval, mpfr-intervals Some applications: C 0 -computations; chaotic dynamics for many textbook systems, bifurcations for reversible systems C 1 -computations; periodic orbits (in quite high dimensions, like 300 for the N-body problem), hyperbolicity, homoclinic and heteroclinic solutions for ODEs both to equilibria and periodic solutions C 2 -computations; cocoon bifurcations, homoclinic tangencies C 3 C 5 computations; bifurcations of periodic orbits for ODEs, KAM stability of periodic solutions, invariant tori around periodic orbits
10 The capddynsys 4.0 in 2014: C 0 C 1 C r ODE solvers Poincaré maps and their r th order derivatives Differential inclusions supports: double, long double, multiprecision, interval, mpfr-intervals Some applications: C 0 -computations; chaotic dynamics for many textbook systems, bifurcations for reversible systems C 1 -computations; periodic orbits (in quite high dimensions, like 300 for the N-body problem), hyperbolicity, homoclinic and heteroclinic solutions for ODEs both to equilibria and periodic solutions C 2 -computations; cocoon bifurcations, homoclinic tangencies C 3 C 5 computations; bifurcations of periodic orbits for ODEs, KAM stability of periodic solutions, invariant tori around periodic orbits
11 The capddynsys 4.0 in 2014: C 0 C 1 C r ODE solvers Poincaré maps and their r th order derivatives Differential inclusions supports: double, long double, multiprecision, interval, mpfr-intervals Some applications: C 0 -computations; chaotic dynamics for many textbook systems, bifurcations for reversible systems C 1 -computations; periodic orbits (in quite high dimensions, like 300 for the N-body problem), hyperbolicity, homoclinic and heteroclinic solutions for ODEs both to equilibria and periodic solutions C 2 -computations; cocoon bifurcations, homoclinic tangencies C 3 C 5 computations; bifurcations of periodic orbits for ODEs, KAM stability of periodic solutions, invariant tori around periodic orbits
12 The capddynsys 4.0 in 2014: C 0 C 1 C r ODE solvers Poincaré maps and their r th order derivatives Differential inclusions supports: double, long double, multiprecision, interval, mpfr-intervals Some applications: C 0 -computations; chaotic dynamics for many textbook systems, bifurcations for reversible systems C 1 -computations; periodic orbits (in quite high dimensions, like 300 for the N-body problem), hyperbolicity, homoclinic and heteroclinic solutions for ODEs both to equilibria and periodic solutions C 2 -computations; cocoon bifurcations, homoclinic tangencies C 3 C 5 computations; bifurcations of periodic orbits for ODEs, KAM stability of periodic solutions, invariant tori around periodic orbits
13 The capddynsys 4.0 in 2014: C 0 C 1 C r ODE solvers Poincaré maps and their r th order derivatives Differential inclusions supports: double, long double, multiprecision, interval, mpfr-intervals Some applications: C 0 -computations; chaotic dynamics for many textbook systems, bifurcations for reversible systems C 1 -computations; periodic orbits (in quite high dimensions, like 300 for the N-body problem), hyperbolicity, homoclinic and heteroclinic solutions for ODEs both to equilibria and periodic solutions C 2 -computations; cocoon bifurcations, homoclinic tangencies C 3 C 5 computations; bifurcations of periodic orbits for ODEs, KAM stability of periodic solutions, invariant tori around periodic orbits
14 Compilation of the library:./configure [options] make -j (takes some time, more than lines of code) Basic options: --with-mpfr --with-wx-config (internal graphics kernel) Building own programs: g++ main.cpp -o main capd-config --cflags --libs Optional scripts: capd-gui-config --cflags --libs mpcapd-config --cflags --libs
15 Compilation of the library:./configure [options] make -j (takes some time, more than lines of code) Basic options: --with-mpfr --with-wx-config (internal graphics kernel) Building own programs: g++ main.cpp -o main capd-config --cflags --libs Optional scripts: capd-gui-config --cflags --libs mpcapd-config --cflags --libs
16 Compilation of the library:./configure [options] make -j (takes some time, more than lines of code) Basic options: --with-mpfr --with-wx-config (internal graphics kernel) Building own programs: g++ main.cpp -o main capd-config --cflags --libs Optional scripts: capd-gui-config --cflags --libs mpcapd-config --cflags --libs
17 Compilation of the library:./configure [options] make -j (takes some time, more than lines of code) Basic options: --with-mpfr --with-wx-config (internal graphics kernel) Building own programs: g++ main.cpp -o main capd-config --cflags --libs Optional scripts: capd-gui-config --cflags --libs mpcapd-config --cflags --libs
18 Main header files #include "capd/capdlib.h" #include "capd/mpcapdlib.h" // for multiprecision #include "capd/krak/krak.h" // for graphics kernel Defined types: interval, MpFloat, MpInterval Algebra: DVector, LDVector, IVector, MpVector, MpIVector [Prefix]Matrix [Prefix]Hessian [Prefix]Jet Automatic differentiation: [Prefix]Map ODE solvers: [Prefix]OdeSolver, [Prefix]CnOdeSolver [Prefix]TimeMap, [Prefix]CnTimeMap [Prefix]PoincareMap, [Prefix]CnPoincareMap
19 Main header files #include "capd/capdlib.h" #include "capd/mpcapdlib.h" // for multiprecision #include "capd/krak/krak.h" // for graphics kernel Defined types: interval, MpFloat, MpInterval Algebra: DVector, LDVector, IVector, MpVector, MpIVector [Prefix]Matrix [Prefix]Hessian [Prefix]Jet Automatic differentiation: [Prefix]Map ODE solvers: [Prefix]OdeSolver, [Prefix]CnOdeSolver [Prefix]TimeMap, [Prefix]CnTimeMap [Prefix]PoincareMap, [Prefix]CnPoincareMap
20 Main header files #include "capd/capdlib.h" #include "capd/mpcapdlib.h" // for multiprecision #include "capd/krak/krak.h" // for graphics kernel Defined types: interval, MpFloat, MpInterval Algebra: DVector, LDVector, IVector, MpVector, MpIVector [Prefix]Matrix [Prefix]Hessian [Prefix]Jet Automatic differentiation: [Prefix]Map ODE solvers: [Prefix]OdeSolver, [Prefix]CnOdeSolver [Prefix]TimeMap, [Prefix]CnTimeMap [Prefix]PoincareMap, [Prefix]CnPoincareMap
21 Main header files #include "capd/capdlib.h" #include "capd/mpcapdlib.h" // for multiprecision #include "capd/krak/krak.h" // for graphics kernel Defined types: interval, MpFloat, MpInterval Algebra: DVector, LDVector, IVector, MpVector, MpIVector [Prefix]Matrix [Prefix]Hessian [Prefix]Jet Automatic differentiation: [Prefix]Map ODE solvers: [Prefix]OdeSolver, [Prefix]CnOdeSolver [Prefix]TimeMap, [Prefix]CnTimeMap [Prefix]PoincareMap, [Prefix]CnPoincareMap
22 Main header files #include "capd/capdlib.h" #include "capd/mpcapdlib.h" // for multiprecision #include "capd/krak/krak.h" // for graphics kernel Defined types: interval, MpFloat, MpInterval Algebra: DVector, LDVector, IVector, MpVector, MpIVector [Prefix]Matrix [Prefix]Hessian [Prefix]Jet Automatic differentiation: [Prefix]Map ODE solvers: [Prefix]OdeSolver, [Prefix]CnOdeSolver [Prefix]TimeMap, [Prefix]CnTimeMap [Prefix]PoincareMap, [Prefix]CnPoincareMap
23 Main header files #include "capd/capdlib.h" #include "capd/mpcapdlib.h" // for multiprecision #include "capd/krak/krak.h" // for graphics kernel Defined types: interval, MpFloat, MpInterval Algebra: DVector, LDVector, IVector, MpVector, MpIVector [Prefix]Matrix [Prefix]Hessian [Prefix]Jet Automatic differentiation: [Prefix]Map ODE solvers: [Prefix]OdeSolver, [Prefix]CnOdeSolver [Prefix]TimeMap, [Prefix]CnTimeMap [Prefix]PoincareMap, [Prefix]CnPoincareMap
24 The Rössler system ẋ = y z ẏ = x +by ż = b +z(x a) Theorem (Zgliczyński 1997) For a = 5.7 and b = 0.2 the system is Σ 2 -chaotic.
25 The Rössler system ẋ = y z ẏ = x +by ż = b +z(x a) Theorem (Zgliczyński 1997) For a = 5.7 and b = 0.2 the system is Σ 2 -chaotic.
26 Topological tool Theorem (Zgliczyński, 1997) If a map f : N M R 2 looks like this f N f M M N then it is Σ 2 chaotic. any binifinite sequence of symbols N and M is realized by a trajectory of f each periodic sequence of symbols N and M is realized by a periodic trajectory of f with the same period
27 Topological tool Theorem (Zgliczyński, 1997) If a map f : N M R 2 looks like this f N f M M N then it is Σ 2 chaotic. any binifinite sequence of symbols N and M is realized by a trajectory of f each periodic sequence of symbols N and M is realized by a periodic trajectory of f with the same period
28 Topological tool Theorem (Zgliczyński, 1997) If a map f : N M R 2 looks like this f N f M M N then it is Σ 2 chaotic. any binifinite sequence of symbols N and M is realized by a trajectory of f each periodic sequence of symbols N and M is realized by a periodic trajectory of f with the same period
29 Poincaré section Π = {(x,y,z) : x = 0, ẋ = (y +z) > 0} z 0 0 y 5 0 x 5 10 Wall time reported in the article: 50 hours ( sec) on 50MHz processor
30 Poincaré section Π = {(x,y,z) : x = 0, ẋ = (y +z) > 0} z 0 0 y 5 0 x 5 10 Wall time reported in the article: 50 hours ( sec) on 50MHz processor
31 The Lorenz system ẋ = 10( x +y) ẏ = 28x y xz ż = xy 8 3 z Poincaré section Π = {(x,y,z) : z = 27, ż < 0} Theorem (Z. Galias, W. Tucker, 2011) The Poincaré map P: Π Π has exactly 8798 periodic orbits of periods 2-16.
32 The Lorenz system ẋ = 10( x +y) ẏ = 28x y xz ż = xy 8 3 z Poincaré section Π = {(x,y,z) : z = 27, ż < 0} Theorem (Z. Galias, W. Tucker, 2011) The Poincaré map P: Π Π has exactly 8798 periodic orbits of periods 2-16.
33 The Lorenz system ẋ = 10( x +y) ẏ = 28x y xz ż = xy 8 3 z Poincaré section Π = {(x,y,z) : z = 27, ż < 0} Theorem (Z. Galias, W. Tucker, 2011) The Poincaré map P: Π Π has exactly 8798 periodic orbits of periods 2-16.
34 Π ± = {(x,y,z) : z = 27, ż R ± } P ± : Π ± Π Interval Newton Method applied to: x 1 x 1 P (x 2p ) F: R 4p x 2. x 2 P + (x 1 ). R4p x 2p P + (x 2p 1 ) x 2p
35 Validation of zeros of maps Interval Newton Operator f : R n R n smooth X R n - a convex, compact set x 0 int(x) N(f,X,x 0 ) := x 0 conv(df(x)) 1 f(x 0 ) Theorem If N(f,X,x 0 ) int(x) then f has a unique zero x int(x). Moreover x N(f,X,x 0 ). Toy example: f(x) = x(x 2 +2)+1 Approx zero of f is x x 0 = 0.5 f(x 0 ) = X = [ 1,0] Df(X) [2,5] N(f,X,x 0 ) [ 0.475, ] intx = ( 1,0)
36 Validation of zeros of maps Interval Newton Operator f : R n R n smooth X R n - a convex, compact set x 0 int(x) N(f,X,x 0 ) := x 0 conv(df(x)) 1 f(x 0 ) Theorem If N(f,X,x 0 ) int(x) then f has a unique zero x int(x). Moreover x N(f,X,x 0 ). Toy example: f(x) = x(x 2 +2)+1 Approx zero of f is x x 0 = 0.5 f(x 0 ) = X = [ 1,0] Df(X) [2,5] N(f,X,x 0 ) [ 0.475, ] intx = ( 1,0)
37 Validation of zeros of maps Interval Newton Operator f : R n R n smooth X R n - a convex, compact set x 0 int(x) N(f,X,x 0 ) := x 0 conv(df(x)) 1 f(x 0 ) Theorem If N(f,X,x 0 ) int(x) then f has a unique zero x int(x). Moreover x N(f,X,x 0 ). Toy example: f(x) = x(x 2 +2)+1 Approx zero of f is x x 0 = 0.5 f(x 0 ) = X = [ 1,0] Df(X) [2,5] N(f,X,x 0 ) [ 0.475, ] intx = ( 1,0)
38 Validation of zeros of maps Interval Newton Operator f : R n R n smooth X R n - a convex, compact set x 0 int(x) N(f,X,x 0 ) := x 0 conv(df(x)) 1 f(x 0 ) Theorem If N(f,X,x 0 ) int(x) then f has a unique zero x int(x). Moreover x N(f,X,x 0 ). Toy example: f(x) = x(x 2 +2)+1 Approx zero of f is x x 0 = 0.5 f(x 0 ) = X = [ 1,0] Df(X) [2,5] N(f,X,x 0 ) [ 0.475, ] intx = ( 1,0)
39 Validation of zeros of maps Interval Newton Operator f : R n R n smooth X R n - a convex, compact set x 0 int(x) N(f,X,x 0 ) := x 0 conv(df(x)) 1 f(x 0 ) Theorem If N(f,X,x 0 ) int(x) then f has a unique zero x int(x). Moreover x N(f,X,x 0 ). Toy example: f(x) = x(x 2 +2)+1 Approx zero of f is x x 0 = 0.5 f(x 0 ) = X = [ 1,0] Df(X) [2,5] N(f,X,x 0 ) [ 0.475, ] intx = ( 1,0)
tutorial i: Using matcont for numerical integration of ODEs
tutorial i: Using matcont for numerical integration of ODEs u.a. Kuznetsov Department of Mathematics Utrecht University Budapestlaan TA, Utrecht September, This session illustrates how to input a system
More informationParameter Estimation in Differential Equations: A Numerical Study of Shooting Methods
Parameter Estimation in Differential Equations: A Numerical Study of Shooting Methods Franz Hamilton Faculty Advisor: Dr Timothy Sauer January 5, 2011 Abstract Differential equation modeling is central
More informationExistence and Dynamics of Bounded Traveling Wave Solutions to Getmanou Equation
Commun. Theor. Phys. 70 (2018) 672 676 Vol. 70, No. 6, December 1, 2018 Existence and Dynamics of Bounded Traveling Wave Solutions to Getmanou Equation Zhen-Shu Wen ( 温振庶 ) School of Mathematical Sciences,
More informationOn a Method of Finding Homoclinic and Heteroclinic Orbits in. Multidimensional Dynamical Systems
Applie Mathematics & Information Sciences 4(3) (), 383 394 An International Journal c Diie W Publishing Corporation, U. S. A. On a Metho of Fining Homoclinic an Heteroclinic Orbits in Multiimensional Dynamical
More informationRigorous interval computations of hyperbolic tetrahedral shapes
Rigorous interval computations of hyperbolic tetrahedral shapes Neil Hoffman joint with Kazuhiro Ichihara (Nihon University), Masahide Kashiwagi (Waseda), Hidetoshi Masai (Tokyo Tech), Shin ichi Oishi
More informationOsinga, HM., & Krauskopf, B. (Accepted/In press). The Lorenz manifold: Crochet and curvature.
Osinga, HM., & Krauskopf, B. (Accepted/In press). The Lorenz manifold: Crochet and curvature. Early version, also known as pre-print Link to publication record in Explore Bristol Research PDF-document
More information6.094 Introduction to MATLAB January (IAP) 2009
MIT OpenCourseWare http://ocw.mit.edu 6.094 Introduction to MATLAB January (IAP) 009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 6.094: Introduction
More informationambrosys The Taylor series method for ordinary differential equations Karsten Ahnert 1,2 Mario Mulansky 2 December, 8, 2011
1 The Taylor series method for ordinary differential equations Karsten Ahnert 1,2 Mario Mulansky 2 1 Ambrosys GmbH, Potsdam 2 Institut für Physik und Astronomie, Universität Potsdam December, 8, 2011 ambrosys
More informationJournal of mathematics and computer science 13 (2014),
Journal of mathematics and computer science 13 (2014), 231-237 Interval Interpolation by Newton's Divided Differences Ali Salimi Shamloo Parisa Hajagharezalou Department of Mathematics, Shabestar Branch,
More informationIntroduction to Riemann surfaces, moduli spaces and its applications
Introduction to Riemann surfaces, moduli spaces and its applications Oscar Brauer M2, Mathematical Physics Outline 1. Introduction to Moduli Spaces 1.1 Moduli of Lines 1.2 Line Bundles 2. Moduli space
More informationA Compact Minimal Space Whose Cartesian Square Is Not Minimal
University of Dayton ecommons Summer Conference on Topology and Its Applications Department of Mathematics 6-2017 A Compact Minimal Space Whose Cartesian Square Is Not Minimal Jan P. Boronski AGH University
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationReview Initial Value Problems Euler s Method Summary
THE EULER METHOD P.V. Johnson School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 INITIAL VALUE PROBLEMS The Problem Posing a Problem 3 EULER S METHOD Method Errors 4 SUMMARY OUTLINE 1 REVIEW 2 INITIAL
More information. Tutorial Class V 3-10/10/2012 First Order Partial Derivatives;...
Tutorial Class V 3-10/10/2012 1 First Order Partial Derivatives; Tutorial Class V 3-10/10/2012 1 First Order Partial Derivatives; 2 Application of Gradient; Tutorial Class V 3-10/10/2012 1 First Order
More informationUniversity of Bristol - Explore Bristol Research. Early version, also known as pre-print
Krauskopf, B., Osinga, HM., Doedel, EJ., Henderson, ME., Guckenheimer, J., Vladimirsky, A.,... Junge, O. (2004). A survey of methods for computing (un)stable manifolds of vector fields. Early version,
More informationBoolean Algebra. P1. The OR operation is closed for all x, y B x + y B
Boolean Algebra A Boolean Algebra is a mathematical system consisting of a set of elements B, two binary operations OR (+) and AND ( ), a unary operation NOT ('), an equality sign (=) to indicate equivalence
More information2 Second Derivatives. As we have seen, a function f (x, y) of two variables has four different partial derivatives: f xx. f yx. f x y.
2 Second Derivatives As we have seen, a function f (x, y) of two variables has four different partial derivatives: (x, y), (x, y), f yx (x, y), (x, y) It is convenient to gather all four of these into
More information5.6 Self-organizing maps (SOM) [Book, Sect. 10.3]
Ch.5 Classification and Clustering 5.6 Self-organizing maps (SOM) [Book, Sect. 10.3] The self-organizing map (SOM) method, introduced by Kohonen (1982, 2001), approximates a dataset in multidimensional
More informationDistance-to-Solution Estimates for Optimization Problems with Constraints in Standard Form
Distance-to-Solution Estimates for Optimization Problems with Constraints in Standard Form Philip E. Gill Vyacheslav Kungurtsev Daniel P. Robinson UCSD Center for Computational Mathematics Technical Report
More information4. Definition: topological space, open set, topology, trivial topology, discrete topology.
Topology Summary Note to the reader. If a statement is marked with [Not proved in the lecture], then the statement was stated but not proved in the lecture. Of course, you don t need to know the proof.
More informationHomology of PV programs
Homology of PV programs Mateusz Juda Jagiellonian University ACAT Project meeting Vienna 9 July 2015 Mateusz Juda Jagiellonian University ACAT Project meeting Homology of PV programs Vienna 9 July 2015
More informationPartial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives
In general, if f is a function of two variables x and y, suppose we let only x vary while keeping y fixed, say y = b, where b is a constant. By the definition of a derivative, we have Then we are really
More informationFractal Art based on The Butterfly Effect of Chaos Theory
Fractal Art based on The Butterfly Effect of Chaos Theory Yin-Wei Chang and Fay Huang Institute of Computer Science and Information Engineering National Ilan University, Taiwan Abstract. This paper proposes
More informationPreprint. DOI Bookmark:
General Copyright Notice The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial
More informationNAME: Section # SSN: X X X X
Math 155 FINAL EXAM A May 5, 2003 NAME: Section # SSN: X X X X Question Grade 1 5 (out of 25) 6 10 (out of 25) 11 (out of 20) 12 (out of 20) 13 (out of 10) 14 (out of 10) 15 (out of 16) 16 (out of 24)
More informationThe Fundamental Group, Braids and Circles
The Fundamental Group, Braids and Circles Pete Goetz Mathematics Colloquium Humboldt State University April 17, 2014 Outline 1) Topology 2) Path Homotopy and The Fundamental Group 3) Covering Spaces and
More informationScicos is a Scilab toolbox included in the ScicosLab package. The Scicos editor can be opened by the scicos command
7 Getting Started 7.1 Construction of a Simple Diagram Scicos contains a graphical editor that can be used to construct block diagram models of dynamical systems. The blocks can come from various palettes
More information302 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES. 4. Function of several variables, their domain. 6. Limit of a function of several variables
302 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.8 Chapter Review 3.8.1 Concepts to Know You should have an understanding of, and be able to explain the concepts listed below. 1. Boundary and interior points
More informationOrientation of manifolds - definition*
Bulletin of the Manifold Atlas - definition (2013) Orientation of manifolds - definition* MATTHIAS KRECK 1. Zero dimensional manifolds For zero dimensional manifolds an orientation is a map from the manifold
More informationSection 4.2 selected answers Math 131 Multivariate Calculus D Joyce, Spring 2014
4. Determine the nature of the critical points of Section 4. selected answers Math 11 Multivariate Calculus D Joyce, Spring 014 Exercises from section 4.: 6, 1 16.. Determine the nature of the critical
More informationTrue/False. MATH 1C: SAMPLE EXAM 1 c Jeffrey A. Anderson ANSWER KEY
MATH 1C: SAMPLE EXAM 1 c Jeffrey A. Anderson ANSWER KEY True/False 10 points: points each) For the problems below, circle T if the answer is true and circle F is the answer is false. After you ve chosen
More informationDefinition 3.1 The partial derivatives of a function f(x, y) defined on an open domain containing (x, y) are denoted by f
Chapter 3 Draft October 3, 009 3. Partial Derivatives Overview: Partial derivatives are defined by differentiation in one variable, viewing all others as constant (frozen at some value). The reduction
More informationA fast method for approximating invariant manifolds 1 J. Guckenheimer and A. Vladimirsky Dept. of Mathematics Cornell University
A fast method for approximating invariant manifolds 1 J. Guckenheimer and A. Vladimirsky Dept. of Mathematics Cornell University Abstract The task of constructing higher-dimensional invariant manifolds
More informationHw 4 Due Feb 22. D(fg) x y z (
Hw 4 Due Feb 22 2.2 Exercise 7,8,10,12,15,18,28,35,36,46 2.3 Exercise 3,11,39,40,47(b) 2.4 Exercise 6,7 Use both the direct method and product rule to calculate where f(x, y, z) = 3x, g(x, y, z) = ( 1
More informationLecture 0: Reivew of some basic material
Lecture 0: Reivew of some basic material September 12, 2018 1 Background material on the homotopy category We begin with the topological category TOP, whose objects are topological spaces and whose morphisms
More informationMath 21a Tangent Lines and Planes Fall, What do we know about the gradient f? Tangent Lines to Curves in the Plane.
Math 21a Tangent Lines and Planes Fall, 2016 What do we know about the gradient f? Tangent Lines to Curves in the Plane. 1. For each of the following curves, find the tangent line to the curve at the point
More informationChapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces
Chapter 6 Curves and Surfaces In Chapter 2 a plane is defined as the zero set of a linear function in R 3. It is expected a surface is the zero set of a differentiable function in R n. To motivate, graphs
More informationSizing Up Outer Billiard Tables
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL 0, NO (0) Sizing Up Outer Billiard Tables Filiz Doǧru Department of Mathematics Grand Valley State University Campus Drive Allendale, Michigan 4940 USA Samuel
More informationMath 205B - Topology. Dr. Baez. February 23, Christopher Walker
Math 205B - Topology Dr. Baez February 23, 2007 Christopher Walker Exercise 60.2. Let X be the quotient space obtained from B 2 by identifying each point x of S 1 with its antipode x. Show that X is homeomorphic
More informationHP 50g Examples. Getting Started
HP 50g Examples The examples collected in this brief article are meant as an introduction to the HP 50g graphing calculator. Although the HP 50g can switch between Reverse Polish Notation (RPN) input and
More informationSome irrational polygons have many periodic billiard paths
Some irrational polygons have many periodic billiard paths W. Patrick Hooper Northwestern University Spring Topology and Dynamics Conference Milwaukee, Wisconsin March 5, 8 Lower bounds on growth rates
More informationVOL. 2, NO. 10, Nov 2012 ISSN ARPN Journal of Science and Technology All rights reserved.
A Fixed Point Theorem for Surfaces 1 Süheyla Elmas, 2 Seyfullah Hızarcı, 3 Abdullah Kaplan 1 Department of Mathematics, Atatürk University 25240-Erzurum, Turkey. 2 Department of Mathematics Education K.K.Education
More informationSystem Identification Algorithms and Techniques for Systems Biology
System Identification Algorithms and Techniques for Systems Biology by c Choujun Zhan A Thesis submitted to the School of Graduate Studies in partial fulfillment of the requirements for the degree of Doctor
More informationErgodic theory in fluid mixing: Eulerian and Lagrangian features
: Eulerian and Lagrangian features Department of Applied Mathematics University of Leeds Thursday 11 August 2008 MIMS Workshop on New Directions in Ergodic Theory: Probabilistic Aspects of Skew-Product
More informationFebruary 2017 (1/20) 2 Piecewise Polynomial Interpolation 2.2 (Natural) Cubic Splines. MA378/531 Numerical Analysis II ( NA2 )
f f f f f (/2).9.8.7.6.5.4.3.2. S Knots.7.6.5.4.3.2. 5 5.2.8.6.4.2 S Knots.2 5 5.9.8.7.6.5.4.3.2..9.8.7.6.5.4.3.2. S Knots 5 5 S Knots 5 5 5 5.35.3.25.2.5..5 5 5.6.5.4.3.2. 5 5 4 x 3 3.5 3 2.5 2.5.5 5
More informationarxiv: v1 [math.gr] 19 Dec 2018
GROWTH SERIES OF CAT(0) CUBICAL COMPLEXES arxiv:1812.07755v1 [math.gr] 19 Dec 2018 BORIS OKUN AND RICHARD SCOTT Abstract. Let X be a CAT(0) cubical complex. The growth series of X at x is G x (t) = y V
More informationConfigurations of embedded spheres
Configurations of embedded spheres Daniel Ruberman University of Wisconsin, Madison November 13, 2015 Daniel Ruberman Configurations of embedded spheres November 13, 2015 1 / 20 Introduction Joint project
More information(1) Given the following system of linear equations, which depends on a parameter a R, 3x y + 5z = 2 4x + y + (a 2 14)z = a + 2
(1 Given the following system of linear equations, which depends on a parameter a R, x + 2y 3z = 4 3x y + 5z = 2 4x + y + (a 2 14z = a + 2 (a Classify the system of equations depending on the values of
More informationMAS212 Scientific Computing and Simulation
MAS212 Scientific Computing and Simulation Dr. Sam Dolan School of Mathematics and Statistics, University of Sheffield Autumn 2017 http://sam-dolan.staff.shef.ac.uk/mas212/ G18 Hicks Building s.dolan@sheffield.ac.uk
More informationThe Classification Problem for 3-Manifolds
The Classification Problem for 3-Manifolds Program from ca. 1980: 1. Canonical decomposition into simpler pieces. 2. Explicit classification of special types of pieces. 3. Generic pieces are hyperbolic
More informationRelaxing Goodness is Still Good
Relaxing Goodness is Still Good Gordon Pace 1 Gerardo Schneider 2 1 Dept. of Computer Science and AI University of Malta 2 Dept. of Informatics University of Oslo ICTAC 08 September 1-3, 2008 - Istanbul,
More informationBOOLEAN ALGEBRA. 1. State & Verify Laws by using :
BOOLEAN ALGEBRA. State & Verify Laws by using :. State and algebraically verify Absorption Laws. (2) Absorption law states that (i) X + XY = X and (ii) X(X + Y) = X (i) X + XY = X LHS = X + XY = X( + Y)
More informationHistory of Topology. Semester I, Graham Ellis NUI Galway, Ireland
History of Topology Semester I, 2009-10 Graham Ellis NUI Galway, Ireland History of Topology Outline Lecture 1: What is topology? Euler circuits in graphs Lecture 2: Topological invariants: Euler-Poincaré
More informationAn Introduction to Belyi Surfaces
An Introduction to Belyi Surfaces Matthew Stevenson December 16, 2013 We outline the basic theory of Belyi surfaces, up to Belyi s theorem (1979, [1]), which characterizes these spaces as precisely those
More information13.2 LIMITS AND CONTINUITY
3.2 Limits and Continuity Contemporary Calculus 3.2 LIMITS AND CONTINUITY Our development of the properties and the calculus of functions z = f(x,y) of two (and more) variables parallels the development
More informationAssociative Operations on a Three-Element Set
The Mathematics Enthusiast Volume 5 Number 2 Numbers 2 & 3 Article 9 7-2008 Associative Operations on a Three-Element Set Friðrik Diego Kristín Halla Jónsdóttir Let us know how access to this document
More informationMathematics for chemical engineers
Mathematics for chemical engineers Drahoslava Janovská Department of mathematics Winter semester 2013-2014 Numerical solution of ordinary differential equations Initial value problem Outline 1 Introduction
More information6.2 Classification of Closed Surfaces
Table 6.1: A polygon diagram 6.1.2 Second Proof: Compactifying Teichmuller Space 6.2 Classification of Closed Surfaces We saw that each surface has a triangulation. Compact surfaces have finite triangulations.
More informationSection 3.2 Properties of a Function s Graph
Section 3. Properties of a Function s Graph Objectives Find the intercepts of a function given its formula. Given the graph of a function, identify the domain and range of the function. Approximate relative
More informationA barrier on convex cones with parameter equal to the dimension
A barrier on convex cones with parameter equal to the dimension Université Grenoble 1 / CNRS August 23 / ISMP 2012, Berlin Outline 1 Universal barrier 2 Projective images of barriers Pseudo-metric on the
More informationWebsite.
Admin stuff Questionnaire Name Email Math courses taken so far General academic trend (major) General interests What about Chaos interests you the most? What computing experience do you have? Website www.cse.ucsc.edu/classes/ams146/spring05/index.html
More informationMAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS
MAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS MAT203 covers essentially the same material as MAT201, but is more in depth and theoretical. Exam problems are often more sophisticated in scope and difficulty
More informationSection 1.8. Simplifying Expressions
Section 1.8 Simplifying Expressions But, first Commutative property: a + b = b + a; a * b = b * a Associative property: (a + b) + c = a + (b + c) (a * b) * c = a * (b * c) Distributive property: a * (b
More informationBoundary Curves of Incompressible Surfaces
Boundary Curves of Incompressible Surfaces Allen Hatcher This is a Tex version, made in 2004, of a paper that appeared in Pac. J. Math. 99 (1982), 373-377, with some revisions in the exposition. Let M
More informationarxiv: v2 [math.ag] 8 Mar 2017
arxiv:1412.5313v2 [math.g] 8 Mar 2017 M-curves of degree 9 or 11 with one unique non-empty oval Séverine Fiedler-Le Touzé June 27, 2018 bstract In this note, we consider M-curves of odd degree m with real
More informationCOMPUTER-ASSISTED PROOFS AND SYMBOLIC COMPUTATIONS * Walter Krämer
Serdica J. Computing 4 (2010), 73 84 COMPUTER-ASSISTED PROOFS AND SYMBOLIC COMPUTATIONS * Walter Krämer Abstract. We discuss some main points of computer-assisted proofs based on reliable numerical computations.
More informationCircuit analysis summary
Boolean Algebra Circuit analysis summary After finding the circuit inputs and outputs, you can come up with either an expression or a truth table to describe what the circuit does. You can easily convert
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Calculus III-Final review Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Find the corresponding position vector. 1) Define the points P = (-,
More informationThe Convex Hull of a Space Curve
The Convex Hull of a Space Curve Bernd Sturmfels, UC Berkeley (joint work with Kristian Ranestad) The Mathematics of Klee & Grünbaum: 100 Years in Seattle Friday, July 30, 2010 Convex Hull of a Trigonometric
More informationMATH11007 NOTES 12: PARAMETRIC CURVES, ARCLENGTH ETC.
MATH117 NOTES 12: PARAMETRIC CURVES, ARCLENGTH ETC. 1. Parametric representation of curves The position of a particle moving in three-dimensional space is often specified by an equation of the form For
More informationA template-based C++ library for automatic differentiation and hull consistency enforcing
A template-based C++ library for automatic differentiation and hull consistency enforcing Bartłomiej Jacek Kubica Department of Applied Informatics Warsaw University of Life Sciences SCAN 2016, Uppsala
More informationGeometric structures on 2-orbifolds
Geometric structures on 2-orbifolds Section 1: Manifolds and differentiable structures S. Choi Department of Mathematical Science KAIST, Daejeon, South Korea 2010 Fall, Lectures at KAIST S. Choi (KAIST)
More informationAttractors and basins of dynamical systems
Electronic Journal of Qualitative Theory of Differential Equations 2011, No. 20, 1-11; http://www.math.u-szeged.hu/ejqtde/ Attractors and basins of dynamical systems Attila Dénes, Géza Makay Abstract There
More informationGreed Considered Harmful
Greed Considered Harmful Nonlinear (in)stabilities in network resource allocation Priya Ranjan Indo-US workshop 2009 Outline Background Model & Motivation Main results Fixed delays Single-user, single-link
More informationDon t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary?
Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary? Is the converse true? What happens in the classical special case?
More informationSINGULARITY THEORY. International Review of Mathematics. Manchester, 4 December 2003
SINGULARITY THEORY International Review of Mathematics Manchester, 4 December 2003 www.liv.ac.uk/ goryunov/irm.pdf 1 Singularity Theory a far-reaching generalization of investigations of local extrema
More informationdx/dt = (y + z) dy/dt = x + ay dz/dt = b + z(x c)
Exercise 4.2: Rossler attractor In 1976 Otto Eberhard Rössler published the paper An Equation for Continuous Chaos (Physics Letters, 57A, 397-398). He modeled a chemical reaction mechanism with the system
More informationStable maps and branched shadows of 3-manifolds
Stable maps and branched shadows of 3-manifolds Yuya KODA Hiroshima University) joint work with Masaharu ISHIKAWA (Tohoku University) RIMS Seminar, Numazu, May 26, 2015 Topology, Geometry and Algebra of
More informationFloating-Point Arithmetic
Floating-Point Arithmetic 1 Numerical Analysis a definition sources of error 2 Floating-Point Numbers floating-point representation of a real number machine precision 3 Floating-Point Arithmetic adding
More informationTopological properties of convex sets
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 5: Topological properties of convex sets 5.1 Interior and closure of convex sets Let
More informationPreparation Meeting. Recent Advances in the Analysis of 3D Shapes. Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers
Preparation Meeting Recent Advances in the Analysis of 3D Shapes Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers What You Will Learn in the Seminar Get an overview on state of the art
More informationADVENTURE_IO. User s Manual. Version 1.2. ADVENTURE Project. February 17, 2006 ADVENTURE SYSTEM
ADVENTURE_IO Input / Output format and libraries for ADVENTURE modules Version 1.2 User s Manual February 17, 2006 ADVENTURE Project Contents 1. Outline...3 2. Installation Procedure...4 3. Library Linkage...2
More informationAn intelligent system for automated mathematical modelling and simulation of dynamical engineering systems
An intelligent system for automated mathematical modelling and simulation of dynamical engineering systems O. Castillo a & P. Melin b a Dept. of Computer Science, Instituto Tecnologico de Tijuana, EMail:
More informationGeneralized alternative and Malcev algebras
Mathematics Publications Mathematics 1982 Generalized alternative and Malcev algebras Irvin R. Hentzel Iowa State University, hentzel@iastate.edu H.F. Smith Iowa State University Follow this and additional
More informationPERSISTENT HOMOLOGY OF FINITE TOPOLOGICAL SPACES
PERSISTENT HOMOLOGY OF FINITE TOPOLOGICAL SPACES HANEY MAXWELL Abstract. We introduce homology and finite topological spaces. From the basis of that introduction, persistent homology is applied to finite
More informationMATH11007 NOTES 15: PARAMETRIC CURVES, ARCLENGTH ETC.
MATH117 NOTES 15: PARAMETRIC CURVES, ARCLENGTH ETC. 1. Parametric representation of curves The position of a particle moving in three-dimensional space is often specified by an equation of the form For
More informationGeometric Structures on Manifolds
Geometric Structures on Manifolds Sam Ballas (joint with J. Danciger and G.-S. Lee) Mathematics Colloquium Florida State University January 15, 2016 1. Background 1.1 What is Geometry? 1.2 Examples 1.3
More informationRobust Morse Decompositions of Piecewise Constant Vector Fields
Robust Morse Decompositions of Piecewise Constant Vector Fields Andrzej Szymczak, Member, IEEE, and Eugene Zhang, Member, IEEE Computer Society Abstract In this paper, we introduce a new approach to computing
More informationInterval Analysis for Guaranteed Set Estimation
1/54 Interval Analysis for Guaranteed Set Estimation MaGiX@LiX September 2011 Eric Walter (joint work with L. Jaulin, M. Kieffer et al.) Laboratoire des Signaux et Systèmes CNRS Supélec Univ Paris-Sud
More informationPartial Differential Equations
Simulation in Computer Graphics Partial Differential Equations Matthias Teschner Computer Science Department University of Freiburg Motivation various dynamic effects and physical processes are described
More informationStandard Forms of Expression. Minterms and Maxterms
Standard Forms of Expression Minterms and Maxterms Standard forms of expressions We can write expressions in many ways, but some ways are more useful than others A sum of products (SOP) expression contains:
More informationThe Arithmetic Toolbox in
The Arithmetic Toolbox in Computational Geometry Algorithms Library Sylvain Pion Mini-workshop on irram/mpc/mpfr Schloß Dagstuhl April 18-20, 2018 Talk outline Brief overview of CGAL Robustness issues
More informationStable and Multiscale Topological Signatures
Stable and Multiscale Topological Signatures Mathieu Carrière, Steve Oudot, Maks Ovsjanikov Inria Saclay Geometrica April 21, 2015 1 / 31 Shape = point cloud in R d (d = 3) 2 / 31 Signature = mathematical
More informationPrecision Spin Tracking for Electric Dipole Moment Searches
Precision Spin Tracking for Electric Dipole Moment Searches Outline: Spin Evolution in Storage Rings Technique for EDM Measurement and Systematic Errors Integration Methods, Current Status of Our Program
More informationConvex Optimization M2
Convex Optimization M2 Lecture 1 A. d Aspremont. Convex Optimization M2. 1/49 Today Convex optimization: introduction Course organization and other gory details... Convex sets, basic definitions. A. d
More informationStandard Boolean Forms
Standard Boolean Forms In this section, we develop the idea of standard forms of Boolean expressions. In part, these forms are based on some standard Boolean simplification rules. Standard forms are either
More informationPermutation Matrices. Permutation Matrices. Permutation Matrices. Permutation Matrices. Isomorphisms of Graphs. 19 Nov 2015
9 Nov 25 A permutation matrix is an n by n matrix with a single in each row and column, elsewhere. If P is a permutation (bijection) on {,2,..,n} let A P be the permutation matrix with A ip(i) =, A ij
More informationContinuous Spaced-Out Cluster Category
Brandeis University, Northeastern University March 20, 2011 C π Г T The continuous derived category D c is a triangulated category with indecomposable objects the points (x, y) in the plane R 2 so that
More informationData Analysis, Persistent homology and Computational Morse-Novikov theory
Data Analysis, Persistent homology and Computational Morse-Novikov theory Dan Burghelea Department of mathematics Ohio State University, Columbuus, OH Bowling Green, November 2013 AMN theory (computational
More informationGradient and Directional Derivatives
Gradient and Directional Derivatives MATH 311, Calculus III J. Robert Buchanan Department of Mathematics Fall 2011 Background Given z = f (x, y) we understand that f : gives the rate of change of z in
More information