Next Article in Journal
Highly Imbalanced Classification of Gout Using Data Resampling and Ensemble Method
Previous Article in Journal
Efficient Estimation of Generative Models Using Tukey Depth
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Modeling of Some Classes of Extended Oscillators: Simulations, Algorithms, Generating Chaos, and Open Problems

1
Faculty of Mathematics and Informatics, University of Plovdiv Paisii Hilendarski, 24, Tzar Asen Str., 4000 Plovdiv, Bulgaria
2
Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., Bl. 8, 1113 Sofia, Bulgaria
3
Faculty of Mathematics and Informatics, Sofia University “St. Kliment Ohridski”, 5, James Bourchier Blvd., 1164 Sofia, Bulgaria
*
Author to whom correspondence should be addressed.
Algorithms 2024, 17(3), 121; https://doi.org/10.3390/a17030121
Submission received: 20 February 2024 / Revised: 5 March 2024 / Accepted: 12 March 2024 / Published: 15 March 2024

Abstract

:
In this article, we propose some extended oscillator models. Various experiments are performed. The models are studied using the Melnikov approach. We show some integral units for researching the behavior of these hypothetical oscillators. These will be implemented as add-on sections of a thoughtful main web-based application for researching computations. One of the main goals of the study is to share the difficulties that researchers (who are not necessarily professional mathematicians) encounter in using contemporary computer algebraic systems (CASs) for scientific research to examine in detail the dynamics of modifications of classical and newer models that are emerging in the literature (for the large values of the parameters of the models). The present article is a natural continuation of the research in the direction that has been indicated and discussed in our previous investigations. One possible application that the Melnikov function may find in the modeling of a radiating antenna diagram is also discussed. Some probability-based constructions are also presented. We hope that some of these notes will be reflected in upcoming registered rectifications of the CAS. The aim of studying the design realization (scheme, manufacture, output, etc.) of the explored differential models can be viewed as not yet being met.

1. Introduction

Multiple natural phenomena of the oscillatory kind that appear in a variety of disciplines, such as mechanics, quantum optics, acoustics, hydrodynamics, electronics, and engineering, have the possibility of ensuring the freedom of a potential well, and are portrayed by a general escape nonlinear oscillator model. Sanjuan [1] considers the equation of movement for the sinusoidal-driven escape oscillator, incorporating nonlinear damping conditions as a power series on the speed reads:
x ¨ + p = 1 n β x ˙ | x ˙ | p 1 + x x 2 = F sin ω t ,
where β is the damping level, p is the damping exponent, and F and ω are the forcing amplitude and the frequency of the outer disturbance, respectively. Specifically, the following system is considered
d x d t = y d y d t = x + x 2 β y | y | p 1 + F sin ω t ,
where—for simplification—at most a lone damping term in proportion to the p th power of the speed is taken.
The critical forcing parameter F c p , for which homoclinic entangles intersect, for a fixed frequency ω , is a function of the damping exponent p and the damping factor β ; this may be expressed as [1]:
F c p = β s i n h ( π ω ) 3 π ω 2 3 2 p + 1 B p + 2 2 , p + 1 2
where B ( m , n ) is the Euler Beta function.
The nonlinear vessel trundling reply and nonlinearly damped general escape oscillator can be represented in the following way:
d x d t = y d y d t = j = 1 m a j x j + p = 1 n c p y | y | p 1 + F cos ω t .
In [2], the authors have researched the upshots of the damping level on the rational answer of the steady-state decisions and on the basin bifurcation models of the escape oscillator in substantial detail. The literature devoted to this issue is significant in volume and diverse. We direct the reader to [2,3,4,5,6,7,8,9,10,11,12]; here, the reader can find additional related studies. The paper by Tang, Man, Zhong, and Chen [13] studies the character of the expression x | x | as a chaos creator in a non-self-governing differential model. More precisely, the next model is considered
d x d t = y d y d t = a x b x | x | ϵ ξ y c sin ( ω t ) .
For other results, see [14,15,16,17,18,19]. In [20,21,22], the authors explore the dynamics of the following hypothetical oscillators of the type
d x d t = y d y d t = b x i = 0 n 2 1 b i x n 2 i ϵ α y + ( 1 + cos ( ω t ) ) a x + i = 0 m 2 1 a i x m 2 i ,
d x d t = y d y d t = b x i = 0 n 2 1 b i x n 2 i ϵ α y + j = 1 N g j sin ( j ω t ) a x + i = 0 m 2 1 a i x m 2 i ,
d x d t = y d y d t = sin x + ϵ a 1 + i = 0 n 2 1 a n 2 i x n 2 i + i = 0 n 2 2 b n 2 2 i y n 2 2 i y .
In this article, we consider extended oscillators, which are a mixed form of Models (3)–(6), mentioned above. Some experiments were organized. The models were explored using the Melnikov approach [23]. We propose several specific units for researching the behavior of these hypothetical oscillators. The obtained outcomes can be exploited as add-on units of a much more extensive realization for reliable computations—for more information see [20,21,22,23,24,25]. One of the main goals of the present study is to share the difficulties that researchers (who are not necessarily professional mathematicians) encounter in using CASs for scientific research; we aim to research the dynamics of modifications of classical and newer models that are emerging in the literature. We hope that some of these notes will be reflected in upcoming registered revisions of CASs. The design of the article is as follows. We present new models in Section 2. The results of several experiments are obtained in Section 2.1.1. One possible application that Melnikov function may find in the modeling of radiating antenna diagram is discussed in Section 2.3. A “mixed” model, generating chaos via x | x | , is considered in Section 3. Sundry experiments are presented in Section 3.1. Investigations using Melnikov’s theory are considered in Section 3.1.1. Several probability-based constructions are presented in Section 4. We end this study with Section 5.

2. The Models

2.1. Model A: Mixed Form of Models (3) and (5)

Let us explore the next new class of extended oscillators:
d x d t = y d y d t = b x i = 0 n 2 1 b i x n 2 i ϵ A p = 1 k y | y | 2 p 1 + ( 1 + cos ( ω t ) ) a x + i = 0 m 2 1 a i x m 2 i ,
where 0 ϵ < 1 , A is the damping level, and p 1 is the damping exponent. Particularly, we examine the next differential system:
d x d t = y d y d t = b x b 1 x 3 b 0 x 5 ϵ A p = 1 3 y | y | 2 p 1 + ( 1 + cos ( ω t ) ) a x + a 1 x 3 + a 0 x 5 ,
We suppose that b < 0 , b 1 < 0 , b 0 > 0 . For ϵ = 0 , the obtaining Hamiltonian of differential Model (9) is H ( x , y ) = 1 2 y 2 1 2 b x 2 + 1 4 b 1 x 4 + 1 6 b 0 x 6 . Using the approach stated in [17], we receive the Hamiltonian system for ϵ = 0 for new differential model by a couple of heteroclinic orbits, circumscribed as
x h e t = ± 2 x 1 s i n h γ 2 t ξ + c o s h ( γ t ) y h e t = ± 2 γ x 1 ( 1 ξ ) c o s h γ 2 t 2 ( ξ + c o s h ( γ t ) ) 3 2
and a couple of symmetric homoclinic paths relate every unsteady point to itself, as stated by
x h o m = ± 2 x 1 c o s h γ 2 t ξ + c o s h ( γ t ) ; y h o m = ± 2 γ x 1 ( ξ 1 ) s i n h γ 2 t 2 ( ξ + c o s h ( γ t ) ) 3 2 ,
where
δ = b 1 2 + 4 b b 0 ; ρ = b 1 δ b 1 + δ ; ξ = 5 3 ρ 2 2 ρ 2 1 x 1 = 1 2 b 0 ( b 1 + δ ) ; γ = x 1 2 2 b 0 ( ρ 2 1 ) .
These results are depicted in Figure 1. We refer to [17,18,19] (see also [21] for more details).

2.1.1. Some Simulations

