Applied Optimization

Computational Complexity and Feasibility of Data Processing and Interval Computations

Authors: Kreinovich, V., Lakeyev, A.V., Rohn, J., Kahl, P.T.

Buy this book

eBook $219.00
price for USA in USD (gross)
  • ISBN 978-1-4757-2793-7
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $279.99
price for USA in USD
  • ISBN 978-0-7923-4865-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $279.99
price for USA in USD
  • ISBN 978-1-4419-4785-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Reviews

`The book is very well organized. The book is readable, very detailed, and intelligible. Moreover, it is exciting and gripping because the reader is often surprised by unexpected results. Everyone who is interested in modern aspects of numerical computation will enjoy reading this interesting and informative work. The book is a must for everyone who is doing research in this field.'
Mathematical Reviews, 98m

Table of contents (26 chapters)

  • Informal Introduction: Data Processing, Interval Computations, and Computational Complexity

    Kreinovich, Vladik (et al.)

    Pages 1-21

  • The Notions of Feasibility and NP-Hardness: Brief Introduction

    Kreinovich, Vladik (et al.)

    Pages 23-39

  • In the General Case, the Basic Problem of Interval Computations is Intractable

    Kreinovich, Vladik (et al.)

    Pages 41-51

  • Basic Problem of Interval Computations for Polynomials of a Fixed Number of Variables

    Kreinovich, Vladik (et al.)

    Pages 53-70

  • Basic Problem of Interval Computations for Polynomials of Fixed Order

    Kreinovich, Vladik (et al.)

    Pages 71-78

Buy this book

eBook $219.00
price for USA in USD (gross)
  • ISBN 978-1-4757-2793-7
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $279.99
price for USA in USD
  • ISBN 978-0-7923-4865-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $279.99
price for USA in USD
  • ISBN 978-1-4419-4785-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Computational Complexity and Feasibility of Data Processing and Interval Computations
Authors
Series Title
Applied Optimization
Series Volume
10
Copyright
1998
Publisher
Springer US
Copyright Holder
Springer Science+Business Media Dordrecht
eBook ISBN
978-1-4757-2793-7
DOI
10.1007/978-1-4757-2793-7
Hardcover ISBN
978-0-7923-4865-8
Softcover ISBN
978-1-4419-4785-7
Series ISSN
1384-6485
Edition Number
1
Number of Pages
XII, 459
Topics