株式会社極東書店トップ > 商品一覧 > Computational Complexity and Feasibility of Data Processing and Interval Computations. 1st ed. Softcover of orig. ed. 1998.
商品詳細
Computational Complexity and Feasibility of Data Processing and Interval Computations. 1st ed. Softcover of orig. ed. 1998.
・ISBN 978-1-4419-4785-7 paper EUR 199.99
¥53,456.- (税込) ※(※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Kreinovich, V. / Lakeyev, A.V. / Rohn, J. / Kahl, P.T., |
|---|---|
| シリーズ | Applied Optimization |
| 出版社 | (Springer-Verlag New York Inc., US) |
| 出版年月 | 2010 |
| ページ数 | 459 pp. |
| 言語 | ENG |
| ニュース番号 | <M25-23046> |
解説
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.