Let us concentrate on several intriguing examples:
Example 1.
For fixed b = 0.4 ; b 1 = 0.7 ; b 0 = 0.1 ; A = 0.1 ; ϵ = 0.1 ; ω = 1.01 ; a = a 1 = a 0 = 1 , the experiments on Model (9) for x 0 = 0.6 ; y 0 = 0.3 are visualized in Figure 2.
Example 2.
For fixed b = 0.4 ; b 1 = 0.7 ; b 0 = 0.1 ; A = 0.1 ; ϵ = 0.1 ; ω = 1.01 ; a = 0.9 ; a 1 = 0.8 ; a 0 = 0.7 , the experiments on Model (9) for x 0 = 0.6 ; y 0 = 0.3 are visualized in Figure 3.
Example 3.
For fixed b = 0.4 ; b 1 = 0.7 ; b 0 = 0.1 ; A = 0.01 ; ϵ = 0.1 ; ω = 1.01 ; a = 0.7 ; a 1 = 3.8 ; a 0 = 5.3 , the experiments on Model (9) for x 0 = 0.6 ; y 0 = 0.3 are visualized in Figure 4.
Example 4.
For fixed b = 0.1 ; b 1 = 0.3 ; b 0 = 0.1 ; A = 0.01 ; ϵ = 0.1 ; ω = 1.01 ; a = 1.7 ; a 1 = 2.8 ; a 0 = 6.1 , the experiments on Model (9) for x 0 = 0.6 ; y 0 = 0.2 are visualized in Figure 5.

2.2. A Modified Model

Let us investigate the next differential system:
d x d t = y d y d t = x x 3 ϵ A y | y | p 1 j = 1 N g j sin ( j ω t )
For fixed ϵ = 0 , the outcome Hamiltonian of the model (10) is
H ( x , y ) = 1 2 y 2 1 2 x 2 + 1 4 x 4 .
A saddle point exists at the origin, which is centered at ( ± 1 , 0 ) , and a couple homoclinic trajectories are set by (see Figure 6):
x 0 ( t ) = ± 2 s e c h t y 0 ( t ) = 2 s e c h t t a n h t .
We refer to [8,9,10,11,20] for more details. The homoclinic integral of Melnikov is set by
M ( t 0 ) = y 0 ( t ) A y 0 ( t ) | y 0 ( t ) | p 1 j = 1 N g i sin ( j ω ( t + t 0 ) ) d t ,
where the expressions x 0 ( t ) and y 0 ( t ) are circumscribed by Equation (11). We will demonstrate the next statement, where p = 2 and N = 1 .
Proposition 1.
If p = 2 and N = 1 , then the zeroes of the Melnikov function M ( t 0 ) are obtained as roots of the following equation:
M ( t 0 ) = 16 15 2 A + 1 30 2 e i t 0 ω 15 g 1 ω P o l y G a m m a [ 0 , 1 4 i ω 4 ] + 15 e 2 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 1 4 i ω 4 ] 15 g 1 ω P o l y G a m m a [ 0 , 3 4 i ω 4 ] 15 e 2 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 3 4 i ω 4 ] + 15 g 1 ω P o l y G a m m a [ 0 , 1 4 + i ω 4 ] + 15 e 2 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 1 4 + i ω 4 ] 15 g 1 ω P o l y G a m m a [ 0 , 3 4 + i ω 4 ] 15 e 2 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 3 4 + i ω 4 ] = 0 .
Here, P o l y G a m m a [ n , z ] is the n th derivative of the digamma function  ψ ( n ) ( z ) , i.e., ψ ( 0 ) ( z ) = Γ ( z ) Γ ( z ) and Γ ( z ) = 0 t z 1 e t d t [26].
As an illustration, the equality M ( t 0 ) = 0 (for p = 2 ; N = 1 ; A = 1.01 ; ω = 0.25 ; g 1 = 0.9 ) is depicted in Figure 7a. The roots in interval ( 0 , 26 ) are as follows: 2.42651 ; 22.7062 . For p = 2 ; N = 1 ; A = 1.05 ; ω = 0.1 ; g 1 = 0.916 , M ( t 0 ) has no roots (Figure 7b). From Proposition 1 (see also Figure 7), the reader may formulate the Melnikov’s condition for chaotic behavior of the dynamical model. Let us demonstrate the next statement, where p = 2 and N = 2 .
Proposition 2.
If p = 2 and N = 2 , then the zeros of the Melnikov function M ( t 0 ) are received as roots of the equation
M ( t 0 ) = 1 30 2 e 2 i t 0 ω 32 A e 2 i t 0 ω + 15 e i t 0 ω g 1 ω P o l y G a m m a [ 0 , 1 4 i ω 4 ] + 15 e 3 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 1 4 i ω 4 ] 15 e i t 0 ω g 1 ω P o l y G a m m a [ 0 , 3 4 i ω 4 ] 15 e 3 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 3 4 i ω 4 ] + 15 e i t 0 ω g 1 ω P o l y G a m m a [ 0 , 1 4 + i ω 4 ] + 15 e 3 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 1 4 + i ω 4 ] 15 e i t 0 ω g 1 ω P o l y G a m m a [ 0 , 3 4 + i ω 4 ] 15 e 3 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 3 4 + i ω 4 ] + 30 g 2 ω P o l y G a m m a [ 0 , 1 4 i ω 2 ] + 30 e 4 i t 0 ω g 2 ω P o l y G a m m a [ 0 , 1 4 i ω 2 ] 30 g 2 ω P o l y G a m m a [ 0 , 3 4 i ω 2 ] 30 e 4 i t 0 ω g 2 ω P o l y G a m m a [ 0 , 3 4 i ω 2 ] + 30 g 2 ω P o l y G a m m a [ 0 , 3 4 + i ω 2 ] + 30 e 4 i t 0 ω g 2 ω P o l y G a m m a [ 0 , 1 4 + i ω 2 ] 30 g 2 ω P o l y G a m m a [ 0 , 3 4 + i ω 2 ] 30 e 4 i t 0 ω g 2 ω P o l y G a m m a [ 0 , 3 4 + i ω 2 ] = 0 .
As an illustration, the equation M ( t 0 ) = 0 when (for (a)) p = 2 ; N = 2 ; A = 1.01 ; ω = 0.4 ; g 1 = 0.4 ; g 2 = 0.95 is depicted in Figure 8a. The roots in interval ( 0 , 12 ) are: 1.74485 ; 6.92814 ; 8.798 . For (b), p = 2 ; N = 2 ; A = 0.6 ; ω = 0.6 ; g 1 = 0.09 ; g 2 = 0.05 , M ( t 0 ) has no roots (see Figure 8b).
The next proposition is fulfilled for fixed p = 2 and N = 3 . We will note that this result was reported in [21] only as a particular example illustrating the obstacles that the researcher faces in the usage of a particular CAS. Here, we place it in full.
Proposition 3.
If p = 2 and N = 3 , then the zeros of the Melnikov function M ( t 0 ) are obtained as a roots of the following equation:
M ( t 0 ) = 1 60 e 3 i t 0 ω 32 2 A e 3 i t 0 ω + 15 2 e 2 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 1 4 i ω 4 ] + 15 2 e 4 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 1 4 i ω 4 ] 15 2 e 2 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 3 4 i ω 4 ] 15 2 e 4 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 3 4 i ω 4 ] + 15 2 e 2 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 1 4 + i ω 4 ] + 15 2 e 4 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 1 4 + i ω 4 ] 15 2 e 2 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 3 4 + i ω 4 ] 15 2 e 4 i t 0 ω g 1 ω P o l y G a m m a [ 0 , 3 4 + i ω 4 ] + 30 2 e i t 0 ω g 2 ω P o l y G a m m a [ 0 , 1 4 i ω 2 ] + 30 2 e 5 i t 0 ω g 2 ω P o l y G a m m a [ 0 , 1 4 i ω 2 ] 30 2 e i t 0 ω g 2 ω P o l y G a m m a [ 0 , 3 4 i ω 2 ] 30 2 e 5 i t 0 ω g 2 ω P o l y G a m m a [ 0 , 3 4 i ω 2 ] + 30 2 e i t 0 ω g 2 ω P o l y G a m m a [ 0 , 1 4 + i ω 2 ] + 30 2 e 5 i t 0 ω g 2 ω P o l y G a m m a [ 0 , 1 4 + i ω 2 ] 30 2 e i t 0 ω g 2 ω P o l y G a m m a [ 0 , 3 4 + i ω 2 ] 30 2 e 5 i t 0 ω g 2 ω P o l y G a m m a [ 0 , 3 4 + i ω 2 ] + 45 2 g 3 ω P o l y G a m m a [ 0 , 1 4 3 i ω 4 ] + 45 2 e 6 i t 0 ω g 3 ω P o l y G a m m a [ 0 , 1 4 3 i ω 4 ] 45 2 g 3 ω P o l y G a m m a [ 0 , 3 4 3 i ω 4 ] 45 2 e 6 i t 0 ω g 3 ω P o l y G a m m a [ 0 , 3 4 3 i ω 4 ] + 45 2 g 3 ω P o l y G a m m a [ 0 , 1 4 + 3 i ω 4 ] + 45 2 e 6 i t 0 ω g 3 ω P o l y G a m m a [ 0 , 1 4 + 3 i ω 4 ] 45 2 g 3 ω P o l y G a m m a [ 0 , 3 4 + 3 i ω 4 ] 45 2 e 6 i t 0 ω g 3 ω P o l y G a m m a [ 0 , 3 4 + 3 i ω 4 ] = 0 .
As an illustration, the equation M ( t 0 ) = 0 when (a) p = 2 ; N = 3 ; A = 1.01 ; ω = 0.34 ; g 1 = 0.5 ; g 2 = 0.95 ; g 3 = 0.8 is visualized in Figure 9a. For (b), p = 2 ; N = 3 ; A = 0.1 ; ω = 0.9 ; g 1 = 0.01 ; g 2 = 0.02 ; g 3 = 0.015 , M ( t 0 ) has no roots (see Figure 9b).
From Propositions 2 and 3, the reader may formulate the Melnikov’s standard for the emergence of crossing the perturbed and unperturbed separatrix. The reader can explore the relevant approximation issue for arbitrarily selected p and N.

