zbMATH — the first resource for mathematics

Inclusion theorems for nonlinear difference equations with applications. (English) Zbl 1056.39003
The paper concerns real nonlinear difference equations of order \(m\geq 1\) \[ F(x_n, x_{n+1},\dots, x_{n+m})= 0,\tag{1} \] \(F: \mathbb{R}^{m+1}\to \mathbb{R}\), \(n\in\mathbb{N}_0\). It is assumed that \(F\) depends on \(n\) explicitly, but this is not indicated. The objective is to prove an inclusion theorem of the following kind: given a suitable pair of sequences \((\varphi_n)\), \((\psi_n)\) with \(\psi_n> 0\), then for arbitrary \(\varepsilon> 0\) there exists a solution \((x_n)\) of (1) and an \(n_0(\varepsilon)\) such that \[ \psi_n- \varepsilon\psi_n\leq x_n\leq \varphi_n+ \varepsilon\psi_n,\tag{2} \] for \(n\geq n_0(\varepsilon)\). It is always assumed that \(\phi_n= O(\varphi_n)\) as \(n\to\infty\) so that (2) implies \(x_n= \varphi_n+ O(\psi_n)\). The set of all sequences \((x_n)\) with (2) is called an asymptotic stripe \(X(\varepsilon)\), i.e. \((y_n)\in X(\varepsilon)\) implies the existence of a real sequence \((C_n)\) with \(y_n= \varphi_n+ C_n\psi_n\) and \(| C_n|\leq\varepsilon\) for \(n\geq n_0(\varepsilon)\).

39A10 Additive difference equations
39A11 Stability of difference equations (MSC2000)
39A12 Discrete version of topics in analysis
Full Text: DOI
[1] DOI: 10.1007/978-94-015-9171-3 · doi:10.1007/978-94-015-9171-3
[2] Berg L, Asymptotische Darstellungen und Entwicklungen (1968)
[3] DOI: 10.4171/ZAA/1127 · Zbl 1030.39006 · doi:10.4171/ZAA/1127
[4] DOI: 10.1016/S0898-1221(99)00310-7 · Zbl 0972.39002 · doi:10.1016/S0898-1221(99)00310-7
[5] Cabada A, J. Math. Appl. 267 pp 501– (2002)
[6] Dingle RB, Asymptotic Expansions: Their Derivation and Interpretation (1973)
[7] Kulenović MRS, Dynamics of Second Order Rational Difference Equations (2002)
[8] Pachpatte BG, Inequalities for Finite Difference Equations (2002)
[9] Schmidt JW, Beiträge Numer. Math. 5 pp 171– (1976)
[10] DOI: 10.1007/978-3-662-35247-2 · doi:10.1007/978-3-662-35247-2
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.