On the second part of Hilbert s 16th problem

Similar documents
MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

4.3 Lagrange Approximation

15 Limit sets. Lyapunov functions

by the matrix A results in a vector which is a reflection of the given

1 if 1 x 0 1 if 0 x 1

MA4001 Engineering Mathematics 1 Lecture 10 Limits and Continuity

Linearly Independent Sets and Linearly Dependent Sets

ON SUPERCYCLICITY CRITERIA. Nuha H. Hamada Business Administration College Al Ain University of Science and Technology 5-th st, Abu Dhabi, , UAE

Similarity and Diagonalization. Similar Matrices

Lecture 14: Section 3.3

Zeros of Polynomial Functions

36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?

Continuity of the Perron Root

MATHEMATICS BONUS FILES for faculty and students

A note on Dulac functions for a sum of vector fields

160 CHAPTER 4. VECTOR SPACES

A simple criterion on degree sequences of graphs


1.2 Solving a System of Linear Equations

88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a

minimal polyonomial Example

Math Common Core Sampler Test

y cos 3 x dx y cos 2 x cos x dx y 1 sin 2 x cos x dx

RINGS WITH A POLYNOMIAL IDENTITY

Introduction to Finite Fields (cont.)

Inner Product Spaces

These axioms must hold for all vectors ū, v, and w in V and all scalars c and d.

α = u v. In other words, Orthogonal Projection

Introduction to Logistic Regression

Availability of a system with gamma life and exponential repair time under a perfect repair policy

Trigonometric Functions and Equations

Some strong sufficient conditions for cyclic homogeneous polynomial inequalities of degree four in nonnegative variables

Continued Fractions and the Euclidean Algorithm


Prime Numbers and Irreducible Polynomials

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

1 Example of Time Series Analysis by SSA 1

SIGNAL PROCESSING & SIMULATION NEWSLETTER

How To Understand The Theory Of Algebraic Functions

ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath

The Mean Value Theorem

Rolle s Theorem. q( x) = 1

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Second Order Linear Nonhomogeneous Differential Equations; Method of Undetermined Coefficients. y + p(t) y + q(t) y = g(t), g(t) 0.

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

A note on companion matrices

On the representability of the bi-uniform matroid

On using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems

Real Roots of Univariate Polynomials with Real Coefficients

CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian. Pasquale Candito and Giuseppina D Aguí

How To Solve A Linear Dierential Equation

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

FACTORING SPARSE POLYNOMIALS

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = i.

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

SECRET sharing schemes were introduced by Blakley [5]

Representation of functions as power series

International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013

5.3 The Cross Product in R 3

Application. Outline. 3-1 Polynomial Functions 3-2 Finding Rational Zeros of. Polynomial. 3-3 Approximating Real Zeros of.

FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS. Mateusz Nikodem

Portfolio selection based on upper and lower exponential possibility distributions

The four [10,5,4] binary codes

MCS 563 Spring 2014 Analytic Symbolic Computation Wednesday 9 April. Hilbert Polynomials

On closed-form solutions of a resource allocation problem in parallel funding of R&D projects

Arithmetic and Algebra of Matrices

Homework until Test #2

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

Mathematics. ( : Focus on free Education) (Chapter 5) (Complex Numbers and Quadratic Equations) (Class XI)

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients

Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization

MATH 590: Meshfree Methods

Vector and Matrix Norms

Methods for Finding Bases

The continuous and discrete Fourier transforms

Zero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.

Oscillations. Vern Lindberg. June 10, 2010

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

Background Knowledge

11 Multivariate Polynomials

Zeros of a Polynomial Function

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

Many algorithms, particularly divide and conquer algorithms, have time complexities which are naturally

Factoring Cubic Polynomials

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

Limits and Continuity

Duality of linear conic problems

Lecture 1: Systems of Linear Equations

The Open University s repository of research publications and other research outputs

WHEN DOES A CROSS PRODUCT ON R n EXIST?

mod 10 = mod 10 = 49 mod 10 = 9.

Alex, I will take congruent numbers for one million dollars please

An example of a computable

4 Lyapunov Stability Theory

Transcription:

Nonlinear Analysis ( ) www.elsevier.com/locate/na On the second part of Hilbert s 6th problem Elin Oxenhielm Department of Mathematics, Stockholm University, Stockholm 69, Sweden Received 3 July 23; accepted 3 October 23 Abstract Let k be an integer such that k is larger than or equal to zero, and let H be the Hilbert number. In this paper, we use the method of describing functions to prove that in the Lienard equation, the upper bound for H(2k ) is k. By applying this method to any planar polynomial vector eld, it is possible to completely solve the second part of Hilbert s 6th problem.? 23 Elsevier Ltd. All rights reserved. Keywords: Second part of Hilbert s 6th problem; Hilbert number; Lienard equation; Describing function; Limit cycle; Polynomial vector eld. Introduction In 9, Hilbert presented a list consisting of 23 mathematical problems (see []). The second part of the 6th problem appears to be one of the most persistent in that list, second only to the 8th problem, the Riemann conjecture. The second part of the 6th problem is traditionally split into three parts (see [2]). Problem. A limit cycle is an isolated closed orbit. Is it true that a planar polynomial vector eld has but a nite number of limit cycles? Problem 2. Is it true that the number of limit cycles of a planar polynomial vector eld is bounded by a constant depending on the degree of the polynomials only? Denote the degree of the planar polynomial vector eld by n. The bound on the number of limit cycles in Problem 2 is denoted by H(n), and is known as the Hilbert number. Linear vector elds have no limit cycles, hence H()=. Tel.: 46-736-89-77-72; fax: 46-62-67-7. E-mail address: elin@math.su.se (E. Oxenhielm). URL: http://www.math.su.se 362-546X/$ - see front matter? 23 Elsevier Ltd. All rights reserved. doi:.6/j.na.23..2