2.3. One Possible Application That Melnikov Functions May Find in the Modeling and Synthesis of Radiating Antenna Patterns

Let us dwell on the functions M ( t ) generated by Propositions 2 and 3. Thus, for example, typical diagrams are visualized in Figure 10 with the following selection of parameters:
I.
p = 2 ; N = 2 ; A = 0.13 ; ω = 0.6 ; g 1 = 0.09 ; g 2 = 0.05 (from Proposition 2);
II.
p = 2 ; N = 3 ; A = 0.011 ; ω = 0.9 ; g 1 = 0.01 ; g 2 = 0.02 ; g 3 = 0.03 (from Proposition 3).
Of course, the complex problem related to choosing an optimization approach to minimize lateral radiation in the specified class of diagrams can be considered as open.
The reader can find additional information in [27].

3. One More Note on the Subject: Generating Chaos via x | x |

In this section, we will explore the dynamics of the following ”mixed” model:
d x d t = y d y d t = x x | x | ϵ A p = 1 n y | y | p 1 j = 1 N g j sin ( j ω t )
where 0 ϵ < 1 , A is the damping level, N is natural number, and p 1 is the damping exponent. Particularly, we investigate the next differential system
d x d t = y d y d t = x x | x | ϵ A y | y | p 1 j = 1 N g j sin ( j ω t ) .
The total energy of this system ( ϵ = 0 ) is H ( x , y ) = 1 2 y 2 1 2 x 2 + 1 3 x 2 | x | . Some details can be found in [13]. The trajectory is obtained by (see Figure 11):
x 0 ( t ) = ± 3 1 + c o s h t ˙ y 0 ( t ) = 3 s i n h t ( 1 + c o s h t ˙ ) 2

3.1. Some Simulations

Let us consider several intriguing experiments:
Example 5.
For fixed p = 2 ; N = 2 ; A = 0.015 ; ϵ = 0.1 ; ω = 0.6 ; g 1 = 0.07 ; g 2 = 0.3 , the experiments by Model (17) for x 0 = 0.6 ; y 0 = 0.2 are visualized in Figure 12.
Example 6.
For fixed p = 6 ; N = 3 ; A = 0.1 ; ϵ = 0.1 ; ω = 0.32 ; g 1 = 0.9 ; g 2 = 0.8 ; g 3 = 0.7 , the experiments by Model (17) for x 0 = 0.8 ; y 0 = 0.5 are visualized in Figure 13.
Example 7.
For fixed p = 8 ; N = 5 ; A = 0.1 ; ϵ = 0.1 ; ω = 0.32 ; g 1 = 0.9 ; g 2 = 0.8 ; g 3 = 0.7 ; g 4 = 0.6 ; g 5 = 0.5 , the experiments by Model (17) for x 0 = 0.6 ; y 0 = 0.3 are visualized in Figure 14.
Example 8.
For fixed p = 10 ; N = 6 ; A = 0.1 ; ϵ = 0.1 ; ω = 0.32 ; g 1 = 0.9 ; g 2 = 0.1 ; g 3 = 0.8 ; g 4 = 0.2 ; g 5 = 0.7 ; g 6 = 0 , the experiments by Model (17) for x 0 = 0.7 ; y 0 = 0.5 are visualized in Figure 15.

3.1.1. Melnikov’s Approach

