2016
DOI: 10.20537/vm160402
|View full text |Cite
|
Sign up to set email alerts
|

Finite spectrum assignment problem in linear systems with state delay by static output feedback

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
8
0
3

Year Published

2018
2018
2020
2020

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 6 publications
(11 citation statements)
references
References 0 publications
0
8
0
3
Order By: Relevance
“…Taking into account that det G = 1 = 0, we see that the system (28) is resolvable with respect to u 0 (over K) for any pregiven γ i ∈ K, i = 1, n, iff condition (16) Remark 1. Let us show that Theorem 1 is a generalization of [29,Theorem 2]. Suppose that the system (1) has the form (5), i.e., the equalities (6), (7), (8) are fulfilled.…”
Section: Theoremmentioning
confidence: 99%
See 4 more Smart Citations
“…Taking into account that det G = 1 = 0, we see that the system (28) is resolvable with respect to u 0 (over K) for any pregiven γ i ∈ K, i = 1, n, iff condition (16) Remark 1. Let us show that Theorem 1 is a generalization of [29,Theorem 2]. Suppose that the system (1) has the form (5), i.e., the equalities (6), (7), (8) are fulfilled.…”
Section: Theoremmentioning
confidence: 99%
“…Suppose that the system (1) has the form (5), i.e., the equalities (6), (7), (8) are fulfilled. Suppose that the matrices of the system (5) (i.e., of the system (2.4) of [29]) have the form (1.6), (1.7), (2.5) of [29], that is the matrix A has the lower Hessenberg form with nonzero superdiagonal entries (i.e., the form (10)), the first p − 1 rows of the matrix B and the last n − p rows of the matrix C are equal to zero, and P j (j = 1, s) have the form (11). Then the matrices (6), (7) will satisfy the form (10), (11).…”
Section: Theoremmentioning
confidence: 99%
See 3 more Smart Citations