minimax models theory numerical von sukharev (20 Ergebnisse)

Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Sprache: Englisch Gewicht in Gramm: 1550.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - In the Russian edition published in 1989, this book was called 'Minimax Algorithms in Problems of Numerical Analysis'. The new title is better related to the subject of the book and its style. The basis for every decision or inference concerning the ways to solve a given problem is the computa tion model. Thus, the computation model is the epicenter of any structure studied in the book. Algorithms are not constructed here, they are rather derived from computation models. Quality of an algorithm depends entirely on consistency of the model with the real-life problem. So, constructing a model is an art, deriving an algorithm is a science. We study only minimax or, in other words, worst-case computation models. However, one of the characteristic features of the book is a new approach to the notion of the worst-case conditions in dynamic processes. This approach leads to the concept of sequentially optimal algorithms, which play the central role in the book. In conclusion, I would like to express my gratitude to Prof. Dr. Heinz J. Skala and Dr. Sergei A. Orlovsky for encouraging translation of this book. I also greatly appreciate the highly professional job of Dr. Olga R. Chuyan who translated the book.

Zustand: New. In.

Zustand: New.

Zustand: New. SUPER FAST SHIPPING.

Zustand: New. pp. 276.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Zustand: New. In.

Gebunden. Zustand: New. 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.

Zustand: New. SUPER FAST SHIPPING.

Zustand: New.

Paperback. Zustand: Like New. Like New. book.

Hardcover. Zustand: Brand New. 276 pages. 9.61x6.69x0.69 inches. In Stock.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. In the Russian edition published in 1989, this book was called Minimax Algorithms in Problems of Numerical Analysis . The new title is better related to the subject of the book and its style. The basis for every decision or inference concerning the ways to.

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -In the Russian edition published in 1989, this book was called 'Minimax Algorithms in Problems of Numerical Analysis'. The new title is better related to the subject of the book and its style. The basis for every decision or inference concerning the ways to solve a given problem is the computa tion model. Thus, the computation model is the epicenter of any structure studied in the book. Algorithms are not constructed here, they are rather derived from computation models. Quality of an algorithm depends entirely on consistency of the model with the real-life problem. So, constructing a model is an art, deriving an algorithm is a science. We study only minimax or, in other words, worst-case computation models. However, one of the characteristic features of the book is a new approach to the notion of the worst-case conditions in dynamic processes. This approach leads to the concept of sequentially optimal algorithms, which play the central role in the book. In conclusion, I would like to express my gratitude to Prof. Dr. Heinz J. Skala and Dr. Sergei A. Orlovsky for encouraging translation of this book. I also greatly appreciate the highly professional job of Dr. Olga R. Chuyan who translated the book.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 276 pp. Englisch.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In the Russian edition published in 1989, this book was called 'Minimax Algorithms in Problems of Numerical Analysis'. The new title is better related to the subject of the book and its style. The basis for every decision or inference concerning the ways to solve a given problem is the computa tion model. Thus, the computation model is the epicenter of any structure studied in the book. Algorithms are not constructed here, they are rather derived from computation models. Quality of an algorithm depends entirely on consistency of the model with the real-life problem. So, constructing a model is an art, deriving an algorithm is a science. We study only minimax or, in other words, worst-case computation models. However, one of the characteristic features of the book is a new approach to the notion of the worst-case conditions in dynamic processes. This approach leads to the concept of sequentially optimal algorithms, which play the central role in the book. In conclusion, I would like to express my gratitude to Prof. Dr. Heinz J. Skala and Dr. Sergei A. Orlovsky for encouraging translation of this book. I also greatly appreciate the highly professional job of Dr. Olga R. Chuyan who translated the book. 276 pp. Englisch.

Zustand: New. PRINT ON DEMAND pp. 276.

Zustand: New. Print on Demand pp. 276 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Buch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 276 pp. Englisch.

Hardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 655.