Identification of linear systems : J. Schoukens and R. Pintelon, Pergamon Press, Oxford, 1991. 317 pp., UK£55, US$110, ISBN 0-0804-0734-X
✍ Scribed by W.F. Ames; C. Brezinski
- Book ID
- 103897416
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 75 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0378-4754
No coin nor oath required. For personal study only.
✦ Synopsis
This is a study of the computational complexity of real functions in the model of discrete complexity theory. Traditionally, numerical analysis provides only upper bounds for numerical problems. The main feature of this book is to apply the newly developed NP-completeness theory to prove lower bounds for basic numerical operations, such as maximization and integration. In fact, the inherent computational complexity of basic numerical operations forms a hierarchy that is parallel to the complexity hierarchy in discrete complexity theory. These results provide a direct link between discrete complexity theory and complexity theory of continuous functions. The book includes a review of the fundamental notions in complexity theory and detailed discussions of various computational models for real continuous functions.