Computational complexity of the integration problem for anisotropic classes (Q1776161)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational complexity of the integration problem for anisotropic classes |
scientific article |
Statements
Computational complexity of the integration problem for anisotropic classes (English)
0 references
20 May 2005
0 references
There is an increasing interest in studying the computational complexity of high-dimensional integration due to its applications in computational mathematics, finance, physics, engineering and in statistics. The author studies this problem in a considerable generality. More precisely, by developing a decomposition technique of Borel measure on the unit cube of a \(d\)-dimensional Euclidean space, he determines the exact order of \(\epsilon\)--complexity of the numerical integration problem for the anisotropic class \(W_\infty^r(I^d)\) and \(H_\infty^r(I^d)\). In addition, by the imbedding relationship between function classes, he extends the results to the classes of functions \(W_p^{\wedge}(I^d)\) and \(H_p^{\wedge}(I^d)\).
0 references
high-dimensional integration
0 references
epsilon complexity
0 references
randomized methods
0 references
anisotropic classes
0 references
0 references
0 references
0 references