All solutions of a class of discrete-time systems are eventually periodic (Q702563): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2003.09.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078532851 / rank
 
Normal rank

Revision as of 22:57, 19 March 2024

scientific article
Language Label Description Also known as
English
All solutions of a class of discrete-time systems are eventually periodic
scientific article

    Statements

    All solutions of a class of discrete-time systems are eventually periodic (English)
    0 references
    17 January 2005
    0 references
    This paper is devoted to the proof of the following fact: any couple \((x(\cdot),y(\cdot))\) solution of \[ x(n)=x(n-1)+ag(x(n-k))+bg(y(n-k)), \quad n=1,2,\dots, \] \[ y(n)=y(n-1)-bg(x(n-k))+ag(y(n-k)), \quad n=1,2,\dots, \] is eventually periodic. Here \(k\) is a fixed positive integer, \(a,b\) are positive constants, and \(g\) is a decreasing step function (with one discontinuity point only and values \(1\) and \(-1\)). Such a discrete-time system may be regarded as an approximation of a model for two neurons with no internal decay.
    0 references
    discrete-time systems
    0 references
    periodic solutions
    0 references
    neural networks
    0 references
    step function
    0 references
    0 references
    0 references

    Identifiers