Skip to main content
SpringerLink
Log in
Book cover

Minimax Models in the Theory of Numerical Methods

  • Book
  • © 1992

Overview

Authors:
  1. Aleksei G. Sukharev

    1. Moscow State University, Russia

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Theory and Decision Library B (TDLB, volume 21)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

  1. Front Matter

    Pages i-xiv
    Download chapter PDF

  2. General Computation Model

    • Aleksei G. Sukharev
    Pages 1-53

  3. Numerical Integration

    • Aleksei G. Sukharev
    Pages 54-120

  4. Recovery of Functions from Their Values

    • Aleksei G. Sukharev
    Pages 121-151

  5. Search for the Global Extremum

    • Aleksei G. Sukharev
    Pages 152-195

  6. Some Special Classes of Extremal Problems

    • Aleksei G. Sukharev
    Pages 196-217

  7. Back Matter

    Pages 218-258
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Moscow State University, Russia

    Aleksei G. Sukharev

Bibliographic Information

  • Book Title: Minimax Models in the Theory of Numerical Methods

  • Authors: Aleksei G. Sukharev

  • Series Title: Theory and Decision Library B

  • DOI: https://doi.org/10.1007/978-94-011-2759-2

  • Publisher: Springer Dordrecht

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media Dordrecht 1992

  • Hardcover ISBN: 978-0-7923-1821-7Published: 30 June 1992

  • Softcover ISBN: 978-94-010-5225-2Published: 26 October 2012

  • eBook ISBN: 978-94-011-2759-2Published: 06 December 2012

  • Edition Number: 1

  • Number of Pages: XIV, 258

  • Additional Information: Originally published in Russian

  • Topics: Operations Research/Decision Theory, Operations Research, Management Science

Publish with us

Policies and ethics

Back to top

Search

Navigation