Articoli correlati a Computational Complexity and Feasibility of Data Processing...

Computational Complexity and Feasibility of Data Processing and Interval Computations: 10 - Rilegato

Kreinovich, V.; Lakeyev, A.V.; Rohn, J.; Kahl, P.T.

 
9780792348658: Computational Complexity and Feasibility of Data Processing and Interval Computations: 10
Rilegato
ISBN 10: 0792348656 ISBN 13: 9780792348658
Casa editrice: Kluwer Academic Pub, 1997

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Dalla quarta di copertina

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Kluwer Academic Pub
Data di pubblicazione
1997
Lingua
Inglese
ISBN 10 
0792348656
ISBN 13 
9780792348658
Rilegatura
Copertina rigida
Numero di pagine
459
Contatto del produttore
ProductSafety@springernature.com
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Germania