Optimal maximization and approximation algorithms for approximately calculated functions of many variables (Q1608245)
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 1779280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal maximization and approximation algorithms for approximately calculated functions of many variables |
scientific article; zbMATH DE number 1779280 |
Statements
Optimal maximization and approximation algorithms for approximately calculated functions of many variables (English)
0 references
12 August 2002
0 references
The paper is devoted to an efficient approach to multidimensional problems in numerical analysis: to transform the domain on which a problem is defined so as to reduce the dimension of the problem. A multidimensional domain may be mapped to a one-dimensional one by invoking the Peano mapping. In this paper, the theoretical properties of the Peano mapping are analyzed together with both dimension-reducing methods as applied to maximization and approximation problems for approximately calculated Lipschitz functions of many variables.
0 references
maximization problem
0 references
optimal algorithms
0 references
dimension-reducing methods
0 references
Peano mapping
0 references
0.755639374256134
0 references
0.7370627522468567
0 references
0.7306738495826721
0 references
0.730023205280304
0 references
0.7297194600105286
0 references
