2001
DOI: 10.1007/s002110100270
|View full text |Cite
|
Sign up to set email alerts
|

Volterra discrete equations: summability of the fundamental matrix

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
17
0

Year Published

2004
2004
2017
2017

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 18 publications
(18 citation statements)
references
References 16 publications
1
17
0
Order By: Relevance
“…The following lemma (see also [8,19,35,36]) shows that the solution of (2.1) can be represented by using the fundamental matrix as well as by using the resolvent; compare…”
Section: Resolvent and Fundamental Matricesmentioning
confidence: 99%
See 2 more Smart Citations
“…The following lemma (see also [8,19,35,36]) shows that the solution of (2.1) can be represented by using the fundamental matrix as well as by using the resolvent; compare…”
Section: Resolvent and Fundamental Matricesmentioning
confidence: 99%
“…The resolvent R (n, m) for the kernel B (n + 1, m) = (I − B(n + 1, n + 1)) −1 B(n + 1, m) is defined (see, e.g., [17,36]) by…”
Section: Resolvent and Fundamental Matricesmentioning
confidence: 99%
See 1 more Smart Citation
“…Theorem 2.2 and Remark 2.2 will be useful to obtain sufficient condition that the zero solution of (1.1) is uniformly asymptotically stable (cf. [1][2][3][4][5]10,15,16,19,20]). Finally in this section, under the condition…”
Section: Remark 22 For the Linear Casementioning
confidence: 99%
“…Using the Liapunov technique, Crisci et al [1][2][3] and Vecchio [19,20] have analyzed the various stability of numerical methods. They are, for example, the first-order and some higher order backward differential formulas, and the implicit Euler methods without requiring the summability of the kernel.…”
Section: Introductionmentioning
confidence: 99%