A descriptor solution to a class of discrete distance problems

Author

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

Author_Institution

Dept. of Electr. & Electron. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK

Volume

42

Issue

11

fYear

1997

fDate

11/1/1997 12:00:00 AM

Firstpage

1558

Lastpage

1564

Abstract

Hankel norm and Nehari-type approximation problems arise in model reduction and ℋ_∞-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

Keywords

H^∞ control; approximation theory; discrete time systems; linear systems; matrix algebra; reduced order systems; state-space methods; H_∞-control; Nehari-type approximation; descriptor systems; discrete distance problems; discrete time systems; matrix algebra; model reduction; state-space; Codes; Context modeling; Control theory; Cryptography; Decoding; Iterative algorithms; Linear algebra; Linear systems; Polynomials; Transfer functions;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.649707

Filename

649707