2 E. Oxenhielm / Nonlinear Analysis ( ) Problem 3. Give an upper bound for H(n). Let k be an integer such that k. In 977, Lins et al. [3] found examples with k dierent limit cycles in the Lienard equation ẋ = y F(x); where ẏ = x; F(x)=q 2k x 2k q 2k x 2k q 2 x 2 q x: () The degree of this polynomial vector eld is denoted by 2k. The coecients q i (for integers i such that 6 i 6 2k) are real constants. Lins et al. [3] conjectured the number k as the upper bound for the number of limit cycles of the Lienard equation (). Their conjecture thus states that in the Lienard equation (), the upper bound for H(2k ) is k. In his list of mathematical problems for the next century, published in 998, Smale [4] mentioned the Lienard equation () as a simplied version of the second part of Hilbert s 6th problem (see [4]). In the present paper, we will prove the conjecture stated by Lins et al. [3] in 977, thereby solving the simplied version of the second part of Hilbert s 6th problem stated by Smale [4] in 998. 2. Preliminaries In this section, we will introduce the method of describing functions, which may be used to calculate limit cycles in nonlinear dynamic systems (see [4]). Consider a dynamic system ẋ = Mx h(x); where x is the m-dimensional vector of state variables, M is an m m constant matrix and h(x) is an m-dimensional vector of nonlinear functions. Assume that the state variables are dominated by a harmonic term of a specic order x = a a sin(!t); where a is the m-dimensional vector of center values, a is the m-dimensional vector of amplitudes and! is the frequency. a ; a and! are assumed to be real. a and! are nonzero. Then, approximate the vector of nonlinear functions by discarding higher harmonic terms (terms of the form cos(r!t) and sin(r!t) for integers r such that r 2) h(x) = Na sin(!t); where is an m-dimensional constant vector and N is an m m constant matrix. The components of N are called describing functions.

E. Oxenhielm / Nonlinear Analysis ( ) 3 The system becomes ẋ = Ma (M N)a sin(!t) and solutions for a ; a and! satisfy Ma =; (2) det(j!i M N)=; (3) where I is the m m identity matrix and j satises the equation j 2 =. 3. Result In this section, we will prove the conjecture stated by Lins et al. [3] in 977, by applying the method of describing functions to the Lienard equation (). Theorem. Let k be an integer such that k, and let H be the Hilbert number. For the Lienard equation (), we have that the upper bound for H(2k ) is k. Proof. Noticing that the state variable x of the Lienard equation () behaves approximately like a sine function in simulations (see Fig. ), we assume in order to make a good approximation of x that both state variables are dominated by a harmonic term of a specic order [ ] [ ] [ ] x a a = sin(!t) (4) y b b which gives that the Lienard equation () becomes [ ] [ ] [ ][ ] [ ][ ] ẋ f(t) q a q a = = sin(!t) ẏ g(t) b b [ ] q2k [a a sin(!t)] 2k q 2k [a a sin(!t)] 2k q 2 [a a sin(!t)] 2 : Since the nonlinear function only aects f(t), Eq. (2) gives that the constant part of g(t) may be set equal to zero at this stage, so that a =. The nonlinear function in f(t) becomes q 2k x 2k q 2k x 2k q 3 x 3 q 2 x 2 = q 2k a 2k sin 2k (!t) q 2k a 2k sin 2k (!t) q 3 a 3 sin 3 (!t) q 2 a 2 sin 2 (!t)

4 E. Oxenhielm / Nonlinear Analysis ( ) X vs T X vs T.5.5.5.5 5 Y vs T 5 2 5 Y vs T 5 2.5.5.5.5 5 Y vs X 5 2 5 Y vs X 5 2.5.5.5.5.5.5.5.5 Fig.. Numerical integration of the Lienard equation () when F(x)=x 3 x. In the left gures, the initial conditions are x() = and y() =. In the right gures, the initial conditions are x() = and y() =. = q 2ka 2k [ cos(2!t)]k 2 k q 2k 2a 2k 2 [ cos(2!t)] k 2 k q 2a 2 [ cos(2!t)] 2 [ q 2ka 2k [ cos(2!t)] k 2 k q 2k a 2k [ cos(2!t)] k 2 k q 3a 3 ] [ cos(2!t)] sin(!t) 2