By definition, the Melnikov integral is presented by
M ( t 0 ) = y 0 ( t ) A y 0 ( t ) | y 0 ( t ) | p 1 j = 1 N g i sin ( j ω ( t + t 0 ) ) d t ,
where the functions x 0 ( t ) and y 0 ( t ) are defined by Equation (18).
Let us indicate the next statement for fixed p = 2 and N = 1 .
Proposition 4.
If p = 2 and N = 1 , then the zeroes of the Melnikov function M ( t 0 ) are received as roots of the following equation:
M ( t 0 ) = 1 75,600 e i t 0 ω 42,525 A e i t 0 ω 226,800 g 1 ω 226,800 e 2 i t 0 ω g 1 ω + 188,016 g 1 ω 3 + 188,016 e 2 i t 0 ω g 1 ω 3 37,328 g 1 ω 5 37,328 e 2 i t 0 ω g 1 ω 5 + 2144 g 1 ω 7 + 2144 e 2 i t 0 ω g 1 ω 7 32 g 1 ω 9 32 e 2 i t 0 ω g 1 ω 9 + 62,136 i g 1 ω 2 P [ 0 , 1 2 i ω 2 ] + 62,136 i e 2 i t 0 ω g 1 ω 2 P [ 0 , 1 2 i ω 2 ] 45,800 i g 1 ω 4 P [ 0 , 1 2 i ω 2 ] 45,800 i e 2 i t 0 ω g 1 ω 4 P [ 0 , 1 2 I ω 2 ] + 5313 i g 1 ω 6 P [ 0 , 1 2 i ω 2 ] + 5313 i e 2 i t 0 ω g 1 ω 6 P [ 0 , 1 2 i ω 2 ] 150 i g 1 ω 8 P [ 0 , 1 2 I ω 2 ] 150 i e 2 i t 0 ω g 1 ω 8 P [ 0 , 1 2 i ω 2 ] + i g 1 ω 10 P [ 0 , 1 2 i ω 2 ] + i e 2 i t 0 ω g 1 ω 10 P [ 0 , 1 2 i ω 2 ] 94,392 i g 1 ω 2 P [ 0 , 1 i ω 2 ] 94,392 i e 2 i t 0 ω g 1 ω 2 P [ 0 , 1 i ω 2 ] + 22,620 i g 1 ω 4 P [ 0 , 1 i ω 2 ] + 22,620 i e 2 i t 0 ω g 1 ω 4 P [ 0 , 1 i ω 2 ] + 3339 i g 1 ω 6 P [ 0 , 1 i ω 2 ] + 3339 i e 2 i t 0 ω g 1 ω 6 P [ 0 , 1 i ω 2 ] 270 i g 1 ω 8 P [ 0 , 1 i ω 2 ] 270 i e 2 i t 0 ω g 1 ω 8 P [ 0 , 1 i ω 2 ] + 3 i g 1 ω 10 P [ 0 , 1 i ω 2 ] + 3 i e 2 i t 0 ω g 1 ω 10 P [ 0 , 1 i ω 2 ] + 46,512 i g 1 ω 2 P [ 0 , 3 2 i ω 2 ] + 46,512 i e 2 i t 0 ω g 1 ω 2 P [ 0 , 3 2 i ω 2 ] + 39,440 i g 1 ω 4 P [ 0 , 3 2 i ω 2 ] + 39,440 i e 2 i t 0 ω g 1 ω 4 P [ 0 , 3 2 i ω 2 ] 7014 i g 1 ω 6 P [ 0 , 3 2 i ω 2 ] 7014 i e 2 i t 0 ω g 1 ω 6 P [ 0 , 3 2 i ω 2 ] + 60 i g 1 ω 8 P [ 0 , 3 2 i ω 2 ] + 60 i e 2 i t 0 ω g 1 ω 8 P [ 0 , 3 2 i ω 2 ] + 2 i g 1 ω 10 P [ 0 , 3 2 i ω 2 ] + 2 i e 2 i t 0 ω g 1 ω 10 P [ 0 , 3 2 i ω 2 ] 18,432 i g 1 ω 2 P [ 0 , 2 i ω 2 ] 18,432 i e 2 i t 0 ω g 1 ω 2 P [ 0 , 2 i ω 2 ] 21,800 i g 1 ω 4 P [ 0 , 2 i ω 2 ] 21,800 i e 2 i t 0 ω g 1 ω 4 P [ 0 , 2 i ω 2 ] 3066 i g 1 ω 6 P [ 0 , 2 i ω 2 ] 3066 i e 2 i t 0 ω g 1 ω 6 P [ 0 , 2 i ω 2 ] + 300 i g 1 ω 8 P [ 0 , 2 i ω 2 ] + 300 i e 2 i t 0 ω g 1 ω 8 P [ 0 , 2 i ω 2 ] 2 i g 1 ω 10 P [ 0 , 2 i ω 2 ] 2 i e 2 i t 0 ω g 1 ω 10 P [ 0 , 2 i ω 2 ] + 4752 i g 1 ω 2 P [ 0 , 5 2 i ω 2 ] + 4752 i e 2 i t 0 ω g 1 ω 2 P [ 0 , 5 2 i ω 2 ] + 6360 I g 1 ω 4 P [ 0 , 5 2 i ω 2 ] + 6360 i e 2 i t 0 ω g 1 ω 4 P [ 0 , 5 2 i ω 2 ] + 1701 i g 1 ω 6 P [ 0 , 5 2 i ω 2 ] + 1701 i e 2 i t 0 ω g 1 ω 6 P [ 0 , 5 2 i ω 2 ] + 90 i g 1 ω 8 P [ 0 , 5 2 i ω 2 ] + 90 i e 2 i t 0 ω g 1 ω 8 P [ 0 , 5 2 i ω 2 ] 3 i g 1 ω 10 P [ 0 , 5 2 i ω 2 ] 3 i e 2 i t 0 ω g 1 ω 10 P [ 0 , 5 2 I ω 2 ] 576 i g 1 ω 2 P [ 0 , 3 I ω 2 ] 576 i e 2 i t 0 ω g 1 ω 2 P [ 0 , 3 i ω 2 ] 820 i g 1 ω 4 P [ 0 , 3 i ω 2 ] 820 i e 2 i t 0 ω g 1 ω 4 P [ 0 , 3 i ω 2 ] 273 i g 1 ω 6 P [ 0 , 3 i ω 2 ] 273 i e 2 i t 0 ω g 1 ω 6 P [ 0 , 3 i ω 2 ] 30 i g 1 ω 8 P [ 0 , 3 i ω 2 ] 30 i e 2 i t 0 ω g 1 ω 8 P [ 0 , 3 i ω 2 ] i g 1 ω 10 P [ 0 , 3 i ω 2 ] i e 2 i t 0 ω g 1 ω 10 P [ 0 , 3 i ω 2 ] 62,136 i g 1 ω 2 P [ 0 , 1 2 + i ω 2 ] 62,136 i e 2 i t 0 ω g 1 ω 2 P [ 0 , 1 2 + i ω 2 ] + 45,800 i g 1 ω 4 P [ 0 , 1 2 + i ω 2 ] + 45,800 i e 2 i t 0 ω g 1 ω 4 P [ 0 , 1 2 + i ω 2 ] 5313 i g 1 ω 6 P [ 0 , 1 2 + i ω 2 ] 5313 i e 2 i t 0 ω g 1 ω 6 P [ 0 , 1 2 + i ω 2 ] + 150 i g 1 ω 8 P [ 0 , 1 2 + i ω 2 ] + 150 i e 2 i t 0 ω g 1 ω 8 P [ 0 , 1 2 + i ω 2 ] i g 1 ω 10 P [ 0 , 1 2 + i ω 2 ] i e 2 i t 0 ω g 1 ω 10 P [ 0 , 1 2 + i ω 2 ] + 94,392 i g 1 ω 2 P [ 0 , 1 + i ω 2 ] + 94,392 i e 2 i t 0 ω g 1 ω 2 P [ 0 , 1 + i ω 2 ] 22 , 620 i g 1 ω 4 P [ 0 , 1 + i ω 2 ] 22,620 i e 2 i t 0 ω g 1 ω 4 P [ 0 , 1 + i ω 2 ] 3339 i g 1 ω 6 P [ 0 , 1 + i ω 2 ] 3339 i e 2 i t 0 ω g 1 ω 6 P [ 0 , 1 + i ω 2 ] + 270 i g 1 ω 8 P [ 0 , 1 + i ω 2 ] + 270 i e 2 i t 0 ω g 1 ω 8 P [ 0 , 1 + i ω 2 ] 3 i g 1 ω 10 P [ 0 , 1 + i ω 2 ] 3 i e 2 i t 0 ω g 1 ω 10 P [ 0 , 1 + i ω 2 ] 46,512 i g 1 ω 2 P [ 0 , 3 2 + i ω 2 ] 46,512 i e 2 i t 0 ω g 1 ω 2 P [ 0 , 3 2 + i ω 2 ] 39,440 i g 1 ω 4 P [ 0 , 3 2 + i ω 2 ] 39,440 i e 2 i t 0 ω g 1 ω 4 P [ 0 , 3 2 + i ω 2 ] + 7014 i g 1 ω 6 P [ 0 , 3 2 + i ω 2 ] + 7014 i e 2 i t 0 ω g 1 ω 6 P [ 0 , 3 2 + i ω 2 ] 60 i g 1 ω 8 P [ 0 , 3 2 + i ω 2 ] 60 i e 2 i t 0 ω g 1 ω 8 P [ 0 , 3 2 + i ω 2 ] 2 i g 1 ω 10 P [ 0 , 3 2 + i ω 2 ] 2 i e 2 i t 0 ω g 1 ω 10 P [ 0 , 3 2 + i ω 2 ] + 18,432 i g 1 ω 2 P [ 0 , 2 + i ω 2 ] + 18,432 i e 2 i t 0 ω g 1 ω 2 P [ 0 , 2 + i ω 2 ] + 21,800 i g 1 ω 4 P [ 0 , 2 + i ω 2 + 21,800 i e 2 i t 0 ω g 1 ω 4 P [ 0 , 2 + i ω 2 ] + 3066 i g 1 ω 6 P [ 0 , 2 + i ω 2 ] + 3066 i e 2 i t 0 ω g 1 ω 6 P [ 0 , 2 + i ω 2 ] 300 i I g 1 ω 8 P [ 0 , 2 + i ω 2 ] 300 i e 2 i t 0 ω g 1 ω 8 P [ 0 , 2 + i ω 2 ] + 2 i g 1 ω 10 P [ 0 , 2 + i ω 2 ] + 2 i e 2 i t 0 ω g 1 ω 10 P [ 0 , 2 + i ω 2 ] 4752 i g 1 ω 2 P [ 0 , 5 2 + i ω 2 ] 4752 i e 2 i t 0 ω g 1 ω 2 P [ 0 , 5 2 + i ω 2 ] 6360 i g 1 ω 4 P [ 0 , 5 2 + i ω 2 ] 6360 i e 2 i t 0 ω g 1 ω 4 P [ 0 , 5 2 + i ω 2 ] 1701 i g 1 ω 6 P [ 0 , 5 2 + i ω 2 ] 1701 i e 2 i t 0 ω g 1 ω 6 P [ 0 , 5 2 + i ω 2 ] 90 i g 1 ω 8 P [ 0 , 5 2 + i ω 2 ] 90 i e 2 i t 0 ω g 1 ω 8 P [ 0 , 5 2 + i ω 2 ] + 3 i g 1 ω 10 P [ 0 , 5 2 + i ω 2 ] + 3 i e 2 i t 0 ω g 1 ω 10 P [ 0 , 5 2 + i ω 2 ] + 576 i g 1 ω 2 P [ 0 , 3 + i ω 2 ] + 576 i e 2 i t 0 ω g 1 ω 2 P [ 0 , 3 + i ω 2 ] + 820 i I g 1 ω 4 P [ 0 , 3 + i ω 2 ] + 820 i e 2 i t 0 ω g 1 ω 4 P [ 0 , 3 + i ω 2 ] + 273 i g 1 ω 6 P [ 0 , 3 + i ω 2 ] + 273 i e 2 i t 0 ω g 1 ω 6 P [ 0 , 3 + i ω 2 ] + 30 i g 1 ω 8 P [ 0 , 3 + i ω 2 ] + 30 i e 2 i t 0 ω g 1 ω 8 P [ 0 , 3 + i ω 2 ] + i g 1 ω 10 P [ 0 , 3 + i ω 2 ] + i e 2 i t 0 ω g 1 ω 10 P [ 0 , 3 + i ω 2 ] ) = 0 .
Here, we have used the abbreviation P [ . , . ] instead of P o l y G a m m a [ . , . ] .
Remark 1.
Proposition 4 is generated using direct reference to the specialized module provided in CAS Mathematica; we place it in this form. For the equation M ( t 0 ) = 0 (for fixed A = 0.15 ; ω = 0.1 ; g 1 = 0.091 ), see Figure 16.

