^{1}

^{*}

^{1}

^{*}

In this work we study two types of Discrete Hill’s equation. The first comes from the discretization process of a Continuous-time Hill’s equation, we called Discretized Hill’s equation. The Second is a naturally obtained in Discrete-Time and will be called Discrete-time Hill’s equation. The objective of discretization is preserving the continuous-time behavior and we show this property. On the contrary a completely different dynamic property was found for the Discrete-Time Hill’s equation. At the end of the paper is shown that both types share the nonoscillatory behavior of solutions in the 0-th Arnold Tongue.

Hill equation z ¨ + ( α + β p ( t ) ) z ( t ) = 0 where p ( t + T ) = p ( t ) was introduced in 1877 by George W. Hill on his work on the part of the motion of the lunar perigee [

In 1912 Hamel found that as far as β is sufficiently small there is an α 0 such that for α ≤ α 0 all the solutions of the Hill equation are nonoscillatory and oscillatory if α > α 0 [

In late 1940s until 1960s, two Russian scientists Krein and Yakubovich, established the foundation of linear Hamiltonian with periodic coefficients [

Through the Arnold tongues, we compare both types of equations: Discretized and Discrete Hill’s equations. We will plot for the first time the Arnold tongues for the Discrete Hill’s equation and give a formula of where the Arnold tongues touches the β = 0 axis. We will also proof the discrete version of the nonoscillatory criteria for discrete Hill’s equation.

This paper is organized as follows: the first section is an introduction and historical overview, in Section 2 we give the preliminary necessary for this work as well as the characterization of the continuous time Hill’s equation, Section 3 is focused on the Discretization of linear Hamiltonian systems and the methods that preserve such structure, in Section 4 we discretize the Continuous time Hill’s equation and analyze its stability conditions, in Section 5 we present the discrete Hill’s equation and develop its properties, finally in Section 6 we present some conclusions.

In this section we will give a brief introduction to Floquet theory [

Consider the following system

z ¨ ( t ) + ( α + β p ( t ) ) z ( t ) = 0 (1)

known as the Hill’s equation, where α , β are real parameters, p ( t ) = p ( t + T ) is a periodic function with period T. The parameter α represents the square of the natural frequency for β = 0 ; the parameter β is the amplitude of the parametric excitation, and the periodic function p ( t ) is called the excitation function.

If we define the two-dimensional vector y = [ z z ˙ ] , the Equation (1) can be rewritten as

y ˙ ( t ) = A ( t ) y ( t ) (2)

where A ( t ) = [ 0 1 − ( α + β p ( t ) ) 0 ] , A ( t + T ) = A ( t ) .

The solution of any linear system y ¯ ( t ) = A ¯ ( t ) y ¯ ( t ) can be given in terms of its state transition matrix as y ¯ ( t ) = Φ ( t , t 0 ) y ¯ ( t 0 ) . For linear systems with periodic coefficients as (2), Floquet asserts that the state transition matrix^{1} may be factorized as:

Theorem 1. Floquet [

Φ ( t , t 0 ) = Q − 1 ( t ) e B ( t − t 0 ) Q ( t 0 ) (3)

where B is a constant matrix, not necessarily real^{2}.

If we make t 0 = 0 in (3), we get the most well-known version:

Corollary 1. Floquet theorem Consider a linear periodic system y ˙ ( t ) = A ( t ) y ( t ) as in (2), exists an invertible matrix Q ( t ) = Q ( t + T ) of the same period as the system (2) with initial value Q ( 0 ) = I such that its state transition matrix satisfies:

Φ ( t , 0 ) = Q − 1 ( t ) e B t (4)

B is a constant matrix, again not necessarily real.

Now if we evaluate (4) at t = T , we get the following definition.

Definition 1. The matrix

M = Φ ( T , 0 ) = e B T (5)

is a matrix particularly important and is known as the Monodromy Matrix.

Remark 1. The Monodromy matrix defined by (5) is dependent of the initial time t 0 ; but not its spectrum. Let us designate M t 0 = Φ ( T + t 0 , t 0 ) then using (3) for t = T + t 0 ,

Φ ( T + t 0 , t 0 ) = Q − 1 ( T + t 0 ) e B T Q ( t 0 ) = Q − 1 ( t 0 ) e B T Q ( t 0 ) = Q − 1 ( t 0 ) M Q ( t 0 )

This shows that M t 0 and M are similar. Therefore as long as our use of the Monodromy matrix is reduced to its spectrum, we can use either M or M t 0 .

StabilityRecall the stability definition in the sense of Lyapunov [

Definition 2. The zero solution of y ˙ = A ( t ) y is

1) Stable, if ∀ ϵ > 0 , ∃ δ > 0 such that ‖ y ( t 0 ) ‖ < δ ⇒ ‖ y ( t 0 ) ‖ < ϵ , ∀ t ≥ t 0

2) Unstable if it is not stable.

^{1}To review the properties of the state transition matrix you can see [

^{2}See Adrianova pp.17 [^{2} always has a real logarithm.

3) Asymptotically stable if the zero solution is stable and lim t → ∞ y ( t ) = 0 .

In our system (2) y ˙ = A ( t ) y , for t ≥ 0 , t may be expressed as: t = k T + τ , where k is a non-negative integer and τ ∈ [ 0, T ) ; then the solution satisfies (2) for t 0 = 0 and y ( 0 ) = y 0 :

y ( t ) = Φ ( k T + τ , 0 ) y 0 = Φ ( τ , 0 ) M k y 0

from which, we can conclude that, system (2) is:

1) Stable: y ( t ) remains bounded ∀ t ≥ 0 if and only if σ ( M ) ⊂ D ¯ 1 ≜ { z ∈ ℂ : | z | ≤ 1 } and if λ ∈ σ ( M ) and | λ | = 1 , λ is a simple root of the minimal polynomial of M .

2) Unstable if ∃ μ ∈ σ ( M ) : | μ | > 1 or if σ ( M ) ⊂ D ¯ 1 , ∃ μ : | μ | = 1 , μ is not a simple root of the minimal polynomial of M .

Hamiltonian systems consist in a pair of 2 n ordinary differential equations of the form:

q ˙ = ( ∂ H ( t , q , p ) ∂ p ) T p ˙ = − ( ∂ H ( t , q , p ) ∂ q ) T (6)

where H ( t , q , p ) is called a Hamiltonian function which represents the energy of the system, when the Hamiltonian function is being preserved constant along the solutions of (6) then the Hamiltonian system (6) is called a Conservative system, and this happens if H ( t , q , p ) is independent of time t.

In this work we will deal only with linear Hamiltonian systems, so the Hamiltonian function can be rewritten as a quadratic homogeneous form, i.e.

H ( t , q , p ) = [ q p ] T H ( t ) [ q p ] (7)

where H ( t ) is a 2 n × 2 n symmetric matrix, in this case the Hamiltonian System (7) may be expressed as:

d d t [ q p ] = J H ( t ) [ q p ] (8)

where J = [ 0 I n − I n 0 ] .

Notice that J is orthogonal and skew-symmetric; i.e., J − 1 = J T = − J and that J 2 = − I 2 n .

Definition 3. Hamiltonian matrix [

An even-order matrix A ∈ ℝ 2 n × 2 n is called Hamiltonian Matrix, if

A T J + J A = 0 (9)

From A T J + J A = 0 , we get A = J − 1 ( − A T ) J , i.e., A is similar to − A T therefore they have the same spectrum:

σ ( A ) = σ ( − A T ) = σ ( − A )

In other words, if λ ∈ σ ( A ) , then − λ ∈ σ ( A ) .

Theorem 2. Let A ∈ ℝ 2 n × 2 n be a Hamiltonian matrix, then if λ ∈ σ ( A ) ⇒ − λ ∈ σ ( A ) . Equivalently, the characteristic polynomial of a Hamiltonian matrix has only even powers or it is an even polynomial.

Definition 4. Symplectic Matrix [

An even order real matrix S ∈ ℝ 2 n × 2 n is called a Symplectic Matrix, if

S T J S = J (10)

The key property of constant symplectic matrices is that its spectrum is symmetric with respect to the unit circle, this can be proven from the definition and the fact that a symplectic matrix is always invertible, then S T = J S − 1 J − 1 , i.e. σ ( S T ) = σ ( S − 1 ) = σ ( S ) ⇒ if λ ∈ σ ( S ) then λ − 1 ∈ σ ( S ) .

Theorem 3. Let S ∈ ℝ 2 n × 2 n be a symplectic matrix, then if λ ∈ σ ( A ) ⇒ λ − 1 ∈ σ ( S ) . Equivalently, the characteristic polynomial of a Symplectic matrix is self-reciprocal, i.e. p S ( λ ) = λ 2 n p S ( λ − 1 )

The

Definition 5. A continuous Linear time invariant system x ˙ ( t ) = A x ( t ) is said to be a Hamiltonian system if and only if A is a Hamiltonian matrix [

Definition 6. Similarly x k + 1 = B x k is a discrete Hamiltonian system if and only if B is a Symplectic matrix [

Theorem 4. [

Here we will see that the Hill’s equation is a Hamiltonian system, we will talk about the discriminant of the Monodromy matrix ϕ ( α , β ) and its relation to the roots of the Monodromy matrix, we will enunciate the Hochstadt theorem, that gives intervals of stability and unstability, this can be easily seen on the Arnold tongues. We give a formula of where the Arnold tongues begin.

Lemma 5. The Hill’s equation

y ˙ ( t ) = A ( t ) y ( t )

where A ( t ) = [ 0 1 − ( α + β p ( t ) ) 0 ] , A ( t + T ) = A ( t ) is a Hamiltonian system.

Proof. according with the definition 5 we only need to prove that the matrix A ( t ) is a Hamiltonian matrix

A T ( t ) J = [ 0 1 − ( α + β p ( t ) ) 0 ] T [ 0 1 − 1 0 ] = [ ( α + β p ( t ) ) 0 0 − 1 ]

J A ( t ) = [ 0 1 − 1 0 ] [ 0 1 − ( α + β p ( t ) ) 0 ] = [ − ( α + β p ( t ) ) 0 0 1 ]

A T ( t ) J + J A ( t ) = 0

Corollary 2. The Monodromy Matrix of the Hill’s equation

z ¨ + ( α + β p ( t ) ) z ( t ) = 0

is a symplectic matrix.

As a consequence of this Corollary, Hill’s equation can not be asymptotically stable, it may be stable (bounded) or unstable.

Definition 7. The eigenvalues of the Monodromy matrix M , equivalently the roots of its characteristic polynomial p M ( λ )

p M ( λ ) = λ 2 − t r ( M ) λ + 1 (11)

are called multipliers of the Hill’s Equations (1) or (2), denoted by λ

Definition 8. Associated to every multiplier λ , there exist (an infinite) numbers called characteristic exponents μ related to a multiplier by λ = e ( μ + 2 π j k T ) T , k ∈ ℤ .

The roots of p M ( λ ) are the multipliers of (1):

λ 1 , 2 = t r ( M ) ± t r 2 ( M ) − 4 2 (12)

If t r 2 ( M ) < 4 the multipliers are complex conjugates with modulus =1. This case corresponds to a stable system.

If t r 2 ( M ) > 4 , the multipliers are real and reciprocal and as a consequence one of the eigenvalues will be greater than one therefore this case corresponds to an unstable system.

t r 2 ( M ) = 4 the multipliers are real and repeated = + 1 or = − 1 . In this case Hill Equation is stable if only if M is a diagonal matrix, otherwise the Hill Equation (1) is unstable.

The boundaries between stability-instability correspond to this last case, i.e. when | t r ( M ) | = 2 . It is clear that M depends on the parameters α , β . It is customary to define [

Theorem 6. Hochstadt [

Due to the Hochstadt Theorem 6, there are two infinite sequences:

λ 0 , λ 1 , λ 2 , λ 3 , λ 4 , λ 5 , ⋯ λ ¯ 1 , λ ¯ 2 , λ ¯ 3 , λ ¯ 4 , λ ¯ 5 , ⋯ (13)

Moreover they interlace as:

λ 0 , λ ¯ 1 , λ ¯ 2 , λ 1 , λ 2 , λ ¯ 3 , λ ¯ 4 , λ 3 , λ 4 , λ ¯ 5 , λ ¯ 6 , ⋯ (14)

This fact is illustrated in

For the values of α in which | ϕ ( α , 1.5 ) | > 2 are shown in grey color and correspond to the unstable zones.

Remark 2. The unstable regions in

Note that the boundary of the 0-th Arnold tongue has a T-periodic solution since the discriminant ϕ ( α , β ) − 2 = 0 has an α root on its boundary surface, the first Arnold tongue has 2T-periodic solutions, the second has T-periodic solutions and so on. In such a way that there is an alternation between T-periodic solutions and 2T-periodic solutions, in consecutive boundaries of the Arnold tongues.

Theorem 7. The Arnold tongues associated to the Hill’s Equation (1) begin at α = ( k π T ) 2 , k = 0 , 1 , 2 , ⋯ .

Proof. Let’s consider the case when β = 0 in (2)

y ˙ ( t ) = A ( t ) y ( t )

then A ( t ) = [ 0 1 − ( α + β p ( t ) ) 0 ] will be A = [ 0 1 − α 0 ] , with the general solution:

y ( t ) = e A t y ( 0 )

If we are looking for periodic solutions:

y ( t ) = y ( t + T ) = e A ( t + T ) y ( 0 + T ) = e A t e A T t ( 0 ) ⇒ e A T = I

then:

e A T = [ cos ( α T ) 1 α sin ( α T ) − α α sin ( α T ) cos ( α T ) ] = [ 1 0 0 1 ]

from where:

cos ( α T ) = 1

α T = k π , k = 0 , 1 , 2 , ⋯

∴ the Arnold tongues of any Hill’s Equation (1) begin at:

α = ( k π T ) 2 , k = 0 , 1 , 2 , 3 , ⋯ (15)

When the periodic function p ( t ) = sign ( cos ( t ) ) of the Hill’s Equation (1) is known as the Meissner’s equation, with a period T = 2 π the points where the

Arnold tongues are born given the previous theorem are α : 0, 1 4 , 1, 9 4 , 4, ⋯ as is shown in the

Remark 3. Notice that according with (15) and theorem 6 generically, there is an infinite number of Arnold tongues of the Hill’s Equation (1) in continuous time.

The classical problem of Hill is to find the values of α , β for which (1) has periodic solutions, i.e., to determine the boundaries of the Arnold tongues of (1).

Definition 9. [

scillatory, if it has at most one zero on ( − ∞ , + ∞ ) . If it has an infinite number of zeros without accumulation points of the zeros on ( − ∞ , + ∞ ) , is said to be oscillatory.

Lemma 8. [

α ≤ α 0 all solutions of (1) are nonoscillatory.

α > α 0 all solutions of (1) are oscillatory.

Consider the following system

x ˙ ( t ) = A ( t ) x ( t ) (16)

When we apply a discretization method we have to change t by k h , where h is the sampling interval and k ∈ ℤ is the discrete time. By notation we will omit the sampling interval i.e. x k instead of x ( k h ) .

Definition 10. The discretization of (16) by the method of forward Euler is defined by [

x k + 1 − x k = h A k x k (17)

where A k = A ( k h )

Definition 11. The discretization of (16) by the method of backward Euler is defined by [

x k − x k − 1 = h A k x k (18)

Definition 12. Tustin method [

The discretization of (16) by the Tustin is defined by

x k + 1 − x k = 1 2 h A k + 1 x k + 1 + 1 2 h A k x k

x k + 1 = [ I − 1 2 h A k + 1 ] − 1 [ I + 1 2 h A k ] x k (19)

Definition 13. Pole-Zero matching equivalence^{3}

^{3}Even if the method mention zero matching we will only care about the pole matching because in our linear Hamiltonian system we don’t have the matrix B , C that are related with the zeros.

Let a be a pole of the system

x ˙ ( t ) = A x ( t )

the technique of pole zero Matching Equivalence [

The Zero-order hold consists in sampling a continuous signal and hold it during the sampling interval so it is defined by:

Definition 14. Zero-order hold [

The discrete system of (16) is defined by^{4}

x k + 1 = Φ ( k + 1 , k ) x k (20)

where Φ ( t , t 0 ) is the state transition matrix of (16).

Since we are dealing with discrete systems we mention a theorem that gives the structure of the solution of a difference equation.

Consider the following difference linear equation

u ( k + n ) + p n − 1 u ( k + n − 1 ) + ⋯ + p 0 u ( k ) = 0 (21)

where p 0 , ⋯ , p n − 1 are constants and p 0 ≠ 0 .

Theorem 9. [

Suppose that (21) has characteristic roots λ 1 , ⋯ , λ n 1 with multiplicities α 1 , ⋯ , α n 1 respectively. Then (21) has the n independent solutions λ 1 k , ⋯ , k α 1 − 1 λ 1 k , λ 2 k , ⋯ , k α 2 − 1 λ 2 k , ⋯ , λ n 1 k , ⋯ , k α n 1 − 1 λ n 1 k .

If the characteristic roots include a complex pair λ = a ± b , then real-valued solutions of (21) can be found by using polar form λ = r e ± i θ = r ( cos θ ± i sin θ ) then λ k = r k e ± i θ k = r k ( cos θ ± i sin θ ) .

^{4}Remember that even when we write Φ ( k + 1, k ) actually is Φ ( h ( k + 1 ) , h k ) .

In this section we will mention some methods that preserves the Hamiltonian structure, i.e. that after discretizing a continuous time Hamiltonian system give us as a result a discrete time Hamiltonian system, according with definitions 5 and 6. Opposite to what we could think not all the discretization methods preserve the Hamiltonian structure.

Consider the following Hamiltonian system

x ˙ ( t ) = λ J H x ( t ) = λ E x ( t ) (22)

where x = [ y z ] , J = [ 0 I − I 0 ] , λ ∈ ℝ + , H T = H = [ A B T B D ] , E = [ B D − A − B T ] .

Using the discretization method of Euler with step h , but using forward Euler in the first equation and backward Euler in the second equation [

y ( ( k + 1 ) h ) − y ( k h ) h = λ B y ( k h ) + λ D z ( k h ) z ( k h ) − z ( ( k − 1 ) h ) h = − λ A y ( k h ) − λ B T z ( k h ) (23)

will result into the system

x k + 1 = C ( λ ) x k

where x = ( y z ) , C ( λ ) = ( I − λ D 0 I + λ B T ) − 1 ( I + λ B 0 − λ A I ) .

Lemma 10. The matrix C ( λ ) is symplectic [

Consider the following Hamiltonian system

x ˙ ( t ) = J H x ( t ) = A x ( t ) (24)

where H = H T ∈ ℝ 2 n × 2 n and J as in (22).

When a discretization method is applied to a Hamiltonian system (24) it will take the following structure

x k + 1 = R x k (25)

In the

The proof can be found in [

Consider the following differential equation

x ˙ ( t ) = A x ( t ) (26)

where A is a Hamiltonian matrix.

Example 1. Let the matrix A of the system (26) have the following spectrum σ ( A ) = { ± 10 i , ± 50 i , ± 110 i } note here that different to the previous example we have just “stable” eigenvalues with zero real part.

However in

R = | Discretization method | Preserves Hamiltonian structure? |
---|---|---|

[ I + h A ] | forward Euler | No |

[ I − h A ] − 1 | backward Euler | No |

[ I − 1 2 h A ] − 1 [ I + 1 2 h A ] | Tustin | Yes |

e A h | Pole zero matching | Yes |

Φ ( k + 1 , k ) = e A h | Zero-order hold | Yes |

the Pole matching^{5} give us as a result a “stable” discrete system but with some differences between Rasvan, Tustin and Pole matching method related with the step h [

^{5}When we mention Pole matching we mean Pole Zero matching and we are also referring to the Zero order hold as it gives us the same discrete system.

In the discrete time approximation the forward Euler method gives us an unstable system and the backward Euler method gives us an asymptotically stable system, only the Rasvan’s procedure, the Tustin method and pole matching give us a stable system as the continuous time approach moreover this information is consistent with the discrete eigenvalue stability information.

In this section we will discretize the Hill’s equation in the integral equation form

y ( T ) = ∫ 0 T A ( τ ) y ( τ ) d τ + y ( 0 ) (27)

and then analyze the result as a discrete system without forgetting that we are discretizing a continuous time system therefore the resultants Arnold’s tongues will correspond to the continuous time Hill’s equation. We can use any discretization method as long as it preserves the Hamiltonian structure of the Hill equation.

By chosing the step h = T K , such that we can set a discrete period K to discretize the continuous time Hill’s Equation (2) and obtain a discrete system of the following form

y ( k + 1 ) h = A k h y k h (28)

where A ( k + K ) h = A k h , T is the continuous time period of the Hill’s Equation (2). For notation we will drop the h and write only y k + 1 = A k y k , A k + K = A k , ∀ k ∈ ℤ .

Theorem 11 (Lifting technique). Consider the following discrete time periodic system

y k + 1 = A k y k , A k + K = A k (29)

the system (29) is equivalent to a linear invariant time discrete system

x k + 1 = A ¯ x k

Proof. Let’s define the following discrete vector state x k = [ y K n y K n + 1 ⋯ y K n + K − 1 ] , then we can transform (29) in this^{6}

x ( n + 1 ) = A ¯ x n (30)

where A ¯ is a constant diagonal blocks matrix,

A ¯ = diag ( A K − 1 ⋯ A 1 A 0 , ⋯ , A K − 2 ⋯ A 0 A K − 1 ) .

Corollary 3. Let M = Φ ( K , 0 ) = A K − 1 A K − 2 ⋯ A 1 A 0 be the Monodromy matrix of the system (29), then the system (29) is:

stable if σ ( M ) ⊂ D ¯ 1 ≜ { z ∈ ℂ : | z | = 1 } & μ ∈ σ ( M ) & | μ | = 1 , μ is a simple root of the minimal polynomial M .

Unstable if ∃ μ ∈ σ ( M ) : | μ | > 1 or if σ ( M ) ⊂ D ¯ 1 , ∃ μ : | μ | = 1 & is not a simple root of the minimal polynomial.

Proof.

det ( λ I − A ¯ ) = ∏ i = 1 K det ( λ I − A ¯ i i )

^{6}This procedure is known as lifting technique [

on the other hand

det ( λ I − A K − 1 ⋯ A 1 A 0 ) = det ( λ I − A 0 A K − 1 ⋯ A 1 ) = ⋯ = det ( λ I − A K − 2 ⋯ A 0 A K − 1 )

which implies that

σ ( A K − 1 ⋯ A 1 A 0 ) = σ ( A 0 A K − 1 ⋯ A 1 ) = ⋯ = σ ( A K − 2 ⋯ A 0 A K − 1 )

therefore the stability of (29) is given by M = A K − 1 ⋯ A 1 A 0 .

ExampleExample 2. Consider the following system

y ˙ ( t ) = A ( t ) y ( t ) (31)

where A ( t ) = [ 0 1 − ( α + β p ( t ) ) 0 ] , α , β are constant, with the periodic

function p ( t ) = sign ( cos ( t ) ) we obtain the

By fixing ( α , β ) and using the theorem 11 to discretize the system (31) and using the corollary 3 to obtain the Monodromy matrix and to analyze its spectrum, plotting a grey dot when the pair ( α , β ) is unstable, and by repeating this process while doing a sweep on the pair ( α , β ) we obtain the Arnold tongues (

Remark 4. If we have in mind that we need to calculate the Monodromy matrix and its eigenvalues for a grid of points α and β in order to plot the Arnold’s tongues. So let’s say that computing the Monodromy matrix for one point ( α , β ) takes 0.005 seconds, for a resolution of points on alpha and beta of 1000 point this would take approximately 13.8 hours to compute and plot the Arnold tongues, however since this computational process can be parallelized we use GPUs to reduce the computational time from hours to seconds.

Notice that the objective of discretizing the Hill’s equation was to recover partially some properties of the continuous time system.

Unlike the discretized case, the discrete Hill’s equation has some properties completely different, that we will describe for the first time.

In this section we will study the Discrete Hill’s equation presented among others by Chulaevsky in 1989 [^{7} and we will give it a graphical interpretation of parametric stability for the first time i.e. discrete Arnold tongues [

Consider the following difference equation

q k + 2 + ( α + β p ( k ) ) q k + 1 + q k = 0 (32)

named here as the Discrete Hill’s equation [

As in the case of continuous time, we can define the state vector y k = [ q k + 1 q k ] to rewrite the Equation (32) as

y k + 1 = A k y k (33)

where A k = [ − ( α + β p ( k ) ) − 1 1 0 ] , A k + K = A k .

Remark 5. Notice that A k is a symplectic matrix, i.e.

A k T J A k = J

where J = [ 0 I − I 0 ] ∴ (33) is a discrete hamiltonian system [

Remark 6. Notice that since A k + K = A k on (33) is periodic we can use the theorem 11 and the Corollary 3 to analyze the stability conditions of (33).

^{7}It may be proven that this Equation (32) results to apply a discrete Variational Method to a discrete Lagrangian through a discrete Euler-Lagrange equation, this will be reported in another paper.

Example 3. Consider the discrete Hill equation q k + 2 + ( α + β p ( k ) ) q k + 1 + q k = 0 as in (32) for some sequences, going from K = 1 up to K = 6 , the following

Remark 7. For K even there is a symmetry with respect to both axes; for K odd the symmetry with respect to β = 0 is preserved, but appear a symmetry with respect to the origin.

Where the white zones shows the stability zones and the grey zones denote instability zones or Arnold tongues labeled from left to right with 0 , 1 , ⋯ , K − 1 and K .

Remark 8. Notice that in continuous time generically there is an infinite number of tongues, this however is not true for the discrete case, in the discrete

case we have generically, only K + 1 tongues.

Theorem 12. The Arnold’s tongues of the discrete Hill’s equation y k + 1 = A k y k as (33), where A k = [ − ( α + β p ( k ) ) − 1 1 0 ] , A k + K = A k , begin at

| l 0 ( − α ) K + l 1 ( − α ) K − 2 + l 2 ( − α ) K − 4 + ⋯ + l K − i 2 ( − α ) i | = 2 (34)

where

i = { 1 if K is even 0 if K is odd

l 0 = 1

l 1 = − ( K )

l 2 = − ( K ) ( K − 1 ) 2 ! − ( K − 2 ) 1 ! l 1

l 3 = − ( K ) ( K − 1 ) ( K − 2 ) 3 ! − ( K − 2 ) ( K − 3 ) 2 ! l 1 − ( K − 4 ) 1 ! l 2

⋮

l K − i 2 = − ( K ) ( K − 1 ) ⋯ ( K − K − i 2 − 1 ) K − i 2 ! − ( K − 2 ) ⋯ ( K − K − i 2 − 2 ) ( K − i 2 − 1 ) ! l 1 − ⋯ − 2 + i 1 ! l ( K − i 2 − 1 )

Proof. We are looking for K-periodic solutions of y k + 1 = A k y k , i.e.

y k = y k + K = Φ ( k + K , 0 ) y 0 = Φ ( k + K , K ) Φ ( K , 0 ) y 0 = Φ ( k , 0 ) M y 0

since the tongues begin at β = 0 , let’s analyze M for β = 0 .

M = A K − 1 A K − 2 ⋯ A 0 | β = 0 = A ˜ K

where

A ˜ = [ − α − 1 1 0 ] ,

σ ( A ˜ ) = { λ 1 = − 1 2 α − 1 2 i 4 − α 2 , λ 2 = − 1 2 α + 1 2 i 4 − α 2 } ,

Since M is a symplectic matrix of dimensions 2 × 2 , its characteristic polynomial is as follows

P M ( λ ) = λ 2 − T r ( A ˜ K ) λ + 1

so the Arnold tongues will begin at the stability boundary | T r ( A ˜ K ) | = 2

Since σ ( A ˜ K ) = { λ 1 K , λ 2 K }

T r ( A ˜ K ) = λ 1 K + λ 2 K (35)

notice that − α = λ 1 + λ 2 , then by substituting in (35) we obtain the polynomial in (34).

Example 4. For a period K = 5

T r ( A ˜ 5 ) = − α 5 − l 1 α 3 − l 2 α (36)

with l 1 = − 5 , l 2 = − 5 × 4 2 − 3 ( − 5 ) = 5 , then

− α 5 + 5 α 3 − 5 α = 2

has the periodic roots on α = { − 2 , − 0.618 , − 0.618 , 1.618 , 1.618 } and

− α 5 + 5 α 3 − 5 α = − 2

has the anti-periodic roots on α = { − 1.618 , − 1.618 , 0.618 , 0.618 , 2 } .

Remark 9. It may be observed that the boundaries of the Arnold Tongues are K-periodic or 2K-periodic; alternating and starting with K-periodic (

Remark 10. Worth notice that all the Arnold tongues with the same period K begin at the same points, since the Equation (34) is independent of the sequence p ( k ) (

We have found that the Nonoscillation Criteria for continuous time Hill’s equation is also fulfilled for the discrete Hill Equation (32).

Definition 15. A solution of a difference equation y k + 1 = A k y k as in (33), where A k = [ − ( α + β p ( k ) ) − 1 1 0 ] , A k + K = A k , is said to be nonoscillatory if

there is at most one change of sign in the solution of (33). If there are an infinite number of zeros of the solutions, they are called Oscillatory.

Theorem 13. For each fixed β of (33), there is an α 0 = α ( β ) , for which if

• α < α 0 all solutions of (32) are nonoscillatory.

• α ≥ α 0 all solutions of (32) are oscillatory.

Even more all the nonoscillatory solutions of (32) fall into the 0-th Arnold tongue.

Proof. Consider first the case with β = 0

q k + 2 + α q k + 1 + q k = 0 (37)

its characteristic polynomial is

( λ 2 + α λ + 1 ) q k = 0 (38)

with the following general solutions, using the Theorem 9:

• for α < − 2 the general solution of (37) is Nonoscillatory

q k = C ( α 2 − α 2 − 4 2 ) k + D ( α 2 + α 2 − 4 2 ) k

• for α = − 2 the general solution of (37) is Nonoscillatory

q k = C 1 k + D t 1 k

• for | α | < 2 the general solution of (37) is oscillatory

q k = C r k e i θ k + D r k e − i θ k

where r is the magnitude of λ , ∴ r = 1 .

• for α = 2 the general solution of (37) is oscillatory

q k = C ( − 1 ) k + D k ( − 1 ) k

• for α > 2 the general solution of (37) is oscillatory

q k = C ( − α 2 − α 2 − 4 2 ) k + D ( − α 2 + α 2 − 4 2 ) k

where C , D are constants, here we see that α 0 = − 2 , for β = 0 .

Let us go back to the case with β ≠ 0 .

Due to corollary 3 the Equation (32) is equivalent to an invariant linear system with the same spectrum of the Monodromy matrix M therefore the solutions of (32) are as follow

Let λ ∈ σ ( M ) and α + β p ( k ) be such that:

• for λ > 1 by hamiltonian properties the general solution of (32) will be Nonoscillatory

q k = C λ k + D ( λ − 1 ) k

• for λ = 1 by hamiltonian properties the general solution of (32) is Nonoscillatory

q k = C 1 k + D k 1 k

• for λ = a + i b the general solution of (37) is oscillatory

q k = C r k e i θ k + D r k e − i θ k

• for λ = − 1 by hamiltonian properties the general solution of (32) is oscillatory

q k = C ( − 1 ) k + D t ( − 1 ) k

• for λ < − 1 by hamiltonian properties and since λ is negative, the general solution of (32) is oscillatory

q k = C ( λ ) k + D ( λ − 1 ) k

where C , D are constants, notice here that the 0-th Arnold tongue lies in the case where λ ≥ 1 i.e. all the nonoscillatory solutions of (32) fall into the 0-th Arnold tongue.

We have proved the next result:

Theorem 14. Given Equation (32), a discrete Hill equation, with a K-periodic coefficient p ( k ) ; k = 0 , 1 , 2 , ⋯ , K − 1 , then (32) is nonoscillatory if and only if ( α , β ) belong to the 0-th Arnold tongue.

Example 5. To illustrate this result, let us use the Arnold tongues obtained in the

over the time, for a different pair of ( α , β ) with the initial condition y 0 = [ 1 0 ] T .

In the

Let’s summarize the properties discussed in this work. So in the

In this paper we found that the Monodromy matrix is a symplectic matrix for both continuous Hill’s equation and discrete Hill’s equation.

It is important to use a discretization method that preserves the Hamiltonian structure otherwise the stability of the discretized system won’t correspond to the original system.

We found that unlike the case of continuous time Hill’s equation where there is an infinite number of tongues, in the discrete time case there is only a finite

Continuous time Hill’s equation | Discrete time Hill’s equation | |
---|---|---|

Is a Hamiltonian system? | yes | yes |

Its Monodromy matrix is symplectic? | yes | yes |

Numbers of Arnold tongues | generically ∞ | K + 1 |

Arnold Tongues begin at | α = ( k π T ) 2 k = 0 , 1 , 2 , ⋯ | | ∑ j = 0 K − i 2 l j ( − α ) K − 2 j | = 2 l j and i as in theorem 12 |

Periodic/anti-periodicsolution alternation in the boundaries of the Arnold Tongues? | yes | yes |

0-th Arnold tongue has a nonoscillatory solution? | yes | yes |

number of them, this is mainly because of the nature of their state transition matrix, while one can have infinite roots of α the other can only have a finite number of roots of α . We found that the solutions of the Discrete time Hill’s equation are nonoscillatory if and only if the corresponding ( α , β ) parameters belongs to the 0-th Arnold tongue.

We are leaving for future work the study of higher order discrete Hill’s equation since here we were focused on the one degree of freedom case.

Servín, J.G.R. and Collado, M.J. (2017) Arnold Tongues for Discrete Hill’s Equation. Applied Mathematics, 8, 1859-1882. https://doi.org/10.4236/am.2017.812133