Minimax Models in the Theory of Numerical Methods

A. Sukharev

ISBN 10: 9401052255 / ISBN 13: 9789401052252

Editore: Springer Netherlands, 2012

Riguardo questo articolo

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.

Codice articolo 9789401052252

Dati bibliografici

• Titolo: Minimax Models in the Theory of Numerical Methods
• Editore: Springer Netherlands
• Data di pubblicazione: 2012
• Lingua: Inglese
• ISBN 10: 9401052255
• ISBN 13: 9789401052252
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 240 L x 160 A x 16 P (millimetri) 240 millimetri di larghezza per 160 millimetri di altezza per 16 millimetri di profondità
• Peso: 446 grammi

Descrizione articolo

Riassunto

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.

Contenuti

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.