Fr. 119.00

Minimax Models In The Theory Of Numerical Methods

Englisch · Fester Einband

Versand in der Regel in 3 bis 5 Wochen (Titel wird speziell besorgt)

Beschreibung

Mehr lesen

The efficiency of computational methods and the choice of the most efficient methods for solving a specific problem or a specific class of problems have always played an important role in numerical analysis. Optimization of the computerized solution process is now a major problem of applied mathematics, which stimulates the search for new computational methods and ways to implement them.
In Minimax Models in the Theory of Numerical Methods, methods for estimating the efficiency of computational algorithms and problems of their optimality are studied within the framework of a general computation model.
The subjects dealt with in this important book are very different from the traditional subjects of computational methods. Close attention is paid to adaptive (sequential) computational algorithms, the process of computation being regarded as a controlled process and the algorithm as a control strategy. This approach allows methods of game theory and othermethods of operations research and systems analysis to be widely used for constructing optimal algorithms. The goal underlying the study of the various computation models dealt with in this title is the construction of concrete numerical algorithms admitting program implementation. The central role belongs to the concept of a sequentially optimal algorithm, which in many cases reflects the characteristics of real-life computational processes more fully than the traditional optimality concepts.

Inhaltsverzeichnis

Preface to the English Edition. Preface. Glossary of Symbols. 1. General Computation Model. 2. Numerical Integration. 3. Recovery of Functions from Their Values. 4. Search for the Global Extremum. 5. Some Special Classes of Extremal Problems. Bibliography. Author Index. Subject Index.

Zusammenfassung

Methods for estimating the efficiency of computational algorithms and problems of their optimality are studied within the framework of a general computation model in this text. Close attention is paid to adaptive (sequential) computational algorithms.

Produktdetails

Autoren A G Sukharev, A. Sukharev, Aleksei G. Sukharev
Mitarbeit Olga Chuyan (Übersetzung)
Verlag Springer Netherlands
 
Sprache Englisch
Produktform Fester Einband
Erschienen 30.06.1992
 
EAN 9780792318217
ISBN 978-0-7923-1821-7
Seiten 258
Abmessung 170 mm x 18 mm x 244 mm
Gewicht 625 g
Illustration XIV, 258 p.
Serien Theory and Decision Library
Theory and Decision Library B
Thema Sozialwissenschaften, Recht,Wirtschaft > Wirtschaft > Allgemeines, Lexika

Kundenrezensionen

Zu diesem Artikel wurden noch keine Rezensionen verfasst. Schreibe die erste Bewertung und sei anderen Benutzern bei der Kaufentscheidung behilflich.

Schreibe eine Rezension

Top oder Flop? Schreibe deine eigene Rezension.

Für Mitteilungen an CeDe.ch kannst du das Kontaktformular benutzen.

Die mit * markierten Eingabefelder müssen zwingend ausgefüllt werden.

Mit dem Absenden dieses Formulars erklärst du dich mit unseren Datenschutzbestimmungen einverstanden.