4. Some Probability-Based Constructions

Many works devoted to the oscillators with stochastic elements (Gaussian colored noise, Ornstein–Uhlenbeck process, Poisson distribution, different non-Gaussian terms, maximum entropy principle, etc.) are available in the scientific literature—we refer to [28,29,30,31,32]. Despite their different essences, these elements modify the oscillator behavior. We suggest an alternative approach in this research. We assume that the parameters a i and b i , that control the oscillator dynamics, are generated by some distribution. This way, the intrinsic properties of the used stochastic component can be incorporated into the behavior of the related oscillator; in this way, they improve its fine structure.
Suppose now that the coefficients a i and b i from Equation (8) are the probabilities of some finite-space discrete distributions. Let us denote by ψ a · and ψ b · their moment-generating functions. Let ξ a and ξ b be some random variables exhibiting the corresponding laws. We shall use the symbol E for the related expectations. We can rewrite the second part of system (8) as
d y d t = b x i = 0 n 2 1 b i x n 2 i ϵ A p = 1 k y | y | 2 p 1 + ( 1 + cos ( ω t ) ) a x + i = 0 m 2 1 a i x m 2 i = b x x n i = 0 n 2 1 b i e 2 i ln x ϵ A p = 1 k y | y | 2 p 1 + ( 1 + cos ( ω t ) ) a x + x m i = 0 m 2 1 a i e 2 i ln x = b x x n E e 2 ξ b ln x ϵ A p = 1 k y | y | 2 p 1 + ( 1 + cos ( ω t ) ) a x + E e 2 ξ a ln x = b x x n ψ b 2 ln x ϵ A p = 1 k y | y | 2 p 1 + ( 1 + cos ( ω t ) ) a x + ψ a 2 ln x .
Let us discuss some examples—discrete uniform, binomial, β -binomial, and hypergeometric distributions. We state the domain at the set 0 , 1 , 2 , , K . We have K = m 2 for ξ a and K = n 2 for ξ b , respectively, for a i and b i . The coefficients a i and b i are defined as the probabilities:
p i uniform = 1 K p i binomial = k i p i 1 p K i p i β binomial = K i B i + α , k i + β B α , β p i hypergeometric = K i N K M i N M .
The necessary conditions are 0 < p < 1 , α > 0 , β > 0 , K M N 2 , and M and N are integers. The β -function B · , · is defined through the gamma function as
B x , y = Γ x Γ y Γ x + y .
Having in mind that the moment-generating functions of these distributions are
ψ uniform x = 1 e K + 1 x K 1 e x ψ binomial x = 1 p + p e x K ψ β binomial x = F 1 2 K , α , α + β , 1 e x ψ hypergeometric x = N K M F 1 2 M , K , N M K + 1 , e x N M ,
we express the terms ψ 2 ln x from Equation (21) as
ψ uniform 2 ln x = x 2 k + 1 1 K x 2 k x 2 1 ψ binomial 2 ln x = 1 p + p x 2 K ψ β binomial 2 ln x = F 1 2 K , α , α + β , 1 1 x 2 ψ hypergeometric 2 ln x = N k M F 1 2 M , K , N M k + 1 , 1 x 2 N M .
Let us remind the reader that the symbol F 1 2 stands for the Gaussian hypergeometric function. We can now construct varieties of distribution-based oscillators combining terms (25) and estimating them in (21).

5. Concluding Remarks

In present article, we have explored some extended hypothetical oscillator models. We present several specific units for researching the dynamics of the explored oscillators. A cloud realization that requires only an internet browser and connection is provided for several of them. This will be included as an add-on unit of an improved web-based platform that has been designed for reliable computations. In light of the numerical analysis, the problem of researching the zeroes of M ( t 0 ) = 0 is very intriguing because the variables arising in the offered differential system are subject to many limitations of a physical and practical essence. The method of residues has been used when computing the Melnikov integrals. For sufficiently big numbers of the variables of the models, some obstacles (of a consumer essence) arise when computing the Melnikov integrals through famous and widely used CASs. We recall some of them (for more detail, see [21]): “We have to indicate that the computation of homoclinic and heteroclinic Melnikov integrals as well as the relevant standard for the chaos arising in the dynamical model are problematic tasks of users (who are not necessarily professional mathematicians) of CAS for reliable computations. For example, computation of the above integrals (for big values of the variables of the models) with the modules provided for the purpose in the relevant program environment, a computer environment dialog arises (behind a large time interval) of the kind: “No enough memory available”, or “SystemException[MemoryAllocationFailure, …]” which is embarrassed as situation for the unfamiliar with these arising problems consumer.” We point out that the user can undertake an effortful search for an alternative to select for the obligatory domain in the present detached unit (as an example in CAS Mathematica) for computing the already-quoted Melnikov’s integrals. Ordinarily, this demand is connected to the enforced restriction (for the class of dynamical systems) of the | I m ( ω ) | C o n s t kind. The improving of the web-based application, planned by us, envisages the usage of computational procedures (which are hidden to the consumer) to circumscribe the boundaries of the constraint cited above. We show one illustration connected to exploring the dynamics of the offered differential systems. Clearly, the consumer can make several simplifications in Equation (20), or (15). Admittedly, the problem becomes the following: why was the existent HarmonicNumber[n] function (in the specific computational framework) not utilized (by the environment without user participation) to receive a concise result. The illustrations we can give are various and numerous. This requires improvements in the vocational training of the actual professional units.
Other algorithms (hidden to the user) used in this article are as follows: (i) the arbitrary values of the parameters of the model given by the costumer—the producing of the expanded oscillator; (ii) specific computational procedures for comprehensive Hamiltonian research of differential systems and picturing the “level curves” (supposing the realization of software facilities in a user-chosen CAS for reliable computations); (iii) an algorithm for picking out the starting approximations when searching for a solution to the differential systems, which states its intriguing peculiarity and demeanor of the solution in confidential time intervals; (iv) numerical algorithms for solving the nonlinear equation, M ( t 0 ) = 0 [33,34,35]—in several cases (when chaos is produced in dynamical models), M ( t ) is a polynomial and this necessitates the use of specialized algorithms to simultaneously find of all zeros [36,37,38,39,40,41]; (v) algorithms for generating the Melnikov functions of a higher type for analyzing the homo/heteroclinic bifurcation in mechanical systems; (vi) algorithms for generating bifurcation diagrams; (vii) algorithms for generating chaos in non-self-governmental model. Several of these computational procedures have been build on the basis of famous traditional and newer investigations [42,43,44,45,46,47,48,49,50]. These units are enhancing the analogous ones that are implemented in CASs that are scheduled for scientific computations. The presented units are a part of the wider plan for researching nonlinear differential systems. We are deploying scalable cloud software tools through server-free architectures [51]. Server-free architectures enable the auto-scaling of the software system when the load is higher. Furthermore, these can be used for the simultaneous performance of proper computational processes in pursuit of the best performance. Where this can be implemented, we engage many optimizing tools for high-precision computations, involving multi-processor and multi-threading computations; moreover, hardware-specific software improvements can be made [52,53,54]. The software framework is presented alongside the realized computational procedures through regular APIs with REST and HTTP, with data serialization using XML and JSON formats. The API can be utilized by reporting and analytic software systems such as Excel and PowerBI to study the outcomes further [55]. For more details, see [24].
The research can pursue the following avenues for test theory and e-learning: developmental evolution to e-learning from CBT [56], studying ambiance [57], DeLC study e-portal [58], Virtual Educational Space [59], and production of exam issues [60].
We define the hypothetical normalized antenna factor, as follows:
M * ( θ ) = 1 D | M ( K cos θ + k 1 ) |
where
-
θ is the azimuth angle;
-
K = k d ; k = 2 π λ ; λ is the wave length; d is the distance between emitters;
-
k 1 is the phase difference.
A typical antenna factor for (1) is A = 0.13 ; ω = 0.6 ; g 1 = 0.09 ; g 2 = 0.05 ; K = 5 ; k 1 = 3.1 and for (2) it is A = 0.129 ; ω = 0.6 ; g 1 = 0.06 ; g 2 = 0.054 ; K = 4.65 ; k 1 = 1.882 (from Proposition 2). These are depicted in Figure 17.
Let us now focus on M ( t ) from Proposition 4. Following the classical Dolph–Chebyshev, Gegenbauer, and Soltis antenna arrays, we will call M ( θ ) the Melnikov antenna array. For fixed A = 0.0001 ; ω = 0.2 ; g 1 = 0.005 ; K = 9 ; k 1 = 0.01 , see Figure 18.
Of course, after serious consideration from specialists working in this scientific field, the hypothetical Melnikov array proposed by us can be seen as a supplementation to the array antenna theory.
In our application, we also use a computational procedure for the oversight and depiction of the antenna factor (with an appropriate user-chosen magnitude for sideways radiation). This is based on the research presented in [27,61].
Based on the theoretical results presented in Section 4, we envisage an inclusion of this in our web-based application of specialized algorithms for controlling the oscillations caused by the new probability-based constructions. Regarding other options for control, see [21].
At this stage, the web-based application is the intellectual property of the authors. Early next year, the multilayered architecture will be published with all its connections, attributes, and functionalities—calculation timing, graphics refinement, built-in computing mechanisms, and more.
We are on schedule in our process, such that the design of similar large-scale web-based applications for research computations can be implemented thanks to the substantial efforts of professionals in many research fields.

