Advertisement

Computational Complexity and Feasibility of Data Processing and Interval Computations

  • Vladik Kreinovich
  • Anatoly Lakeyev
  • Jiří Rohn
  • Patrick Kahl

Part of the Applied Optimization book series (APOP, volume 10)

Table of contents

  1. Front Matter
    Pages i-xii
  2. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 1-21
  3. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 23-39
  4. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 41-51
  5. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 53-70
  6. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 71-78
  7. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 79-82
  8. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 83-84
  9. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 85-86
  10. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 87-90
  11. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 91-98
  12. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 99-110
  13. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 111-142
  14. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 143-151
  15. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 153-158
  16. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 161-172
  17. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 197-205
  18. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 207-217
  19. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 219-223
  20. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 225-255
  21. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 257-287
  22. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 289-307
  23. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 309-323
  24. Vladik Kreinovich, Anatoly Lakeyev, Jiří Rohn, Patrick Kahl
    Pages 325-330
  25. Back Matter
    Pages 347-459

About this book

Introduction

Targeted audience • Specialists in numerical computations, especially in numerical optimiza­ tion, who are interested in designing algorithms with automatie result ver­ ification, and who would therefore be interested in knowing how general their algorithms caIi in principle be. • Mathematicians and computer scientists who are interested in the theory 0/ computing and computational complexity, especially computational com­ plexity of numerical computations. • Students in applied mathematics and computer science who are interested in computational complexity of different numerical methods and in learning general techniques for estimating this computational complexity. The book is written with all explanations and definitions added, so that it can be used as a graduate level textbook. What this book .is about Data processing. In many real-life situations, we are interested in the value of a physical quantity y that is diflicult (or even impossible) to measure directly. For example, it is impossible to directly measure the amount of oil in an oil field or a distance to a star. Since we cannot measure such quantities directly, we measure them indirectly, by measuring some other quantities Xi and using the known relation between y and Xi'S to reconstruct y. The algorithm that transforms the results Xi of measuring Xi into an estimate fj for y is called data processing.

Keywords

Approximation Signal Variable algorithm algorithms complexity optimization verification

Authors and affiliations

  • Vladik Kreinovich
    • 1
  • Anatoly Lakeyev
    • 2
  • Jiří Rohn
    • 3
  • Patrick Kahl
    • 4
  1. 1.University of Texas at El PasoUSA
  2. 2.Computing CenterRussian Academy of SciencesIrkutskRussia
  3. 3.Charles University and Academy of SciencesPragueCzech Republic
  4. 4.IBMTucsonUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4757-2793-7
  • Copyright Information Springer-Verlag US 1998
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4419-4785-7
  • Online ISBN 978-1-4757-2793-7
  • Series Print ISSN 1384-6485
  • Buy this book on publisher's site