Computational Complexity and Feasibility of Data Processing and Interval Computations / Applied Optimization Bd.10 (PDF)
(Sprache: Englisch)
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...
sofort als Download lieferbar
eBook (pdf)
219.99 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Computational Complexity and Feasibility of Data Processing and Interval Computations / Applied Optimization Bd.10 (PDF)“
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.
Bibliographische Angaben
- Autoren: V. Kreinovich , A. V. Lakeyev , J. Rohn , P. T. Kahl
- 2013, 1998, 459 Seiten, Englisch
- Verlag: Springer, New York
- ISBN-10: 1475727933
- ISBN-13: 9781475727937
- Erscheinungsdatum: 29.06.2013
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Größe: 53 MB
- Mit Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kopierschutz
Dieses eBook können Sie uneingeschränkt auf allen Geräten der tolino Familie lesen. Zum Lesen auf sonstigen eReadern und am PC benötigen Sie eine Adobe ID.
Kommentar zu "Computational Complexity and Feasibility of Data Processing and Interval Computations / Applied Optimization Bd.10"
Schreiben Sie einen Kommentar zu "Computational Complexity and Feasibility of Data Processing and Interval Computations / Applied Optimization Bd.10".
Kommentar verfassen