Liberating the dimension (Q708310): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Infinite-dimensional quadrature and approximation of distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence rate of the component-by-component construction of good lattice rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good lattice rules in weighted Korobov spaces with general weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized tractability for multivariate problems. I: Linear tensor product problems and linear information / rank
 
Normal rank
Property / cites work
 
Property / cites work: The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4237478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly shifted lattice rules with the optimal rate of convergence for unbounded integrands / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decompositions of multivariate functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly shifted lattice rules for unbounded integrands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intractability results for integration and discrepancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of multivariate problems. Volume I: Linear information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm and worst case complexity for Feynman-Kac path integration. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New averaging technique for approximating weighted integrals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tractability of path integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of weighted approximation over \(\mathbb{R}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the topology of a polymer ring / rank
 
Normal rank

Latest revision as of 08:13, 3 July 2024

scientific article
Language Label Description Also known as
English
Liberating the dimension
scientific article

    Statements

    Liberating the dimension (English)
    0 references
    0 references
    0 references
    0 references
    11 October 2010
    0 references
    The authors address the problem of integration over the \(d\)-dimensional unit cube of a function \(f\) of \(d\) variables, \[ I_d(f) = \int_{[0,1]^d} f({\mathbf{x}}) d{\mathbf{x}}. \] It is possible to design an algorithm for which the error is bounded polynomially in \(d\), or independently of \(d\) under suitable conditions on the weighted function space [\textit{I. H. Sloan} and \textit{H. Woźniakowski}, J. Complexity 14, No.~1, 1--33 (1998; Zbl 1032.65011)]. The key challenge which is addressed in this paper is the integration problem with infinitely many variables (\(d\rightarrow \infty\)) and a search for algorithms with small error and minimal cost. As a result, a number of lower and upper estimates of the minimal cost for the product and the finite-order weights is presented. It is demonstrated that in some cases the bounds are sharp. Lower and upper bounds are obtained on the worst case \(\varepsilon\)-complexity (that is, on the minimal cost of all algorithms whose worst case errors are at most \(\varepsilon\)), and conditions for polynomial tractability and weak tractability are provided. Polynomial tractability means that the \(\varepsilon\)-complexity is bounded polynomially in \(\varepsilon^{-1}\); weak tractability means that the \(\varepsilon\)-complexity is not an exponential function of \(\varepsilon^{-1}\). The authors assume that a point evaluation of the integrands is possible only at points with finitely many non-zero components. It is to be noted that an intensive development of the theory of numerical integration has started in the second half of XX century. \textit{S. L. Sobolev} was one of the founders of this modern direction of computational mathematics. His first papers concerning the theory of approximate integration were published at the beginning of the 60s and promoted the use of ideas and methods of functional analysis in the theory of computations. One of the key monographs of \textit{S. L. Sobolev} is `Introduction to the theory of cubature formulas' [Nauka, Moscow, Russian (1974; Zbl 0294.65013)]. An abridged English translation of the book was published in 1992 only as `Cubature formulas and modern analysis: An introduction' [Montreux: Gordon and Breach Science Publishers (1992; Zbl 0784.65016)].
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    infinite dimensional integration
    0 references
    tractability
    0 references
    randomly shifted lattice rules
    0 references
    worst case error
    0 references
    algorithms
    0 references
    lower and upper bounds
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references