 |
|
|
Item Details
| Title:
|
DISCRETE H? OPTIMIZATION
WITH APPLICATIONS IN SIGNAL PROCESSING AND CONTROL SYSTEMS |
| By: |
Charles K. Chui, Guanrong Chen |
| Format: |
Paperback |
| List price:
|
£129.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
3540619593 |
| ISBN 13: |
9783540619598 |
| Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
| Pub. date: |
30 May, 1997 |
| Edition: |
2nd ed. 1997 |
| Series: |
Springer Series in Information Sciences 26 |
| Pages: |
261 |
| Description: |
Talks about optimization for digital signal processing and discrete-time control systems. Providing readers with sufficient background in the subject to enable them to begin research in this field, this book includes rigorous derivations of the results, many examples as well as the discussion of research problems. |
| Synopsis: |
Discrete H? Optimization is concerned with the study of H? optimization for digital signal processing and discrete-time control systems. The first three chapters present the basic theory and standard methods in digital filtering and systems from the frequency-domain approach, followed by a discussion of the general theory of approximation in Hardy spaces. AAK theory is introduced, first for finite-rank operators and then more generally, before being extended to the multi-input/multi-output setting. This mathematically rigorous book is self-contained and suitable for self-study. The advanced mathematical results derived here are applicable to digital control systems and digital filtering. |
| Illustrations: |
XIII, 261 p. |
| Publication: |
Germany |
| Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
No Cheese, Please!
A fun picture book for children with food allergies - full of friendship and super-cute characters!Little Mo the mouse is having a birthday party.
|
My Brother Is a Superhero
Luke is massively annoyed about this, but when Zack is kidnapped by his arch-nemesis, Luke and his friends have only five days to find him and save the world...
|
|
|
|
|