E. Oxenhielm / Nonlinear Analysis ( ) 5 = q2k k a 2k q 2k 2 k a 2k 2 q 2 a 2 [ q 2k k a 2k q 2k k a 2k q 3 a 3 ] sin(!t) such that each l always is larger than or equal to =2 l, for integers l such that 6 l 6 k. The Lienard equation () becomes [ ] [ ][ ] [ ] ẋ q a q2k k a 2k q 2k 2 k a 2k 2 q 2 a 2 = ẏ b ([ ] [ ]) [ ] q q2k k a 2k q 3 a 2 a sin(!t): b Letting the constant part of f(t) equal to zero according to Eq. (2) gives that b = q 2k k a 2k q 2k 2 k a 2k 2 q 2 a 2 (5) so that the coecients in front of the even powers of the polynomial F(x) only have an impact on the center value b (see also Example ). Eq. (3) gives that the solutions for a and! satisfy! = ± (6) so that the dominant harmonic order is the rst one, and q 2k k a 2k q 3 a 2 q = (7) which has at most k distinct zeros in terms of a 2. For each such zero a2, we have that ± a are solutions. The approximation of the state variables as in Eq. (4) ts the solution in terms of x. To solve for y, we notice that ẏ = x from the Lienard equation (), which gives that y = b a cos(!t) (8)! since x is as in Equation (4) and! is nonzero. Notice that b still satises Eq. (5), since we would get that same equation if we assumed that the state variables were cosine functions instead of sine functions in Eq. (4). Thus, the following are the possible cases for the state variables. A. If a and! are of the same sign, x = a sin t; y = b a cos t: B. If a and! are of dierent signs x = a sin t; y = b a cos t:

6 E. Oxenhielm / Nonlinear Analysis ( ) Fig. 2. Numerical integration of the Lienard equation () when F(x)=x 3 :5x 2 x and the initial condition y() is positive. For each distinct zero a 2 of Eq. (7), these two cases correspond to the same limit cycle. Simulations show that the sign of the initial condition y() determines whether the trajectory follows the solution of case A or case B (see Fig. ). We thus have that for each unique x that may be approximated as in Eq. (4), there exists a unique y as in Eq. (8). Therefore, we have that there exist at most k distinct limit cycles in the Lienard equation (). In Eq. (4), we assumed that the state variables were dominated by a harmonic term of a specic order. If this assumption is not true, it is possible to increase the accuracy of the approximation of the state variables by adding higher harmonic terms to Eq. (4). By doing this, and by going through the calculations one more time, we would if the state variables were not dominated by a harmonic term of a specic order end up with other amplitudes than in the rst calculation. It is of great importance for the result to understand that this change in amplitudes does not mean that there exist additional limit cycles in the Lienard equation () it only means that the new approximation of the state variables has a higher accuracy (see also [5]). Thereby, we have proved that the maximum number k of limit cycles that exist in the Lienard equation (), depends on the degree 2k of the polynomial F(x) only. Hence, we have proved that the upper bound for H(2k ) is k. Note that the method of describing functions may be used in a similar manner as in the proof above, to nd the upper bounds for the Hilbert number in any planar polynomial vector eld. Thus, it is possible to completely solve the second part of Hilbert s 6th problem by using this approach.

E. Oxenhielm / Nonlinear Analysis ( ) 7 Fig. 3. Numerical integration of the Lienard equation () when F(x)=:25x 5 2x 3 :25x and the initial condition y() is positive. The initial conditions lie just outside the small cycle, and the trajectory is attracted to it at rst. Then, at t = 55, it becomes attracted to the large cycle. Example. Let F(x)=x 3 :5x 2 x (Fig. 2). Eqs. (5) (8) give that x = ±:4 sin t; y = :5 ± :4 cos t: Example 2. Let F(x)=:25x 5 2x 3 :25x (Fig. 3). Eqs. (5) (8) give that { ± 3:23 sin t; x = ± :5 sin t; { ± 3:23 cos t; y = ± :5 cos t: Acknowledgements It is my pleasure to thank Y. Zhou, who read the rst version of the paper and made many fruitful comments. I am also grateful to M. Gripenhufvud for encouragement and many good advices.

8 E. Oxenhielm / Nonlinear Analysis ( ) References [] D. Hilbert, Mathematical problems, Reprinted from Bull. Amer. Math. Soc. 8 (92) 437 479 in Bull. Amer. Math. Soc. 37 (2) 47 436. [2] YU. Ilyashenko, Centennial history of Hilbert s 6th problem, Bull. Amer. Math. Soc. 39 (3) (22) 3 354. [3] A. Lins, W. de Melo, C.C. Pugh, On Lienard s Equation, Lecture Notes in Mathematics, Vol. 597, Springer, Berlin, 977, pp. 335 357. [4] S. Smale, Mathematical problems for the next century, Math. Intelligencer 2 (2) (998) 7 5. [5] P.J. Holmes, New approaches to nonlinear problems in dynamics, SIAM (98) 52 529.