A NEW CLASS OF CHAOTIC SIMPLE THREE-NEURON CELLULAR NEURAL NETWORKS

2006 ◽  
Vol 16 (04) ◽  
pp. 1019-1021 ◽  
Author(s):  
XIAO-SONG YANG ◽  
YAN HUANG

In this letter we report a new class of chaotic three-neuron cellular neural networks that are described by special three-dimensional autonomous ordinary differential equations.

2006 ◽  
Vol 16 (09) ◽  
pp. 2729-2736 ◽  
Author(s):  
XIAO-SONG YANG ◽  
YAN HUANG

This paper presents a new class of chaotic and hyperchaotic low dimensional cellular neural networks modeled by ordinary differential equations with some simple connection matrices. The chaoticity of these neural networks is indicated by positive Lyapunov exponents calculated by a computer.


Author(s):  
Jean Chamberlain Chedjou ◽  
Kyandoghere Kyamakya

This paper develops and validates through a series of presentable examples, a comprehensive high-precision, and ultrafast computing concept for solving nonlinear ordinary differential equations (ODEs) and partial differential equations (PDEs) with cellular neural networks (CNN). The core of this concept is a straightforward scheme that we call "nonlinear adaptive optimization (NAOP),” which is used for a precise template calculation for solving nonlinear ODEs and PDEs through CNN processors. One of the key contributions of this work is to demonstrate the possibility of transforming different types of nonlinearities displayed by various classical and well-known nonlinear equations (e.g., van der Pol-, Rayleigh-, Duffing-, Rössler-, Lorenz-, and Jerk-equations, just to name a few) unto first-order CNN elementary cells, and thereby enabling the easy derivation of corresponding CNN templates. Furthermore, in the case of PDE solving, the same concept also allows a mapping unto first-order CNN cells while considering one or even more nonlinear terms of the Taylor's series expansion generally used in the transformation of a PDE in a set of coupled nonlinear ODEs. Therefore, the concept of this paper does significantly contribute to the consolidation of CNN as a universal and ultrafast solver of nonlinear ODEs and/or PDEs. This clearly enables a CNN-based, real-time, ultraprecise, and low-cost computational engineering. As proof of concept, two examples of well-known ODEs are considered namely a second-order linear ODE and a second order nonlinear ODE of the van der Pol type. For each of these ODEs, the corresponding precise CNN templates are derived and are used to deduce the expected solutions. An implementation of the concept developed is possible even on embedded digital platforms (e.g., field programmable gate array (FPGA), digital signal processor (DSP), graphics processing unit (GPU), etc.). This opens a broad range of applications. Ongoing works (as outlook) are using NAOP for deriving precise templates for a selected set of practically interesting ODEs and PDEs equation models such as Lorenz-, Rössler-, Navier Stokes-, Schrödinger-, Maxwell-, etc.


2007 ◽  
Vol 10 (04) ◽  
pp. 449-461 ◽  
Author(s):  
XIAO-SONG YANG ◽  
QUAN YUAN ◽  
LIN WANG

In this paper, we are concerned with two interesting problems in the dynamics of neural networks. What connection topology will prohibit chaotic behavior in a continuous time neural network (NN). To what extent is a continuous time neural network (NN) described by continuous ordinary differential equations simple enough yet still able to exhibit chaos? We study these problems in the context of the classical neural networks with three neurons, which can be described by three-dimensional autonomous ordinary differential equations. We first consider the case where there is no direct interconnection between the first neuron and the third neuron. We then discuss the case where each pair of neurons has a direct connection. We show that the existence of the directed loop in connection topology is necessary for chaos to occur.


Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 174
Author(s):  
Janez Urevc ◽  
Miroslav Halilovič

In this paper, a new class of Runge–Kutta-type collocation methods for the numerical integration of ordinary differential equations (ODEs) is presented. Its derivation is based on the integral form of the differential equation. The approach enables enhancing the accuracy of the established collocation Runge–Kutta methods while retaining the same number of stages. We demonstrate that, with the proposed approach, the Gauss–Legendre and Lobatto IIIA methods can be derived and that their accuracy can be improved for the same number of method coefficients. We expressed the methods in the form of tables similar to Butcher tableaus. The performance of the new methods is investigated on some well-known stiff, oscillatory, and nonlinear ODEs from the literature.


Sign in / Sign up

Export Citation Format

Share Document