Journal article icon

Journal article

A descriptor solution to a class of discrete distance problems

Abstract:
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.
Publication status:
Published

Actions


Access Document


Publisher copy:
10.1109/9.649707

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Engineering Science
Role:
Author
Journal:
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
Volume:
42
Issue:
11
Pages:
1558-1564
Publication date:
1997-11-05
DOI:
ISSN:
0018-9286
URN:
uuid:bf503734-ac64-4831-ba5c-16f603a4746e
Source identifiers:
62264
Local pid:
pubs:62264

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP