2020
DOI: 10.1109/tac.2019.2958848
|View full text |Cite
|
Sign up to set email alerts
|

Convex Searches for Discrete-Time Zames–Falb Multipliers

Abstract: In this paper we develop and analyse convex searches for Zames-Falb multipliers. We present two different approaches: Infinite Impulse Response (IIR) and Finite Impulse Response (FIR) multipliers. The set of FIR multipliers is complete in that any IIR multipliers can be phase-substituted by an arbitrarily large order FIR multiplier. We show that searches in discrete-time for FIR multipliers are effective even for large orders. As expected, the numerical results provide the best 2stability results in the litera… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
56
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 34 publications
(56 citation statements)
references
References 62 publications
(121 reference statements)
0
56
0
Order By: Relevance
“…One may note that the discrete‐time results of Reference 19 however, may still appear to be conservative and, for some of the examples given in the article, the estimate of the maximum slope size is still some way short of that predicted by the Kalman conjecture. While it is not expected that the Kalman conjecture holds in all cases, one might expect better results in some of them.…”
Section: Introductionmentioning
confidence: 92%
See 4 more Smart Citations
“…One may note that the discrete‐time results of Reference 19 however, may still appear to be conservative and, for some of the examples given in the article, the estimate of the maximum slope size is still some way short of that predicted by the Kalman conjecture. While it is not expected that the Kalman conjecture holds in all cases, one might expect better results in some of them.…”
Section: Introductionmentioning
confidence: 92%
“…In some ways this article is therefore a companion paper to Reference 21 where the same was done for continuous‐time systems, but the methods used and some of the obstacles overcome differ in the discrete‐time case. The numerical results obtained are of variable competitiveness: sometimes rivaling the state‐of‐the‐art, 19 but sometimes yielding results some way from this.…”
Section: Introductionmentioning
confidence: 98%
See 3 more Smart Citations