Optimal maximization and approximation algorithms for approximately calculated functions of many variables
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.
scientific article; zbMATH DE number 1779280