Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,062

The DOI matches its Crossref record.

Generalized KYP lemma: unified frequency domain inequalities with design applications

Iwasaki, T., Hara, S.·2005·IEEE Transactions on Automatic Control

Abstract

The celebrated Kalman-Yakubovic/spl caron/-Popov (KYP) lemma establishes the equivalence between a frequency domain inequality (FDI) and a linear matrix inequality, and has played one of the most fundamental roles in systems and control theory. This paper first develops a necessary and sufficient condition for an S-procedure to be lossless, and uses the result to generalize the KYP lemma in two aspects-the frequency range and the class of systems-and to unify various existing versions by a single theorem. In particular, our result covers FDIs in finite frequency intervals for both continuous/discrete-time settings as opposed to the standard infinite frequency range. The class of systems for which FDIs are considered is no longer constrained to be proper, and nonproper transfer functions including polynomials can also be treated. We study implications of this generalization, and develop a proper interface between the basic result and various engineering applications. Specifically, it is shown that our result allows us to solve a certain class of system design problems with multiple specifications on the gain/phase properties in several frequency ranges. The method is illustrated by numerical design examples of digital filters and proportional-integral-derivative controllers.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tac.2004.840475

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 1,062

Metadata

Authors
Iwasaki, T., & Hara, S.
Venue
IEEE Transactions on Automatic Control
Published
2005-01
Volume
50
Issue
1
Pages
41-59
ISSN
0018-9286 (ISSN-L)
OpenAlex
W2108489060
Cited by
1,062
References
0
FWCI
77.49
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Generalized KYP lemma: unified frequency domain inequalities with design applications. https://app.cochat.ai/papers/10.1109/tac.2004.840475
The paper
Iwasaki, T., & Hara, S. (2005). Generalized KYP lemma: unified frequency domain inequalities with design applications. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2004.840475

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.