Quasi-Monte Carlo integration over Rs based on digital nets

被引:1
作者
Dick, Josef [1 ]
Pillichshammer, Friedrich [2 ]
机构
[1] Univ New South Wales, Sch Math & Stat, Sydney, NSW 2052, Australia
[2] Univ Linz, Inst Finanzmathemat & Angew Zahlentheorie, Altenbergerstr 69, A-4040 Linz, Austria
关键词
Numerical integration; Quasi-Monte Carlo; Digital nets; Digital shifts; Inversion method; SHIFTED LATTICE RULES; HIGH-DIMENSIONAL INTEGRATION; MULTIVARIATE INTEGRATION; STRONG TRACTABILITY; LOW-DISCREPANCY; POINT SETS; CONSTRUCTION; ALGORITHMS; SPACES; CONVERGENCE;
D O I
10.1016/j.cam.2024.116451
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper discusses p-weighted integration of functions over the 3-dimensional Euclidean space using quasi-Monte Carlo (QMC) rules combined with an inversion method, where the grobability density function (PDF) is of product form, i.e., a product of uni-variate PDFs for each coordinate in (1....s).<br /> The space of integrands is specified by means of fay-weighted p-norm, p >= 1, which involves coordinate weights y, the partial derivatives of order up to one of the integrands as well as additional weight functions y, and the PDFs 4. The coordinate weights y model the importance of different coordinates or groups of coordinates in the sense of Sloan and Wo & zacute;niakowski, and the weight functions y, are additional parameters of the space which describe the decay of the partial derivatives of the integrands. Fast decaying weights w(x) for x 100 enlarge the space. of functions with finite norm, but decrease the convergence rate of the worst-case epror of the proposed algorithms.<br /> Our algorithms for integration use digitally shifted digital nets in combination with an inversion method. We study the (root) mean squared worst-case error with respect to random digital shifts. The obtained error bounds depend on the choice of weight functions, and coordinate weights y. Under certain conditions on y, these bounds hold uniformly for all dimensions s.<br /> Numerical experiments demonstrate the effectiveness of the proposed algorithms.
引用
收藏
页数:27
相关论文
共 32 条
  • [1] Construction algorithms for polynomial lattice rules for multivariate integration
    Dick, J
    Kuo, FY
    Pillichshammer, F
    Sloan, IH
    [J]. MATHEMATICS OF COMPUTATION, 2005, 74 (252) : 1895 - 1921
  • [2] On the mean square weighted L2 discrepancy of randomized digital (t,m,s)-nets over Z2
    Dick, J
    Pillichshammer, F
    [J]. ACTA ARITHMETICA, 2005, 117 (04) : 371 - 403
  • [3] Construction algorithms for digital nets with low weighted star discrepancy
    Dick, J
    Leobacher, G
    Pillichshammer, F
    [J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 2005, 43 (01) : 76 - 95
  • [4] Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
    Dick, J
    Pillichshammer, F
    [J]. JOURNAL OF COMPLEXITY, 2005, 21 (02) : 149 - 195
  • [5] Dick J., 2022, Springer Series in Computational Mathematics, DOI DOI 10.1007/978-3-031-09951-9
  • [6] Weighted integration over a hyperrectangle based on digital nets and sequences
    Dick, Josef
    Pillichshammer, Friedrich
    [J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2021, 393
  • [7] ON THE OPTIMAL ORDER OF INTEGRATION IN HERMITE SPACES WITH FINITE SMOOTHNESS
    Dick, Josef
    Irrgeher, Christian
    Leobacher, Gunther
    Pillichshammer, Friedrich
    [J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 2018, 56 (02) : 684 - 707
  • [8] High-dimensional integration: The quasi-Monte Carlo way
    Dick, Josef
    Kuo, Frances Y.
    Sloan, Ian H.
    [J]. ACTA NUMERICA, 2013, 22 : 133 - 288
  • [9] Dick Josef, 2010, Digital Nets and Sequences: Discrepancy Theory and QuasiMonte Carlo Integration
  • [10] Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness
    Ebert, Adrian
    Kritzer, Peter
    Nuyens, Dirk
    Osisiogu, Onyekachi
    [J]. JOURNAL OF COMPLEXITY, 2021, 66