On a Method of Finding Homoclinic and Heteroclinic Orbits in. Multidimensional Dynamical Systems
|
|
- Lynn Palmer
- 5 years ago
- Views:
Transcription
1 Applie Mathematics & Information Sciences 4(3) (), An International Journal c Diie W Publishing Corporation, U. S. A. On a Metho of Fining Homoclinic an Heteroclinic Orbits in Multiimensional Dynamical Systems Gheorghe Tigan Politehnica University of Timisoara, P-ta Victoriei, Nr., 36, Timisoara, Romania Aress: gheorghe.tigan@mat.upt.ro Receive November, 8; Revise November 3, 8 The presence of boune orbits such as homoclinic an heteroclinic orbits are important in a ynamical system. Chaotical behavior or the presence of perioic orbits of a system is often precee by estruction of a homoclinic or heteroclinic orbit. In this work we give insights on a metho of etecting homoclinic or heteroclinic orbits in a three-imensional ynamical system. The metho can also be applie for multiimensional systems. Keywors: Dynamical systems, heteroclinic orbits, chaos. Mathematics Subject Classification: 37C9, 65P3. Introuction an Necessary Theoretical Notions In this paper we present insights on a metho ealing with etecting homoclinic or heteroclinic orbits in a ynamical system generate by ifferential equations. The iea is to trace the separatrices (stable an unstable manifols) until they hit a given surface an then look for conitions such that the separatrices meet one to another on this surface. Fining homoclinic an heteroclinic orbits in a given ynamical system is not an easy task but their presence tell us much about the behavior of the system. For eample, estroying a homoclinic or heteroclinic orbit can bring a system in chaos in some cases while in others it leas only to the appearance of perioic orbits. Consier a surface S in R 3 given by S : F (, y, z) =,F C (R 3 ). A normal vector to S at a point (, y, z) S is the graient vector graf (, y, z) =(F,F y,f z). The surface S splits the space in two regions accoring to F > (the positive region) or F < (the negative region) an assume the normal vector graf (, y, z) lies in the positive region.
2 384 Gheorghe Tigan If a trajectory (for t increasing ) of a ifferential system u = f(u), (.) where u =(ẋ, ẏ, ż), f(u) =(f (, y, z),f (, y, z),f 3 (, y, z)), hits the surface S at a point A(,y,z ) coming from the positive region F >, then the vector fiel f at A (which is tangent to the trajectory) makes with the graient vector graf at A an angle larger than 9, see Fig... Since cos(graf, f) = gra F f gra F f, it follows that gra F f<at A. On the other han, t F (, y, z) F = = F ẋ + F y ẏ + F z ż F = = graf f<, at A. gra F S f Figure.: An orbit tangent to the vector fiel f at a point A, entering transversally the surface S : F (, y, z) =coming from the positive region F>, makes with the graient vector graf at A an angle larger than 9. As a conclusion, we have Proposition.. If the erivative (for t increasing) along a trajectory of the system (.), t F (, y, z) F = <, then the trajectory hits the surface S : F (, y, z) =coming from the positive region F (, y, z) >. If t F (, y, z) F = >, then it crosses the surface S : F (, y, z) =coming from the negative region F (, y, z) <. For t ecreasing, the scenario is inversely, i.e. if t F (, y, z) F = <, the trajectory hits the surface S coming from the negative region an if t F (, y, z) F = >, the trajectory hits the surface S coming from the positive region.
3 Fining Homoclinic an Heteroclinic Orbits 385 Remark.. If t F (, y, z) F =, the surface S is calle without contact for trajectories of the system or a transversally section to the flow of the system. If t F (, y, z) F = = then the trajectory is inclue in S or tangent to it. Tracing the Unstable Manifol W u + We will apply the metho for etecting homoclinic orbits only but similarly it can be applie for heteroclinic orbits. The system consiere in this work is a Shimizu-Moriokalike 3D moel given by ẋ = y, ẏ =(a + )( z) ay, ż = z. (.) Applications of Shimizu-Morioka moels are suggeste in []. In [3, 4] two types of Lorenz-like attractors of this system are shown. Relationships with the theory of normal forms are reporte in [6, 8]. Computer assiste results on the behavior of the system are obtaine in [5]. The equilibrium points of the system are O(,, ),O (,, ),O (,, ). As the system is invariant uner the transformation, y y, its orbits are symmetrically with respect to the Oz ais, so, with no loss of generality, we may restrict our investigations to >. Since a homoclinic or heteroclinic orbit is boune an for z < the erivative ż>, they will lie in z>, so we may restrict further to z>. The Jacobian matri associate to the system at O(,, ) has the eigenvalues,, a an the corresponing eigenvectors (,, ), (,, ), ( /(a +),, ), so O(,, ) is a sale. Assume a + >. Therefore the system has a one-imensional unstable manifol W u an a two-imensional stable manifol W s passing through O(,, ). We have also the one-imensional tangent space to W u at O(,, ), TW u = {(, y, z) : = y, z =} an the two-imensional tangent space to W s at O(,, ), TW s = {(, y, z) :y + (a +)=,z R}. The Jacobian matri at O, has the characteristic polynomial p 3 +(a +)p + ap +a +=.
4 386 Gheorghe Tigan From Routh-Hourwitz conitions, the characteristic polynomial has all roots with negative real part if an only if a>. Notice that the positive part of Oz ais, enote by +, belongs to W s. Denote W u + the branch of W u lying in y> an W u the branch of W u lying in y<. Consier the equation of W u + in the neighborhoo of O(,, ) given by y = a + a + a z = b + b + b b (.) As W u = W+ W u u is invariant uner the action of the flow of the system, after computing the coefficients, equations of W+ u for small enough, are given by y = +,z= 3 +. (.3) So for small enough, W+ u lies in the region { } R = (, y, z): <y<, 3 <z<,>. In [7] we prove that W+ u lies in the region /3 <z< not only for small but for all >,y >. We want to estimate now the coorinate of the point where W+ u crosses y =. Consier the surface in R 3,y= b, <z<,b >. As b <,b> the surface y = b is below W+ u for small enough. We are intereste uner what conitions, trajectories lying in /3 <z< can cross this surface. Proposition.. The surface in R 3,y= b, <z<,b > is a surface without contact for trajectories of the system. If t increases, trajectories of the system cross the surface on the sie y< b b(a +3) for all << a ++b,b>. In particular, if b =we obtain that the trajectories of the system (an implicitly W+) u for <z< cross y =for. Proof. if b (a +3) < a ++b := u, we have ( y + b ) y= b > ( ( a ++b ) b (a +3) ) >. t We use z<. So the surface y = b, <z< is without contact for trajectories of the system an for t increases, trajectories of the system cut the surface on the sie
5 Fining Homoclinic an Heteroclinic Orbits 387 y< b for all << u,b >. Notice that u /b for all b an all a +>. Consequently, u =is the inferior (an maimum in this estimation) limit which is vali for all a +> such that trajectories cross the plane y =for >. Consier now a curve above W u +,y= c,c>,>. One may remark that for any >, c> we have c >for small enough, more eactly if <(c )/. So the surface y = c is above W u + for small enough. Proposition.. There eists c>,>, c/ = 3 such that the surface in R 3, y = c, 3 <z is a surface without contact for trajectories of the system for all >. Ift increases, trajectories of the system cross the surface for all a>,a 8a 8 > on the sie y>c. Consequently, for a>,a 8a 8 > trajectories (an implicitly W+) u starting in cross y =for 3. y<c, 3 <z Proof. We have ( y c + ) y=c (.4) t ( < ( + a + ) ) (a +3c) + c + ac a < 3 for all >if ( (a +3c) 4 + a + ) (c + ac a ), 3 or equivalently < 4(a ( +)(c ) (a + c +) ) := m. 3 (a c) +8(a +) As the intersection of y = c with O is an c/, we are intereste in the maimum of in orer to see how low on O trajectories can cross y =. So take = m an estimate the minimum of c/ for c>,a+>. Denoting p = c /, we obtain p c = 3 ( c +3ac 8a a 8 )( c ac +a + ) c 4 (a + c +) (a +)(c ). Further, p/ c =implies ac a c =with c = a + a 8a 8,c = a a 8a 8, a 8a 8
6 388 Gheorghe Tigan an 8a 3ac + a c +8=with c 3 = 3 4 a + 64a +7a +64,c 4 = a 64a +7a for any a +>. Case. If a 8a 8 > an a>then we have c 4 < <c <c 3 <c. Evaluating the sign of p/ c for c on (, + ) we get that c an c are the minimum points. Evaluating also p at c an c we get surprisingly, p(c )=p(c )=3, for any a>,a 8a 8 >. So u := c/ = 3 is the limit for a>,a 8a 8 >, with the property that trajectories can cross y= only for < u. Case. If a 8a 8 < then c, are not real anymore an c 4 < < c 3 for any a +>. So the minimum in this case is c = c 3 an one can show that the minimum of u = c/ is also 3. Case 3. If a + >,a < an a 8a +8 > then c, are real again but c, <. We keep still c 4 < <c 3 for any a +> an again c = c 3 is the minimum. With these constraints of a, u = c/ is ecreasing with respect to a, raging from + to 3. So these two last cases o not offer a better option for u. Remark.. The above Propositions.-. say that, the separatri W u + crosses the plane y =in a point K( u,,z u ) with < u < 3 if a is large enough (in fact for a 8a 8 > an a>). 3 Tracing the Stable W s Manifol As the positive part of the Oz ais, enote +, belongs to W s, we epress W s in a small neighborhoo of some parts of + in the form y = f(t), z = z e t,t >. Denote TW s A the tangent space to W s at the point A. In [7] we prove the following assertions. Proposition 3.. a) There eists a sequence z,z,...,z k,..., z k+ >z k,z > + a 4(a +)
7 such that the tangent space Fining Homoclinic an Heteroclinic Orbits 389 TW s Ak = {(, y, z) :y =}, where k =,,,...an A k =(,,z k ). b) For z<z we epress TW s A = {(, y, z) :y = f (t), z = z e t,t > }, where A =(,,z) an f (t) is a solution of the Riccati equation (generally unsolvable) f (t) =f (t) af(t) (a + )( z e t ), (3.) which is boune for t>,f () = an such that (a + ) (a +) 4(a +)z e t <f (t) <a+,t>t >, (3.) where t := ln 4(a +)z (a +) >. This result implies that in the neighborhoo of the integral line + : { = y =,z > }, the two-imensional manifol W s for z z can be epresse as So for <ε we can fin a curve {y = f (t), z = z e t,t }. C = W s { + y = ε, z z }. Proposition 3.. Consier the region in R 3,R = { (a +)<y<} where y = an y = (a+) are seen as surfaces in R 3. Then the curve C R for ε small enough. In aition, for ecreasing t, each trajectory starting on C up to its intersection with the plane y =, remains in the region R an will cross this plane only for z>. Proof. It is clear that the curve C lies in R because >,f (t) >,t > so y< an from f (t) <a+,t > we get y +(a +)>. Recall that TW s = {(, y, z) :y + (a +)=,z R}. We have also t (y +(a +)) y= (a+) = (a +)z for all z. Hence, the surface y +(a +) =is a surface without contact for trajectories of the system an the trajectories, for t ecreasing, cross the surface on the sie y +(a +)< for any z >. From t y y= =(a + )( z) < if >,z >, we have that, for t ecreasing, trajectories can cross y =on the sie y< only if >,z >. Consier in the following a surface in R 3 given by y = b c, b >,c>a+with z>. As b c < (a +) for small enough, this surface is below W s for small enough. Evaluate, t (y b + c) y=b c = ( z a ac + az + ab 3bc + c +b ) < (3.3)
8 39 Gheorghe Tigan as long as > an b + b(a 3c) + z a ac + az + c >. (3.4) Relation (3.4) hols true if an only if b ( 8a 8z +ac 8az + a + c +8 ) <, that is, if z > (8a +ac + a + c +8)/(8 + 8a). As the minimum of (8a +ac + a + c +8)/(8+8a) for c > a + > is attaine at c = a, if < a < / we can choose c = a > a + >. This leas to z >. So if < a < /, there eists c = a > a +such that t (y b + c) y=b c < for any >,z > an for any b >. Therefore, the surface in R 3,y= b + a, b >, <a< / with z>, z,> is a surface without contact for trajectories of the system an the trajectories for t ecreasing cross this surface for z>on the sie y<b + a. As the curve C contains points below z =, some trajectories starting on it may cross the surface y = b + a before meeting z =, so for such trajectories we have no bounary. But, take b = a >. The nonzero intersection of the curve y = a + a with the O ais is =. Make now the following assumption: Assumption A. Assume that a trajectory lying in z >, starting on C an remaining in z< before to cross the surface y = a + a (if enters z>, it can not cross the surface anymore), will cross first the surface z =. With this assumption at han, such a trajectory after crossing the surface z =,gives z(t) ecreasing an (t) increasing (ż>, ẋ<), that is, the trajectory remains in z< an it can not cross y =(see Prop. 3.) so it may escape on the surface z =. As the trajectories starting in y> a + a, > (in particular those starting on C) can not cross y = a + a for any >,z > they will cross y =in a point (,,z) such that <,z >. A trajectory, for t ecreasing, starting on C at a point such that z > increases in y(t) because ẏ <. Also it increases in (t) an in z(t) as ẋ<, ż<so it will cross surely the plane y =. It woul ecrease in z(t) after crossing the plane z = which is not possible because the surface z =, (, ) is below the surface z =, (, ). If / a, we can not fin anymore c an b such that t (y b + c) y=b c <, so we only can infer that the curve C lies in z>in this case. Summarizing, we have the following useful intuitive conjecture. We can not give it as a result since the trajectory may hit the surface y = a + a first an then z =. Conjecture. Consier <a. Then for t ecreasing an <a< /, the
9 Fining Homoclinic an Heteroclinic Orbits 39 trace of W s through the flow of the system on the plane y =is a curve lying completely in <, z> an for / a lying in z>. The evolution of the curve C through the flow of the system for a is summarize in the following result. Theorem 3.. If a> the trace of the curve C through the flow of the system on the plane y =, is a curve Γ joining A (,,z ) with a point B (,, ), lying on the curve z =, an a point B (,, ), > z lying on z =. Proof. As a>we have z >. For t ecreases, trajectories starting on C for z> an for S := (a+)( z) ay < will increase in all three irections as ẋ<, ẏ<, ż< an some of them will cross the plane y =an others coul meet the surface z =. Consiering z arbitrarily fie, the surface S is generate by the lines y = m with the slope m =(a + )( z)/a, see Fig. 3.. On the other han, if S>then they will ecrease in y(t), an if not meet S =they will cross the surface z =. So we obtaine a curve Γ joining the points A,B an O which belongs also to W s. The part of the curve Γ which oes not lie in y =an which is above the plane z =is further translate through the flow of the system in a curve Γ on the plane y =. Recall that from Proposition 3. trajectories can cross the plane y =only for z>. The curve Γ ens in y =,z = because at B (,, ) the trajectory is tangent to the plane y =as ẏ y=,z= =an after the tangency it returns to the region where y<if >or crosses the plane y = if <. If =it remains there as (,, ) is an equilibrium point. A similar argument is use in [] where also is prove that the point B is unique. 4 z y 4 Figure 3.: Crossing the surface S given by y =(a+)( z)/a, the flow of the system approaches or eparts the plane y =. Let us now escribe the scenario leaing to a homoclinic orbit consiering the above Conjecture is vali. Denotes in the following by D + the region on the plane y = efine by the curve Γ an the lines z =,z= z,=an by D the remaining region in the strip <z<z,>.
10 39 Gheorghe Tigan Define the function g(a) = min,z ( u, Γ ) i(c), where u is the O-coorinate of the point P ( u,,z u ) where W+ u crosses the plane y =, i(c) is + if the point P lies in D + an otherwise an (, y) is the Eucliian istance in the plane. From Conjecture an Theorem 3. we have that the function g(a) is continuous with respect to the parameter a for a +> an from Conjecture an from Proposition. we have in aition g(a) < for a (, /). For a>, a 8a 8 > an again from Theorem 3. we get that the intersection of the curve Γ with the region on y =, given by >z,z>is a curve entirely containe in > 3 because > z > + a 4(a+) while from Proposition. we have that P satisfies u < 3 so P D + an g(a) >. Therefore, there eists a number a ( /, 8.9) such that g(a )=. Summarizing, we have the range of the parameter a where the system can have a homoclinic loop. Conjecture. There eists a value a ( /, 8.9) of intersection of the curve Γ with W+ u such that, the system (.) corresponing to this value, has a homoclinic loop to the sale point O(,, ). Numerical investigations reveal inee a unique point a.78 such that the system possesses a homoclinic orbit. In Fig. 3. is presente a single homoclinic orbit lying in >,y >,z > while Fig. 3.3 isplays two symmetrical homoclinic orbits to O(,, ) corresponing to a. y.5 z.5 Figure 3.: One homoclinic orbit of the system for a. 3 y.5 z.5.5 Figure 3.3: Two homoclinic orbits of the system for a.
11 Fining Homoclinic an Heteroclinic Orbits z.5 z.5.5 Figure 3.4: Separatrices of the system for a =(left) an a =(right). z 6 z Figure 3.5: Orbits of the system for a =. (left) an a =.5 (right). 4 Conclusions Fining out close orbits in a multiimensional ynamical system is a challenging problem. Of this type of orbits, homoclinic an heteroclinic ones play an important role in unerstaning the behavior of the system. Uner some conitions, homoclinic or heteroclinic bifurcations lea to perioic orbits or chaos in a system. We pointe out here etails on a metho of etecting homoclinic orbits in a three-imensional ynamical system. The metho is applicable for higher-orer ynamical systems. Tracing the separatrices an their intersections with a given surface, we showe that there are conitions for them to meet one to another. Their intersections imply the eistence of a homoclinic orbit. While in this paper we registere some analytical results, others we ha to left as conjectures. Nevertheless, numerical results offer a goo basis for these conjectures. In [7] we starte to improve these results. References [] V. N. Belykh, Bifurcations of separatrices of a sale point of the Lorenz system, Differential Equations (984), [] A. Rucklige, Poster Nato Av. Res. Workshop in Brussels (99). [3] A. L. Shilnikov, Bifurcation an chaos in the Marioka-Shimizu system, Sel. Math. Sov. (99), 5 7. [4] A. L. Shilnikov, Methos of Qualitative Theory an Theory of Bifurcatios, Gorky St. Univ. (989), 3 38.
12 394 Gheorghe Tigan [5] A. L. Shilnikov, On bifurcations of the Lorenz attractor in the Shimizu-Morioka moel, Physica D 6 (993), [6] A. L. Shilnikov, L. P. Shilnikov, an D. V. Turaev, Normal forms an Lorenz attractors, IJBC 3 (993), [7] D. Turaev an G. Tigan, Analytical search for homoclinic bifurcations in a Shimizu- Morioka moel, in preparation. [8] A. Vlaimirov, G. Volkov, D. Yu, Technical Digest Series, Opt. Soc. of America (99), 98. Gheorghe Tigan is a Lecturer in the Department of Mathematics, Politehnica University of Timisoara, Romania. He obtaine his Ph.D. in 6 from the Department of Mathematics, West University of Timisoara, Romania. His scientific interest is in the Dynamical Systems Theory.
Linear First-Order PDEs
MODULE 2: FIRST-ORDER PARTIAL DIFFERENTIAL EQUATIONS 9 Lecture 2 Linear First-Orer PDEs The most general first-orer linear PDE has the form a(x, y)z x + b(x, y)z y + c(x, y)z = (x, y), (1) where a, b,
More information4.2 Implicit Differentiation
6 Chapter 4 More Derivatives 4. Implicit Differentiation What ou will learn about... Implicitl Define Functions Lenses, Tangents, an Normal Lines Derivatives of Higher Orer Rational Powers of Differentiable
More informationClassical Mechanics Examples (Lagrange Multipliers)
Classical Mechanics Examples (Lagrange Multipliers) Dipan Kumar Ghosh Physics Department, Inian Institute of Technology Bombay Powai, Mumbai 400076 September 3, 015 1 Introuction We have seen that the
More information(a) Find the equation of the plane that passes through the points P, Q, and R.
Math 040 Miterm Exam 1 Spring 014 S o l u t i o n s 1 For given points P (, 0, 1), Q(, 1, 0), R(3, 1, 0) an S(,, 0) (a) Fin the equation of the plane that passes through the points P, Q, an R P Q = 0,
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus
More informationDivide-and-Conquer Algorithms
Supplment to A Practical Guie to Data Structures an Algorithms Using Java Divie-an-Conquer Algorithms Sally A Golman an Kenneth J Golman Hanout Divie-an-conquer algorithms use the following three phases:
More information1 Surprises in high dimensions
1 Surprises in high imensions Our intuition about space is base on two an three imensions an can often be misleaing in high imensions. It is instructive to analyze the shape an properties of some basic
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationResearch Article Inviscid Uniform Shear Flow past a Smooth Concave Body
International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of
More informationQuasilinear First-Order PDEs
MODULE 2: FIRST-ORDER PARTIAL DIFFERENTIAL EQUATIONS 16 Lecture 3 Quasilinear First-Order PDEs A first order quasilinear PDE is of the form a(x, y, z) + b(x, y, z) x y = c(x, y, z). (1) Such equations
More informationProperties of the Derivative Lecture 9.
Properties of the Derivative Lecture 9. Recall that the average rate of change of a function y = f(x) over the interval from a to a + h, with h 0, is the slope of the line between y x f(a + h) f(a) =,
More informationCONSTRUCTION AND ANALYSIS OF INVERSIONS IN S 2 AND H 2. Arunima Ray. Final Paper, MATH 399. Spring 2008 ABSTRACT
CONSTUCTION AN ANALYSIS OF INVESIONS IN S AN H Arunima ay Final Paper, MATH 399 Spring 008 ASTACT The construction use to otain inversions in two-imensional Eucliean space was moifie an applie to otain
More information2-connected graphs with small 2-connected dominating sets
2-connecte graphs with small 2-connecte ominating sets Yair Caro, Raphael Yuster 1 Department of Mathematics, University of Haifa at Oranim, Tivon 36006, Israel Abstract Let G be a 2-connecte graph. A
More informationExercises of PIV. incomplete draft, version 0.0. October 2009
Exercises of PIV incomplete raft, version 0.0 October 2009 1 Images Images are signals efine in 2D or 3D omains. They can be vector value (e.g., color images), real (monocromatic images), complex or binary
More informationGraphing Functions. 0, < x < 0 1, 0 x < is defined everywhere on R but has a jump discontinuity at x = 0. h(x) =
Graphing Functions Section. of your tetbook is devoted to reviewing a series of steps that you can use to develop a reasonable graph of a function. Here is my version of a list of things to check. You
More informationDirectional Derivatives. Directional Derivatives. Directional Derivatives. Directional Derivatives. Directional Derivatives. Directional Derivatives
Recall that if z = f(x, y), then the partial derivatives f x and f y are defined as and represent the rates of change of z in the x- and y-directions, that is, in the directions of the unit vectors i and
More informationShift-map Image Registration
Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.
More informationAnalysis of half-space range search using the k-d search skip list. Here we analyse the expected time for half-space
Analysis of half-space range search using the k- search skip list Mario A. Lopez Brafor G. Nickerson y 1 Abstract We analyse the average cost of half-space range reporting for the k- search skip list.
More informationFigure 1: Schematic of an SEM [source: ]
EECI Course: -9 May 1 by R. Sanfelice Hybri Control Systems Eelco van Horssen E.P.v.Horssen@tue.nl Project: Scanning Electron Microscopy Introuction In Scanning Electron Microscopy (SEM) a (bunle) beam
More informationA Classification of 3R Orthogonal Manipulators by the Topology of their Workspace
A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.
More informationTracking and Regulation Control of a Mobile Robot System With Kinematic Disturbances: A Variable Structure-Like Approach
W. E. Dixon e-mail: wixon@ces.clemson.eu D. M. Dawson e-mail: awson@ces.clemson.eu E. Zergeroglu e-mail: ezerger@ces.clemson.eu Department of Electrical & Computer Engineering, Clemson University, Clemson,
More informationX y. f(x,y,d) f(x,y,d) Peak. Motion stereo space. parameter space. (x,y,d) Motion stereo space. Parameter space. Motion stereo space.
3D Shape Measurement of Unerwater Objects Using Motion Stereo Hieo SAITO Hirofumi KAWAMURA Masato NAKAJIMA Department of Electrical Engineering, Keio Universit 3-14-1Hioshi Kouhoku-ku Yokohama 223, Japan
More informationWorksheet A GRAPHS OF FUNCTIONS
C GRAPHS F FUNCTINS Worksheet A Sketch and label each pair of graphs on the same set of aes showing the coordinates of any points where the graphs intersect. Write down the equations of any asymptotes.
More informationBIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES
BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations
More informationImplicit and Explicit Functions
60_005.q //0 :5 PM Page SECTION.5 Implicit Differentiation Section.5 EXPLORATION Graphing an Implicit Equation How coul ou use a graphing utilit to sketch the graph of the equation? Here are two possible
More information2 Solution of Homework
Math 3181 Name: Dr. Franz Rothe February 6, 2014 All3181\3181_spr14h2.tex Homework has to be turned in this handout. The homework can be done in groups up to three due February 11/12 2 Solution of Homework
More informationarxiv: v1 [math.co] 15 Dec 2017
Rectilinear Crossings in Complete Balance -Partite -Uniform Hypergraphs Rahul Gangopahyay Saswata Shannigrahi arxiv:171.05539v1 [math.co] 15 Dec 017 December 18, 017 Abstract In this paper, we stuy the
More information6 Gradient Descent. 6.1 Functions
6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output
More informationFINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD
Warsaw University of Technology Faculty of Physics Physics Laboratory I P Joanna Konwerska-Hrabowska 6 FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD.
More informationDefinition 2 (Projective plane). A projective plane is a class of points, and a class of lines satisfying the axioms:
Math 3181 Name: Dr. Franz Rothe January 30, 2014 All3181\3181_spr14h2.tex Homework has to be turned in this handout. The homework can be done in groups up to three due February 11/12 2 Homework 1 Definition
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationDual Arm Robot Research Report
Dual Arm Robot Research Report Analytical Inverse Kinematics Solution for Moularize Dual-Arm Robot With offset at shouler an wrist Motivation an Abstract Generally, an inustrial manipulator such as PUMA
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationApproximation with Active B-spline Curves and Surfaces
Approximation with Active B-spline Curves an Surfaces Helmut Pottmann, Stefan Leopolseer, Michael Hofer Institute of Geometry Vienna University of Technology Wiener Hauptstr. 8 10, Vienna, Austria pottmann,leopolseer,hofer
More informationCluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters
Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets
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 informationSolutions to Tutorial 1 (Week 8)
The University of Syney School of Mathematics an Statistics Solutions to Tutorial 1 (Week 8) MATH2069/2969: Discrete Mathematics an Graph Theory Semester 1, 2018 1. In each part, etermine whether the two
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationOptimal path planning in a constant wind with a bounded turning rate
Optimal path planning in a constant win with a boune turning rate Timothy G. McGee, Stephen Spry an J. Karl Herick Center for Collaborative Control of Unmanne Vehicles, University of California, Berkeley,
More informationSolutions to the Test. Problem 1. 1) Who is the author of the first comprehensive text on geometry? When and where was it written?
Solutions to the Test Problem 1. 1) Who is the author of the first comprehensive text on geometry? When and where was it written? Answer: The first comprehensive text on geometry is called The Elements
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More informationAnimação e Visualização Tridimensional. Collision Detection Corpo docente de AVT / CG&M / DEI / IST / UTL
Animação e Visualização Triimensional Collision Detection Collision Hanling Collision Detection Collision Determination Collision Response Collision Hanling Collision Detection Collision Determination
More informationLearning convex bodies is hard
Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples
More informationMath 131. Implicit Differentiation Larson Section 2.5
Math 131. Implicit Differentiation Larson Section.5 So far we have ealt with ifferentiating explicitly efine functions, that is, we are given the expression efining the function, such as f(x) = 5 x. However,
More informationfiltering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember
107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays,
More informationThroughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem
Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple
More informationReview Exercise. 1. Determine vector and parametric equations of the plane that contains the
Review Exercise 1. Determine vector and parametric equations of the plane that contains the points A11, 2, 12, B12, 1, 12, and C13, 1, 42. 2. In question 1, there are a variety of different answers possible,
More informationTHE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE
БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:
More informationBends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways
Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis
More informationMulti-camera tracking algorithm study based on information fusion
International Conference on Avance Electronic Science an Technolog (AEST 016) Multi-camera tracking algorithm stu base on information fusion a Guoqiang Wang, Shangfu Li an Xue Wen School of Electronic
More information= w. w u. u ; u + w. x x. z z. y y. v + w. . Remark. The formula stated above is very important in the theory of. surface integral.
1 Chain rules 2 Directional derivative 3 Gradient Vector Field 4 Most Rapid Increase 5 Implicit Function Theorem, Implicit Differentiation 6 Lagrange Multiplier 7 Second Derivative Test Theorem Suppose
More informationPolitehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques
Politehnica University of Timisoara Mobile Computing, Sensors Network an Embee Systems Laboratory ing Techniques What is testing? ing is the process of emonstrating that errors are not present. The purpose
More information14.6 Directional Derivatives and the Gradient Vector
14 Partial Derivatives 14.6 and the Gradient Vector Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. and the Gradient Vector In this section we introduce
More informationPDE-BASED INTERPOLATION METHOD FOR OPTICALLY VISUALIZED SOUND FIELD. Kohei Yatabe and Yasuhiro Oikawa
4 IEEE International Conference on Acoustic, Speech an Signal Processing (ICASSP) PDE-BASED INTERPOLATION METHOD FOR OPTICALLY VISUALIZED SOUND FIELD Kohei Yatabe an Yasuhiro Oikawa Department of Intermeia
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationEFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER
FFICINT ON-LIN TSTING MTHOD FOR A FLOATING-POINT ADDR A. Droz, M. Lobachev Department of Computer Systems, Oessa State Polytechnic University, Oessa, Ukraine Droz@ukr.net, Lobachev@ukr.net Abstract In
More informationLet and be a differentiable function. Let Then be the level surface given by
Module 12 : Total differential, Tangent planes and normals Lecture 35 : Tangent plane and normal [Section 35.1] > Objectives In this section you will learn the following : The notion tangent plane to a
More informationSURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway
More informationRobust Camera Calibration for an Autonomous Underwater Vehicle
obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of
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 informationPolygon Simplification by Minimizing Convex Corners
Polygon Simplification by Minimizing Convex Corners Yeganeh Bahoo 1, Stephane Durocher 1, J. Mark Keil 2, Saee Mehrabi 3, Sahar Mehrpour 1, an Debajyoti Monal 1 1 Department of Computer Science, University
More information11. Differentiating inverse functions.
. Differentiating inverse functions. The General Case: Fin y x when y f x. Since f y x an we regar y as being a function of x, we ifferentiate both sies of the equation f y x with respect to x using the
More informationON THE NUMBER OF CONNECTED COMPONENTS IN THE SPACE OF CLOSED NONDEGENERATE CURVES ON S"
BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 25, Number 1, July 1991 ON THE NUMBER OF CONNECTED COMPONENTS IN THE SPACE OF CLOSED NONDEGENERATE CURVES ON S" B. Z. SHAPIRO AND M. Z.
More informationTry It. Implicit and Explicit Functions. Video. Exploration A. Differentiating with Respect to x
SECTION 5 Implicit Differentiation Section 5 Implicit Differentiation Distinguish between functions written in implicit form an eplicit form Use implicit ifferentiation to fin the erivative of a function
More informationTANGENTS AND NORMALS
Mathematics Revision Guides Tangents and Normals Page 1 of 8 MK HOME TUITION Mathematics Revision Guides Level: AS / A Level AQA : C1 Edecel: C OCR: C1 OCR MEI: C TANGENTS AND NORMALS Version : 1 Date:
More informationarxiv: v2 [math.co] 5 Jun 2018
Some useful lemmas on the ege Szege inex arxiv:1805.06578v [math.co] 5 Jun 018 Shengjie He 1 1. Department of Mathematics, Beijing Jiaotong University, Beijing, 100044, China Abstract The ege Szege inex
More informationEXTREME POINTS AND AFFINE EQUIVALENCE
EXTREME POINTS AND AFFINE EQUIVALENCE The purpose of this note is to use the notions of extreme points and affine transformations which are studied in the file affine-convex.pdf to prove that certain standard
More informationMath 348 Differential Geometry of Curves and Surfaces
Math 348 Differential Geometry of Curves and Surfaces Lecture 3 Curves in Calculus Xinwei Yu Sept. 12, 2017 CAB 527, xinwei2@ualberta.ca Department of Mathematical & Statistical Sciences University of
More informationKevin James. MTHSC 206 Section 15.6 Directional Derivatives and the Gra
MTHSC 206 Section 15.6 Directional Derivatives and the Gradient Vector Definition We define the directional derivative of the function f (x, y) at the point (x 0, y 0 ) in the direction of the unit vector
More information2.7 Implicit Differentiation
2.7 Implicit Differentiation [ y] = = = [ x] 1 Sometimes we may be intereste in fining the erivative of an equation that is not solve or able to be solve for a particular epenent variable explicitly. In
More informationShift-map Image Registration
Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy
More information5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)
5th International Conference on Avance Design an Manufacturing Engineering (ICADME 25) Research on motion characteristics an application of multi egree of freeom mechanism base on R-W metho Xiao-guang
More informationStructured System Theory
Appendix C Structured System Theory Linear systems are often studied from an algebraic perspective, based on the rank of certain matrices. While such tests are easy to derive from the mathematical model,
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationdt Acceleration is the derivative of velocity with respect to time. If a body's position at time t is S = f(t), the body's acceleration at time t is
APPLICATIN F DERIVATIVE INTRDUCTIN In this section we eamine some applications in which derivatives are used to represent and interpret the rates at which things change in the world around us. Let S be
More informationIntroduction to Complex Analysis
Introduction to Complex Analysis George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 413 George Voutsadakis (LSSU) Complex Analysis October 2014 1 / 50 Outline
More informationRegularized Laplacian Zero Crossings as Optimal Edge Integrators
Regularize aplacian Zero rossings as Optimal Ege Integrators R. KIMME A.M. BRUKSTEIN Department of omputer Science Technion Israel Institute of Technology Technion ity, Haifa 32, Israel Abstract We view
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationCS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing
CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing Tim Roughgaren October 19, 2016 1 Routing in the Internet Last lecture we talke about elay-base (or selfish ) routing, which
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationAlgebraic transformations of Gauss hypergeometric functions
Algebraic transformations of Gauss hypergeometric functions Raimunas Viūnas Faculty of Mathematics, Kobe University Abstract This article gives a classification scheme of algebraic transformations of Gauss
More informationB-Splines and NURBS Week 5, Lecture 9
CS 430/585 Computer Graphics I B-Splines an NURBS Week 5, Lecture 9 Davi Breen, William Regli an Maxim Peysakhov Geometric an Intelligent Computing Laboratory Department of Computer Science Drexel University
More informationProblem 3.1 (Building up geometry). For an axiomatically built-up geometry, six groups of axioms needed:
Math 3181 Dr. Franz Rothe September 29, 2016 All3181\3181_fall16h3.tex Names: Homework has to be turned in this handout. For extra space, use the back pages, or put blank pages between. The homework can
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationP. Fua and Y. G. Leclerc. SRI International. 333 Ravenswood Avenue, Menlo Park, CA
Moel Driven Ege Detection P. Fua an Y. G. Leclerc SI International 333 avenswoo Avenue, Menlo Park, CA 9425 (fua@ai.sri.com leclerc@ai.sri.com) Machine Vision an Applications, 3, 199 Abstract Stanar ege
More informationSection A1: Gradients of straight lines
Time To study this unit will take you about 10 hours. Trying out and evaluating the activities with your pupils in the class will be spread over the weeks you have planned to cover the topic. 31 Section
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
More informationAdvanced method of NC programming for 5-axis machining
Available online at www.scienceirect.com Proceia CIRP (0 ) 0 07 5 th CIRP Conference on High Performance Cutting 0 Avance metho of NC programming for 5-axis machining Sergej N. Grigoriev a, A.A. Kutin
More information. 1. Chain rules. Directional derivative. Gradient Vector Field. Most Rapid Increase. Implicit Function Theorem, Implicit Differentiation
1 Chain rules 2 Directional derivative 3 Gradient Vector Field 4 Most Rapid Increase 5 Implicit Function Theorem, Implicit Differentiation 6 Lagrange Multiplier 7 Second Derivative Test Theorem Suppose
More informationLecture 1 September 4, 2013
CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the
More informationTABLE OF CONTENTS CHAPTER 1 LIMIT AND CONTINUITY... 26
TABLE OF CONTENTS CHAPTER LIMIT AND CONTINUITY... LECTURE 0- BASIC ALGEBRAIC EXPRESSIONS AND SOLVING EQUATIONS... LECTURE 0- INTRODUCTION TO FUNCTIONS... 9 LECTURE 0- EXPONENTIAL AND LOGARITHMIC FUNCTIONS...
More informationMath (Spring 2009): Lecture 5 Planes. Parametric equations of curves and lines
Math 18.02 (Spring 2009): Lecture 5 Planes. Parametric equations of curves and lines February 12 Reading Material: From Simmons: 17.1 and 17.2. Last time: Square Systems. Word problem. How many solutions?
More informationAnalytical Solid Geometry
Analytical Solid Geometry Distance formula(without proof) Division Formula Direction cosines Direction ratios Planes Straight lines Books Higher Engineering Mathematics by B S Grewal Higher Engineering
More informationOptimization of cable-stayed bridges with box-girder decks
Avances in Engineering Software 31 (2000) 417 423 www.elsevier.com/locate/avengsoft Optimization of cable-staye briges with box-girer ecks L.M.C. Simões*, J.H.J.O. Negrão Department of Civil Engineering,
More informationImage compression predicated on recurrent iterated function systems
2n International Conference on Mathematics & Statistics 16-19 June, 2008, Athens, Greece Image compression preicate on recurrent iterate function systems Chol-Hui Yun *, Metzler W. a an Barski M. a * Faculty
More informationDesign of Policy-Aware Differentially Private Algorithms
Design of Policy-Aware Differentially Private Algorithms Samuel Haney Due University Durham, NC, USA shaney@cs.ue.eu Ashwin Machanavajjhala Due University Durham, NC, USA ashwin@cs.ue.eu Bolin Ding Microsoft
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mit.eu 6.854J / 18.415J Avance Algorithms Fall 2008 For inormation about citing these materials or our Terms o Use, visit: http://ocw.mit.eu/terms. 18.415/6.854 Avance Algorithms
More informationGeneral properties of staircase and convex dual feasible functions
General properties of staircase and convex dual feasible functions JÜRGEN RIETZ, CLÁUDIO ALVES, J. M. VALÉRIO de CARVALHO Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia
More informationGergonne and Nagel Points for Simplices in the n-dimensional Space
Journal for Geometry and Graphics Volume 4 (2000), No. 2, 119 127. Gergonne and Nagel Points for Simplices in the n-dimensional Space Edwin Koźniewsi 1, Renata A. Górsa 2 1 Institute of Civil Engineering,
More information