1976
DOI: 10.1080/00207177608922171
|View full text |Cite
|
Sign up to set email alerts
|

On the commutative class of linear time-varying systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
8
0

Year Published

1987
1987
2022
2022

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(8 citation statements)
references
References 2 publications
0
8
0
Order By: Relevance
“…For the time varying case, in general a computable expression of the transition state matrix <&(t,s) is not available, though there exist several classes of systems such that this matrix is computable in the same manner as the linear invariant systems. In accordance with Definition 2 given by Wu in [15] Proof. From Theorem 1, the only solution of a Cauchy problem for the differential equation of (1.1) is given by (2.3), where F = X(b).…”
Section: Explicit Solutionsmentioning
confidence: 63%
See 1 more Smart Citation
“…For the time varying case, in general a computable expression of the transition state matrix <&(t,s) is not available, though there exist several classes of systems such that this matrix is computable in the same manner as the linear invariant systems. In accordance with Definition 2 given by Wu in [15] Proof. From Theorem 1, the only solution of a Cauchy problem for the differential equation of (1.1) is given by (2.3), where F = X(b).…”
Section: Explicit Solutionsmentioning
confidence: 63%
“…, a set of m x m constant matrices {Mi}p i=l is said to be mutually commutative if and only if, M i M j = M j M i , for all i,j, such that Let us consider the time-varying Problem (1.1) and let us suppose that the matrix M(t) given by (2.1) can be written as (2.11) where M,'s are constant matrices and c ; (t)'s are linearly independent sets of scalar time functions extracted from elements of M(t), such that {Mi}f =l is mutually commutative, then the transition state matrix <t(t, s) of the linear system (2.7) can be computed by (D(t,b)=nexp(MA(£,fc)) (2.12) where bi(t,b)=\ci(s)ds (2.13) b and M,-'s and c,(s)'s are defined by (2.11).The following corollary is a consequence of Theorem 1 and Theorems 1 and 2 of[15].…”
mentioning
confidence: 92%
“…However, the matrices A(t), t ∈ R are in companion form and are not in general commutative (see also Proposition 4.18). For further insight into the commutativity of some matrices A(t) and t t 0 A(s)ds as well as A(s) and A(t), we refer to [32,Exercise 4.8] and [41].…”
Section: Remark 44 If A(s) and A(t) Commute Ie [A(s) A(t)]mentioning
confidence: 99%
“…In addition, it holds [A(t), A(s)] = 0 for all s, t ∈ R and τ ∈ T (see e.g. [33]). All eigenvalues of A(t) are real and strictly negative for a properly restricted T .…”
Section: Assumption (C7) For Eachmentioning
confidence: 99%
“…where V ϑ , Ỹ ϑ * (u),∆ and ε ϑ are defined as in Section 5.2. Note that L(ϑ) is closely related to the limiting function of the quasi maximum likelihood estimator from Section 5.2 such that Proposition 5.6 along with the inequalities in (33) ensure that W is continuous. Moreover, Proposition 5.11 ensures that W (ϑ) has a unique minimum.…”
mentioning
confidence: 99%