Global behavior of the difference equation \(x_{n + 1} = x_{n - 1} g(x_n)\) (Q1724778): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Convergence of solutions in a nonhyperbolic case. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics of a family of nonlinear delay difference equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global attractivity of a family of nonautonomous max-type difference equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic behavior of a difference equation with maximum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global stability of a max-type difference equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics of the max-type difference equation \({x_n=\max\{\frac{1}{x_{n-m}},\frac{A_n}{x_{n-r}}\}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On boundedness of solutions of the difference equation \(x_{n+1}=p+\frac{x_{n-1}}{x_{n}}\) for \(p<1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2735629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties in the nonhyperbolic case \(x_{n+1} = \frac {x_{n-1}}{1+f(x_{n})}\) / rank
 
Normal rank

Latest revision as of 05:26, 18 July 2024

scientific article
Language Label Description Also known as
English
Global behavior of the difference equation \(x_{n + 1} = x_{n - 1} g(x_n)\)
scientific article

    Statements

    Global behavior of the difference equation \(x_{n + 1} = x_{n - 1} g(x_n)\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    Summary: We consider the following difference equation \(x_{n + 1} = x_{n - 1} g(x_n)\), \(n = 0,1, \ldots\), where initial values \(x_{- 1}, x_0 \in [0, + \infty)\) and \(g : [0, + \infty) \rightarrow(0,1]\) is a strictly decreasing continuous surjective function. We show the following. (1) Every positive solution of this equation converges to \(a, 0, a, 0, \ldots\), or \(0, a, 0, a, \ldots\) for some \(a \in [0, + \infty)\). (2) Assume \(a \in(0, + \infty)\). Then the set of initial conditions \((x_{- 1}, x_0) \in(0, + \infty) \times(0, + \infty)\) such that the positive solutions of this equation converge to \(a, 0, a, 0, \ldots\), or \(0, a, 0, a, \ldots\) is a unique strictly increasing continuous function or an empty set.
    0 references

    Identifiers