A descriptor solution to a class of discrete distance problems

M. M.M. Al-Husari, I. M. Jaimoukha, D. J.N. Limebeer

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


Hankel norm and Nehari-type approximation problems arise in model reduction and H-control theory. Existing solutions to the discrete-time version of these problems may be derived using a standard state-space framework, but the resulting solution formulas require an invertible A-matrix. As a further complication, the D-matrix in the representation formula for all solutions becomes unbounded in the optimal case. The aim of this paper is to show that both these complications may be removed by analyzing these problems in a descriptor framework.

Original languageEnglish
Pages (from-to)1558-1564
Number of pages7
JournalIEEE Transactions on Automatic Control
Issue number11
Publication statusPublished - 1997
Externally publishedYes


  • Descriptor systems
  • Discrete-time Nehari problem
  • H control
  • Model reduction

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'A descriptor solution to a class of discrete distance problems'. Together they form a unique fingerprint.

Cite this