Author Contributions

Conceptualization, N.K. and V.K.; methodology, T.Z. and V.K.; software, V.K., A.I. and A.R.; validation, N.K., A.R., T.Z. and V.K.; formal analysis, V.K. and N.K.; investigation, A.I., T.Z., A.R. and N.K.; resources, A.R., T.Z., V.K. and N.K.; data curation, N.K. and A.I.; writing—original draft preparation, V.K., A.I. and A.R.; writing—review and editing, N.K. and T.Z.; visualization, V.K.; supervision, N.K. and T.Z.; project administration, N.K.; and funding acquisition, A.R., T.Z., N.K. and A.I. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Acknowledgments

The first, third, fourth, and fifth authors are supported by the European Union—NextGenerationEU—through the National Plan for Recovery and Resilience of the Republic Bulgaria, project No BG-RRP-2.004-0001-C01. The second author was financed by the European Union—NextGenerationEU—through the National Recovery and Resilience Plan of the Republic of Bulgaria, project No BG-RRP-2.004-0008.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Sanjuan, M. The effect of nonlinear damping on the universal oscillator. Int. J. Bifurc. Chaos 1999, 9, 735–744. [Google Scholar] [CrossRef]
  2. Soliman, M.S.; Thompson, J.M.T. The effect of nonlinear damping on the steady state and basin bifurcation patterns of a nonlinear mechanical oscillator. Int. J. Bifurc. Chaos 1992, 2, 81–91. [Google Scholar] [CrossRef]
  3. Fangnon, R.; Ainamon, C.; Monwanou, A.V.; Mowadinou, C.H.; Orpu, J.B. Nonlinear dynamics of the quadratic damping Helmholtz oscillator. Complexity 2020, 2020, 8822534. [Google Scholar] [CrossRef]
  4. Bikdash, M.; Balachandran, B.; Nayfeh, A. Melnikov analysis for a ship with a general roll-damping model. Nonlinear Dyn. 1994, 6, 101–124. [Google Scholar] [CrossRef]
  5. Ravindra, B.; Mallik, A.K. Stability analysis of a non–linearly clamped Duffing oscillator. J. Sound Vib. 1999, 171, 708–716. [Google Scholar] [CrossRef]
  6. Ravindra, B.; Mallik, A.K. Role of nonlinear dissipation in soft Duffing oscillators. Phys. Rev. E 1984, 49, 4950–4954. [Google Scholar] [CrossRef]
  7. Sanjuan, M. Monoclinic bifurcation sets of driven nonlinear oscillators. Int. J. Theor. Phys. 1996, 35, 1745–1752. [Google Scholar] [CrossRef]
  8. Guckenheimer, J.; Holmes, P. Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields; Springer: New York, NY, USA, 1983. [Google Scholar]
  9. Perko, L. Differential Equations and Dynamical Systems; Springer: New York, NY, USA, 1991. [Google Scholar]
  10. Holmes, P.; Marsden, J. Horseshoes in perturbation of Hamiltonian systems with two degrees of freedom. Comm. Math. Phys. 1982, 82, 523–544. [Google Scholar] [CrossRef]
  11. Holmes, P.; Marsden, J. A partial differential equation with infinitely many periodic orbits: Chaotic oscillations. Arch. Ration. Mech. Anal. 1981, 76, 135–165. [Google Scholar] [CrossRef]
  12. Francescatto, A.; Contento, G. Bifurcations in ship rolling: Experimental results and parameter identification technique. Ocean Eng. 1999, 26, 1095–1123. [Google Scholar] [CrossRef]
  13. Tang, K.; Man, K.; Zhong, G.; Chen, G. Generating chaos via x|x|. IEEE Trans. Circuit Syst. Fundam. Theory Appl. 2001, 48, 636–640. [Google Scholar] [CrossRef]
  14. Tricomi, F. Integratione di un’ equazione differenziale presentatasi in elettrotecnica. Ann. Della Sc. Norm. Super. Pisa 1933, 2, 1–20. [Google Scholar]
  15. Stoker, J. Nonlinear Vibration in Mechanical and Electrical Systems; Interscience: New York, NY, USA, 1950. [Google Scholar]
  16. Levi, M.; Hoppensteadt, F.; Miranker, W. Dynamics of the Josephson junction. Quart. Appl. Math. 1978, 35, 167–198. [Google Scholar] [CrossRef]
  17. Siewe, M.; Kakmeni, F.; Tchawoua, C. Resonant oscillation and homoclinic bifurcation in ϕ6—Van der Pol oscillator. Chaos Solut. Fractals 2004, 21, 841–853. [Google Scholar] [CrossRef]
  18. Yu, J.; Li, J. Investigation on dynamics of the extended Duffing—Van der Pol system. Z. Fur Naturforschung 2009, 64, 341–346. [Google Scholar] [CrossRef]
  19. Siewe, M.; Tchawoua, C.; Rajasekar, S. Homoclinic bifurcation and chaos in ϕ6 Rayleigh oscillator with three wells driven by an amplitude modulated force. Int. J. Bifurc. Chaos 2011, 21, 1583–1593. [Google Scholar] [CrossRef]
  20. Kyurkchiev, N.; Zaevski, T. On a hypothetical oscillator: Investigations in the light of Melnikov’s approach, some simulations. Int. J. Differ. Equ. Appl. 2023, 22, 67–79. [Google Scholar]
  21. Kyurkchiev, N.; Zaevski, T.; Iliev, A.; Kyurkchiev, V.; Rahnev, A. Nonlinear dynamics of a new class of micro-electromechanical oscillators—Open problems. Symmetry 2024, 16, 253. [Google Scholar] [CrossRef]
  22. Golev, A.; Terzieva, T.; Iliev, A.; Rahnev, A.; Kyurkchiev, N. Simulation on a generalized oscillator model: Applications, Web-based application. Comptes Rendus l’Académie Bulg. Des Sci. 2024, 77, 230–237. [Google Scholar] [CrossRef]
  23. Melnikov, V.K. On the stability of a center for time—Periodic perturbation. Trans. Mosc. Math. Soc. 1963, 12, 3–52. [Google Scholar]
  24. Kyurkchiev, V.; Iliev, A.; Rahnev, A.; Kyurkchiev, N. On a class of orthogonal polynomials as corrections in Lienard differential system. Applications. Algorithms 2023, 16, 297. [Google Scholar] [CrossRef]
  25. Kyurkchiev, N.; Iliev, A. On the hypothetical oscillator model with second kind Chebyshev’s polynomial—Correction: Number and type of limit cycles, simulations and possible applications. Algorithms 2022, 15, 462. [Google Scholar] [CrossRef]
  26. Abramowicz, A.; Stegun, I. Handbook of Mathematical Functions; Dover: New York, NY, USA, 1970. [Google Scholar]
  27. Kyurkchiev, N.; Andreev, A. Approximation and Antenna and Filter Synthesis: Some Moduli in Programming Environment Mathematica; LAP Lambert Academic Publishing: Saarbrucken, Germany, 2014; ISBN 978-3-859-53322-8. [Google Scholar]
  28. Crandall, S. Non–Gaussian closure for random vibration of non-linear oscillators. Int. J. Non-Linear Mech. 1980, 15, 303–313. [Google Scholar] [CrossRef]
  29. Sobczyk, K.; Trebicki, J. Maximum entropy principle and nonlinear stochastic oscillators. Phys. A Stat. Mech. Its Appl. 1993, 193, 448–468. [Google Scholar] [CrossRef]
  30. Wang, K.; Masoliver, J. Linear oscillators driven by Gaussian colored noise: Crossovers and probability distributions. Phys. A Stat. Mech. Its Appl. 1996, 231, 615–630. [Google Scholar] [CrossRef]
  31. Er, G.; Zhu, T.; Iu, V.; Kou, K. Probabilistic Solution of Nonlinear Oscillators Under External and Parametric Poisson Impulses. AIAA J. 2008, 46, 2839–2847. [Google Scholar] [CrossRef]
  32. Monga, B.; Moehlis, J. Phase distribution control of a population of oscillators. Phys. D Nonlinear Phenom. 2019, 398, 115–129. [Google Scholar] [CrossRef]
  33. Thangkhenpau, G.; Panday, S.; Bolunduet, L.C.; Jantschi, L. Efficient Families of Multi-Point Iterative Methods and Their Self-Acceleration with Memory for Solving Nonlinear Equations. Symmetry 2023, 15, 1546. [Google Scholar] [CrossRef]
  34. Akram, S.; Khalid, M.; Junjua, M.-U.-D.; Altaf, S.; Kumar, S. Extension of King’s Iterative Scheme by Means of Memory for Nonlinear Equations. Symmetry 2023, 15, 1116. [Google Scholar] [CrossRef]
  35. Cordero, A.; Janjua, M.; Torregrosa, J.R.; Yasmin, N.; Zafar, F. Efficient four parametric with and without-memory iterative methods possessing high efficiency indices. Math. Probl. Eng. 2018, 2018, 8093673. [Google Scholar] [CrossRef]
  36. Proinov, P.; Vasileva, M. On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously. J. Inequalities Appl. 2015, 2015, 336. [Google Scholar] [CrossRef]
  37. Proinov, P.D.; Vasileva, M.T. Local and Semilocal Convergence of Nourein’s Iterative Method for Finding All Zeros of a Polynomial Simultaneously. Symmetry 2020, 12, 1801. [Google Scholar] [CrossRef]
  38. Proinov, P.D.; Vasileva, M.T. On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros. Appl. Math. Comput. 2019, 361, 202–214. [Google Scholar] [CrossRef]
  39. Proinov, P.; Ivanov, S. On the convergence of Halley’s method for simultaneous computation of polynomial zeros. J. Numer. Math. 2015, 23, 379–394. [Google Scholar] [CrossRef]
  40. Ivanov, S.I. Families of high-order simultaneous methods with several corrections. Numer. Algor. 2024. [Google Scholar] [CrossRef]
  41. Kyncheva, V.; Yotov, V.; Ivanov, S. Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple zeros. Appl. Numer. Math. 2017, 112, 146–154. [Google Scholar] [CrossRef]
  42. Lenci, S.; Lupini, R. Homoclinic and heteroclinic solutions for a class of two-dimensional Hamiltonian systems. Z. Angew. Math. Phys. 1996, 47, 97–111. [Google Scholar] [CrossRef]
  43. Lenci, S.; Rega, G. Controlling nonlinear dynamics in a two-well impact system. I. Attractors and bifurcation scenario under symmetric excitations. Int. J. Bifur. Chaos Appl. Sci. Eng. 1998, 8, 2387–2407. [Google Scholar] [CrossRef]
  44. Lenci, S.; Rega, G. Controlling nonlinear dynamics in a two-well impact system. II. Attractors and bifurcation scenario under unsymmetric optimal excitation. Int. J. Bifur. Chaos Appl. Sci. Eng. 1998, 8, 2409–2424. [Google Scholar] [CrossRef]
  45. Lenci, S.; Rega, G. Higher-order Melnikov analysis of homo/heteroclinic bifurcations in mechanical oscillators. In Proceedings of the 16th AIMETA Congress of Theoretical and Applied Mechanics, Ferrara, Italy, 9–12 September 2003. [Google Scholar]
  46. Lenci, S.; Rega, G. Optimal control of homoclinic bifurcation: Theoretical treatment and practical reduction of safe basin erosion in the Helmholtz oscillator. J. Vib. Control 2003, 9, 281–315. [Google Scholar] [CrossRef]
  47. Rega, G.; Lenci, S. Bifurcations and chaos in single-d.o.f. mechanical systems: Exploiting nonlinear dynamics properties for their control. In Recent Research Developments in Structural Dynamics; Luongo, A., Ed.; Research Signpost: Kerala, India, 2003; pp. 331–369. [Google Scholar]
  48. Soto-Trevino, C.; Kaper, T.J. Higher-order Melnikov theory for adiabatic systems. J. Math. Phys. 1996, 37, 6220–6249. [Google Scholar] [CrossRef]
  49. Gavrilov, L.; Iliev, I. The limit cycles in a generalized Rayleigh–Lienard oscillator. Discret. Contin. Dyn. Syst. 2023, 43, 2381–2400. [Google Scholar] [CrossRef]
  50. Thompson, M.T.; Stewart, H.B. Nonlinear Dynamics and Chaos, 2nd ed.; John Wiley & Sons: Chichester, UK, 2002. [Google Scholar]
  51. Rahneva, O.; Pavlov, N. Distributed Systems and Applications in Learning; Plovdiv University Press: Plovdiv, Bulgaria, 2021. [Google Scholar]
  52. Pavlov, N. Efficient Matrix Multiplication Using Hardware Intrinsics and Parallelism with C#. Int. J. Differ. Equ. Appl. 2021, 20, 217–223. [Google Scholar]
  53. Duffy, J. Concurrent Programming on Windows; Addison Wesley: Boston, MA, USA, 2009. [Google Scholar]
  54. Miller, W. Computational Complexity and Numerical Stability. SIAM J. Comput. 1975, 4, 97–107. [Google Scholar] [CrossRef]
  55. Mateev, M. Creating Modern Data Lake Automated Workloads for Big Environmental Projects. In Proceedings of the 18th Annual International Conference on Information Technology & Computer Science, Athens, Greece, 9 September 2022. [Google Scholar]
  56. Stoyanov, S.; Popchev, I. Evolutionary development of an infrastructure supporting the transition from CBT to e-Learning. Cybern. Inf. Technol. 2006, 6, 101–114. [Google Scholar]
  57. Sandalski, M.; Stoyanova-Doycheva, A.; Popchev, I.; Stoyanov, S. Development of a Refactoring Learning Environment. Cybern. Inf. Technol. 2011, 11, 46–64. [Google Scholar]
  58. Stoyanov, S.; Popchev, I.; Doychev, E.; Mitev, D.; Valkanov, V.; Stoyanova-Doycheva, A.; Valkanova, V.; Minov, I. DeLC Educational Portal. Cybern. Inf. Technol. 2010, 10, 49–69. [Google Scholar]
  59. Glushkova, T.; Stoyanov, S.; Popchev, I.; Cheresharov, S. Ambient-oriented Modelling in a Virtual Educational Space. Comptes Rendus l’Académie Bulg. Des Sci. 2018, 71, 398–406. [Google Scholar]
  60. Stancheva, N.; Stoyanova-Doycheva, A.; Stoyanov, S.; Popchev, I.; Ivanova, V. A Model for Generation of Test Questions. Comptes Rendus l’Académie Bulg. Des Sci. 2017, 70, 619–630. [Google Scholar]
  61. Apostolov, P. An Addition to Binomial Array Antenna Theory. Prog. Electromagn. Res. Lett. 2023, 113, 113–117. [Google Scholar] [CrossRef]
