2016
DOI: 10.1007/s10884-016-9547-1
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic Behaviour of Coupled Systems in Discrete and Continuous Time

Abstract: Abstract. This paper investigates the asymptotic behaviour of solutions to certain infinite systems of coupled recurrence relations. In particular, we obtain a characterisation of those initial values which lead to a convergent solution, and for initial values satisfying a slightly stronger condition we obtain an optimal estimate on the rate of convergence. By establishing a connection with a related problem in continuous time, we are able to use this optimal estimate to improve the rate of convergence in the … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…When (4.3) holds we call φ the characteristic function of our system. The class of coupled systems possessing a characteristic function was first studied in [68], with further developments in [69,71]. We let 1 ≤ p ≤ ∞ and rewrite the system (4.4) in the form of an abstract Cauchy problem,…”
Section: Infinite Systems or Coupled Ordinary Differential Equationsmentioning
confidence: 99%
“…When (4.3) holds we call φ the characteristic function of our system. The class of coupled systems possessing a characteristic function was first studied in [68], with further developments in [69,71]. We let 1 ≤ p ≤ ∞ and rewrite the system (4.4) in the form of an abstract Cauchy problem,…”
Section: Infinite Systems or Coupled Ordinary Differential Equationsmentioning
confidence: 99%
“…This time, however, the estimates are less straightforward and moreover [11,Theorem 5.1] involves a logarithmic term in the estimate for the rate of convergence which was conjectured in [11, Remark 5.2(a)] to be unnecessary. It is shown in our recent paper [10] how the argument outlined in the proof of Theorem 3.1 above can be extended to the more general setting of [11], thus in particular removing the logarithm in the platoon model.…”
Section: Further Extensionsmentioning
confidence: 99%
“…Both authors were at least partially motivated by concrete applications, which in Nevanlinna's case come from the theory of iterative methods, in Dungey's from the theory of random walks and Markov processes which had inspired the original discovery of Theorem 1.1; see [12,13,15] and also [9,10]. Other applications arise for instance in the theory of alternating projections [1,2], the study of certain periodic evolution equations [28] and even in investigations of infinite systems of coupled ordinary differential equations [27]. Surveys touching on various aspects of the Katznelson-Tzafriri theorem and its quantified versions may be found in [8,21].…”
Section: Introductionmentioning
confidence: 99%