No label defined (Q4040646)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 193848
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 193848 |
Statements
5 June 1993
0 references
research exposition
0 references
Complexity
0 references
optimality
0 references
minimax concept
0 references
Adaptive algorithms
0 references
game-theoretic methods
0 references
optimal algorithms
0 references
sequential optimality
0 references
Numerical integration
0 references
Recovery of functions
0 references
global extremum
0 references
extremal problems
0 references
0.8928233981132507
0 references
0.8059130311012268
0 references
Complexity and optimality of algorithms in numerical analysis are studied. Problems and algorithms are treated with a general framework based on the minimax concept of optimality. Adaptive algorithms and their implementation as well as game-theoretic methods for constructing optimal algorithms are considered. The central role of sequentially-optimal algorithms results from the fact that the notion of sequential optimality suits a number of real computational processes better than the traditional notions. The following chapters are contained: 1. General model of computation; 2. Numerical integration; 3. Recovery of functions using their values; 4. Search for a global extremum; 5. Some special classes of extremal problems.
0 references