Figure 1. The homo/heteroclinic orbits for b = 0.4 , b 1 = 0.7 , b 0 = 0.1 [21].
Figure 1. The homo/heteroclinic orbits for b = 0.4 , b 1 = 0.7 , b 0 = 0.1 [21].
Algorithms 17 00121 g001
Figure 2. (a) The solutions of the differential system; (b) y–time series; (c) phase space (Example 1).
Figure 2. (a) The solutions of the differential system; (b) y–time series; (c) phase space (Example 1).
Algorithms 17 00121 g002
Figure 3. (a) The solutions of the differential system; (b) y–time series; (c) phase space; (Example 2).
Figure 3. (a) The solutions of the differential system; (b) y–time series; (c) phase space; (Example 2).
Algorithms 17 00121 g003
Figure 4. (a) The solutions of the differential system; (b) x–time series; (c) y–time series; (d) phase space; (Example 3).
Figure 4. (a) The solutions of the differential system; (b) x–time series; (c) y–time series; (d) phase space; (Example 3).
Algorithms 17 00121 g004
Figure 5. (a) The solutions of the differential system; (b) x–time series; (c) y–time series; (d) phase space; (Example 4).
Figure 5. (a) The solutions of the differential system; (b) x–time series; (c) y–time series; (d) phase space; (Example 4).
Algorithms 17 00121 g005
Figure 6. Double homoclinic orbit [20].
Figure 6. Double homoclinic orbit [20].
Algorithms 17 00121 g006
Figure 7. The equation M ( t 0 ) = 0 (Proposition 1): (a) p = 2 ; N = 1 ; A = 1.01 ; ω = 0.25 ; g 1 = 0.9 ; (b) p = 2 ; N = 1 ; A = 1.05 ; ω = 0.1 ; g 1 = 0.916 .
Figure 7. The equation M ( t 0 ) = 0 (Proposition 1): (a) p = 2 ; N = 1 ; A = 1.01 ; ω = 0.25 ; g 1 = 0.9 ; (b) p = 2 ; N = 1 ; A = 1.05 ; ω = 0.1 ; g 1 = 0.916 .
Algorithms 17 00121 g007
Figure 8. The equation M ( t 0 ) = 0 (Proposition 2): (a) p = 2 ; N = 2 ; A = 1.01 ; ω = 0.4 ; g 1 = 0.4 ; g 2 = 0.95 ; (b) p = 2 ; N = 2 ; A = 0.6 ; ω = 0.6 ; g 1 = 0.09 ; g 2 = 0.05 .
Figure 8. The equation M ( t 0 ) = 0 (Proposition 2): (a) p = 2 ; N = 2 ; A = 1.01 ; ω = 0.4 ; g 1 = 0.4 ; g 2 = 0.95 ; (b) p = 2 ; N = 2 ; A = 0.6 ; ω = 0.6 ; g 1 = 0.09 ; g 2 = 0.05 .
Algorithms 17 00121 g008
Figure 9. The equation M ( t 0 ) = 0 (Proposition 3): (a) p = 2 ; N = 3 ; A = 1.01 ; ω = 0.34 ; g 1 = 0.5 ; g 2 = 0.95 ; g 3 = 0.8 ; (b) p = 2 ; N = 3 ; A = 0.1 ; ω = 0.9 ; g 1 = 0.01 ; g 2 = 0.02 ; g 3 = 0.015 .
Figure 9. The equation M ( t 0 ) = 0 (Proposition 3): (a) p = 2 ; N = 3 ; A = 1.01 ; ω = 0.34 ; g 1 = 0.5 ; g 2 = 0.95 ; g 3 = 0.8 ; (b) p = 2 ; N = 3 ; A = 0.1 ; ω = 0.9 ; g 1 = 0.01 ; g 2 = 0.02 ; g 3 = 0.015 .
Algorithms 17 00121 g009
Figure 10. Melnikov functions M ( t ) as a typical diagrams (in confidential intervals): (a) case I; (b) case II.
Figure 10. Melnikov functions M ( t ) as a typical diagrams (in confidential intervals): (a) case I; (b) case II.
Algorithms 17 00121 g010
Figure 11. The orbits ( x 0 ( t ) , y 0 ( t ) ) (thick) and energy potential (red).
Figure 11. The orbits ( x 0 ( t ) , y 0 ( t ) ) (thick) and energy potential (red).
Algorithms 17 00121 g011
Figure 12. (a) The solutions of the system; (b) x–time series; (c) y–time series; (d) phase space (Example 5).
Figure 12. (a) The solutions of the system; (b) x–time series; (c) y–time series; (d) phase space (Example 5).
Algorithms 17 00121 g012
Figure 13. (a) The solutions of the system; (b) x–time series; (c) y–time series; (d) phase space (Example 6).
Figure 13. (a) The solutions of the system; (b) x–time series; (c) y–time series; (d) phase space (Example 6).
Algorithms 17 00121 g013
Figure 14. (a) The solutions of the system; (b) x–time series; (c) y–time series; (d) phase space (Example 7).
Figure 14. (a) The solutions of the system; (b) x–time series; (c) y–time series; (d) phase space (Example 7).
Algorithms 17 00121 g014
Figure 15. (a) The solutions of the system; (b) x–time series; (c) y–time series; (d) phase space (Example 8).
Figure 15. (a) The solutions of the system; (b) x–time series; (c) y–time series; (d) phase space (Example 8).
Algorithms 17 00121 g015
Figure 16. (a) The equation M ( t 0 ) = 0 ; (b) the root t 0 = 14.1305 in interval ( 0 , 20 ) (Proposition 4).
Figure 16. (a) The equation M ( t 0 ) = 0 ; (b) the root t 0 = 14.1305 in interval ( 0 , 20 ) (Proposition 4).
Algorithms 17 00121 g016
Figure 17. A typical antenna factor: (a) case (1); (b) case (2).
Figure 17. A typical antenna factor: (a) case (1); (b) case (2).
Algorithms 17 00121 g017
Figure 18. A typical Melnikov antenna array.
Figure 18. A typical Melnikov antenna array.
Algorithms 17 00121 g018
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Kyurkchiev, N.; Zaevski, T.; Iliev, A.; Kyurkchiev, V.; Rahnev, A. Modeling of Some Classes of Extended Oscillators: Simulations, Algorithms, Generating Chaos, and Open Problems. Algorithms 2024, 17, 121. https://doi.org/10.3390/a17030121

AMA Style

Kyurkchiev N, Zaevski T, Iliev A, Kyurkchiev V, Rahnev A. Modeling of Some Classes of Extended Oscillators: Simulations, Algorithms, Generating Chaos, and Open Problems. Algorithms. 2024; 17(3):121. https://doi.org/10.3390/a17030121

Chicago/Turabian Style

Kyurkchiev, Nikolay, Tsvetelin Zaevski, Anton Iliev, Vesselin Kyurkchiev, and Asen Rahnev. 2024. "Modeling of Some Classes of Extended Oscillators: Simulations, Algorithms, Generating Chaos, and Open Problems" Algorithms 17, no. 3: 121. https://doi.org/10.3390/a17030121

APA Style

Kyurkchiev, N., Zaevski, T., Iliev, A., Kyurkchiev, V., & Rahnev, A. (2024). Modeling of Some Classes of Extended Oscillators: Simulations, Algorithms, Generating Chaos, and Open Problems. Algorithms, 17(3), 121. https://doi.org/10.3390/a17030121

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop