Computational Complexity and Feasibility of Data Processing and Interval Computations
indgår i Applied Optimization serien
- Indbinding:
- Hardback
- Sideantal:
- 476
- Udgivet:
- 31. december 1997
- Størrelse:
- 160x31x241 mm.
- Vægt:
- 875 g.
- 8-11 hverdage.
- 9. december 2024
På lager
Normalpris
Abonnementspris
- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
Beskrivelse af Computational Complexity and Feasibility of Data Processing and Interval Computations
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.
Brugerbedømmelser af Computational Complexity and Feasibility of Data Processing and Interval Computations
Giv din bedømmelse
For at bedømme denne bog, skal du være logget ind.Andre købte også..
Find lignende bøger
Bogen Computational Complexity and Feasibility of Data Processing and Interval Computations findes i følgende kategorier:
- Business og læring > Computer og IT
- Business og læring > Videnskab
- Lægevidenskab og sygepleje
- Matematik og naturvidenskab > Matematik > Regning og matematisk analyse > Numerisk analyse
- Matematik og naturvidenskab > Matematik > Optimalisering
- Matematik og naturvidenskab > Matematik > Anvendt matematik > Matematisk modellering
- Teknologi, ingeniørvidenskab og landbrug > Teknologi: generelle emner > Matematik for ingeniører
- Databehandling og informationsteknologi > Informatik > Matematisk datateori
© 2024 Pling BØGER Registered company number: DK43351621