## Find a copy online

### Links to this item

## Find a copy in the library

Finding libraries that hold this item...

## Details

Genre/Form: | Electronic books |
---|---|

Additional Physical Format: | Print version: |

Material Type: | Document, Internet resource |

Document Type: | Internet Resource, Computer File |

All Authors / Contributors: |
Aleksei G Sukharev |

ISBN: | 9789401127592 940112759X |

OCLC Number: | 851377214 |

Description: | 1 online resource (xiv, 258 pages). |

Contents: | 1. General Computation Model -- 1. Basic concepts -- 2. Functional classes under consideration -- 3. Classes of deterministic algorithms -- 4. Minimax concept of optimality and specific notions of optimality -- 5. Comparison of the best guaranteed results for adaptive and nonadaptive algorithms -- 6. Sequentially optimal algorithms -- 7. Stochastic algorithms -- 2. Numerical Integration -- 1. Optimal quadratures for functional classes determined by quasi-metrics -- 2. Optimal quadratures for functional classes determined by moduli of continuity -- 3. Sequentially optimal and one-step optimal integration algorithms -- 4. Numerical tests -- 5. Optimal computation of iterated integrals -- 6. Computation of multiple integrals using Peano type developments -- 3. Recovery of Functions from Their Values -- 1. Optimal nonadaptive algorithms -- 2. Sequentially optimal and one-step optimal recovery algorithms -- 3. Solution of a multistep antagonistic game related to the problem of optimal recovery -- 4. Search for the Global Extremum -- 1. On the choice of starting points for local optimization methods -- 2. Optimal nonadaptive search for a functional class determined by a quasi-metric -- 3. Reduction of the problem of constructing a sequentially optimal algorithm for a functional dass determined by a quasi-metric to aseries of problems of optimal covering -- 4. Specific computational algorithms -- 5. Case of approximate information -- 6. One-step optimal stochastic algorithm -- 5. Some Special Classes of Extremal Problems -- 1. Solution of equations and systems of equations -- 2. Maximization of a minimum function with coupled variables -- 3. Optimization with several criteria -- Author Index. |

Series Title: | Theory and decision library., Series B,, Mathematical and statistical methods ;, 21. |

Responsibility: | by Aleksei G. Sukharev. |

More information: |

### Abstract:

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.

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Minimax Models in the Theory of Numerical Methods".
Be the first.