The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

On the Kalman-Yakubovich-Popov Lemma for Stabilizable Systems

På svenska

Author

Summary, in English

The Kalman-Yakubovich-Popov (KYP) lemma has been a cornerstone in system theory and network analysis and synthesis. It relates an analytic property of a square transfer matrix in the frequency domain to a set of algebraic equations involving parameters of a minimal realization in time domain. This note proves that the KYP lemma is also valid for realizations which are stabilizable and observable

Publishing year

2001

Language

English

Pages

1089-1093

Publication/Series

IEEE Transactions on Automatic Control

Volume

46

Issue

7

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Control Engineering

Keywords

  • transfer function matrices
  • time-domain analysis
  • system theory
  • stability
  • network analysis
  • graph theory
  • frequency-domain analysis
  • Popov criterion
  • circuit stability

Status

Published

Project

  • Nonlinear and Adaptive Control (NACO2) Network
  • LU Robotics Laboratory

ISBN/ISSN/Other

  • ISSN: 0018-9286