Minimax models in the theory of numerical methods
著者
書誌事項
Minimax models in the theory of numerical methods
（Theory and decision library, Series B . Mathematical and statistical methods ; v. 21）
Kluwer Academic Publishers, c1992
- タイトル別名
-
Minimaksnye algoritmy v zadachakh chislennogo analiza
- 統一タイトル
-
Minimaksnye algoritmy v zadachakh chislennogo analiza
大学図書館所蔵 件 / 全21件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Translation of: Minimaksnye algoritmy v zadachakh chislennogo analiza
Includes bibliographical references (p. 218-246) and indexes
内容説明・目次
内容説明
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 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 other methods of operations research and systems analysis to be widely used for constructing optimal algorithms.
The goal underlying the study of the various comutation models dealt with in this title is the construction of concrete numerical algorithms admitting programme implementation. The central role belongs to the concept of a sequentially optimal algorithms, which in many cases reflects the characterics of real-life computational processes more fully than the traditional optimality concepts.
目次
- General computation model
- numerical integration
- recovery of functions from their values
- search for the global extremum
- some special classes of extremal problems.
「Nielsen BookData」 より
