2007
DOI: 10.1016/j.sysconle.2007.04.003
|View full text |Cite
|
Sign up to set email alerts
|

A Popov criterion for networked systems

Abstract: We consider robustness analysis of heterogeneous and homogeneous networked systems based on integral quadratic constraints (IQCs). First, we show how the analysis decomposes into lower dimensional problems if the interconnection structure is exploited. This generally leads to a significant reduction of the computational complexity. Secondly, by considering a set of IQCs that characterizes the eigenvalues of the interconnection matrices of symmetrically networked systems, we derive a Popov-like criterion for su… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
18
0

Year Published

2007
2007
2014
2014

Publication Types

Select...
5
3
2

Relationship

1
9

Authors

Journals

citations
Cited by 31 publications
(19 citation statements)
references
References 15 publications
(17 reference statements)
1
18
0
Order By: Relevance
“…The result is proven in the same way as the corresponding result in [8] and the result is also related to earlier contributions in [4], [5].…”
Section: A Scalable Stability Resultssupporting
confidence: 79%
“…The result is proven in the same way as the corresponding result in [8] and the result is also related to earlier contributions in [4], [5].…”
Section: A Scalable Stability Resultssupporting
confidence: 79%
“…In the case where , Nyquist curve of must have a zero net encirclement of the points . The normality assumption on the interconnection matrix can in this case be removed by using a reasoning along the lines of Proposition 2 of [7]. Example 6: Let us illustrate Theorem 2 by applying it to the system considered in Example 1.…”
Section: Relaxed Stability Criterionmentioning
confidence: 99%
“…Notice that the dimension of the left-hand-side of (4) is nm × nm, while it is m × m in the case of (5) (and there are n such inequalities). Hence the computational complexity of verifying condition (5) grows linearly in n (after finding all eigenvalues ofΓ, which has complexity O(n 3 )), while the complexity of verifying condition (4) in general grows as O(n β ), where β is between 4.5 to 6.5, see [7].…”
Section: A Diagonalizable Interconnectionmentioning
confidence: 99%