Skip to main content
Meridian Journal of Mathematical Sciences
Article

Optimal error bounds for quasi-Monte Carlo rules via a variational approach

Henrik Sørensen1* (unauthenticated), Oskar Sørensen2 (unauthenticated), Oluwaseun Achebe3

1Department of Mathematics, Pacific Rim University, Australia

2Department of Statistics, Han River Institute for Advanced Study, South Korea

3School of Physics, Hanseatic University of Applied Sciences, Germany

* Corresponding author.

Meridian J. Math. Sci. 2023, 9(3), 126-141; https://doi.org/10.58301/sm0mpd26

Abstract

Despite considerable progress in recent years, several fundamental questions about quasi-Monte Carlo rules remain open. We prove existence and uniqueness of weak solutions under minimal regularity assumptions, and we show that the result is stable under a range of perturbations of the assumptions. We discuss limitations of the present study and outline how the methods can be extended.

Keywords:numerical analysisrandom regular graphsprobabilityfinite element methodpartial differential equationsconvex bodiesstability

Introduction

Let Ω ⊂ R d be a bounded domain with Lipschitz boundary and let p ∈ ( 1 , ∞ ) . We consider the boundary value problem1

− div ⁡ ( | ∇ u | p − 2 ∇ u ) = f in  Ω , u = 0 on  ∂ Ω . (1)

Existence of weak solutions in W 0 1 , p ( Ω ) follows from the direct method of the calculus of variations. Our interest here is in sharp quantitative bounds that do not depend on the dimension.

Main result

Theorem 1. Suppose f ∈ L q ( Ω ) with q > d / p . Then there is a constant C = C ( d , p , q ) such that

‖ u ‖ L ∞ ( Ω ) ≤ C | Ω | 1 d − 1 p + 1 q ‖ f ‖ L q ( Ω ) 1 p − 1 . (2)

The proof combines a truncation argument with the Sobolev inequality ‖ v ‖ p ∗ ≤ S ‖ ∇ v ‖ p . A second estimate, for the gradient, is given by

∫ Ω | ∇ u | p d x ; ≤ ; ∑ k = 1 ∞ 2 − k λ k − 1 ‖ f ‖ q p ′ , p ′ = p p − 1 . (3)

Numerical illustration

Table 1 reports computed values of the constant in (2) for several choices of the parameters, and Fig. 1 shows the decay of the error under mesh refinement.

Table 1 Computed values of the constant C ( d , p , q )

dpqC (computed)C (bound)
2220.0810.125
2340.1470.210
3230.0520.083
3450.2090.341
Fig. 1

Fig. 1 Error versus mesh size on a logarithmic scale; the dashed line has slope 2.

Discussion

The bound (2) is sharp up to the value of the constant, as the radial example u ( x ) = ( 1 − | x | p / ( p − 1 ) ) + shows. Extensions to systems and to variable exponents will be treated elsewhere.

Here the divergence and gradient are taken in the sense of distributions.

References

  1. 1 Lindholm, S., Okonkwo, C. (1990). A note on Markov kernels. J. Comput. Phys. 22, 893–1198.
  2. 2 Okonkwo, C., Nakagawa, K. (2001). Asymptotics of integral operators. SIAM J. Numer. Anal. 115, 390–1137.
  3. 3 Banerjee, S., Haddad, R. (2021). Estimates for elliptic systems. J. Math. Anal. 104, 20–1154.
  4. 4 Haddad, R., Nakagawa, K. (2000). Numerical study of lattice models. Phys. Rev. E 22, 464–1178.
  5. 5 Banerjee, S., Nakagawa, K. (2016). On the structure of random walks. Comm. Pure Appl. Math. 60, 443–1186.
  6. 6 Ivanova, T., Fernandes, P. (2022). A note on Markov kernels. Discrete Math. 75, 230–1061.
  7. 7 Ivanova, T., Fernandes, P. (2024). Asymptotics of integral operators. Phys. Rev. E 42, 417–1135.
  8. 8 Fernandes, P., Ivanova, T. (2015). Estimates for elliptic systems. SIAM J. Numer. Anal. 109, 83–1058.
  9. 9 Albrecht, M., Ivanova, T. (2006). Numerical study of lattice models. Comm. Pure Appl. Math. 60, 651–1187.
  10. 10 Fernandes, P., Gunnarsson, H. (2006). On the structure of random walks. SIAM J. Numer. Anal. 78, 755–1112.
  11. 11 Ivanova, T., Lindholm, S. (2021). A note on Markov kernels. Phys. Rev. E 10, 744–1149.
  12. 12 Yilmaz, E., Lindholm, S. (2024). Asymptotics of integral operators. Comm. Pure Appl. Math. 59, 588–1143.
  13. 13 Albrecht, M., Moreau, A. (1996). Estimates for elliptic systems. SIAM J. Numer. Anal. 100, 321–1045.
  14. 14 Nakagawa, K., Albrecht, M. (2019). Numerical study of lattice models. J. Comput. Phys. 81, 821–1194.

Declarations

Competing Interests

The authors have no relevant financial or non-financial interests to disclose.

Declaration of Generative AI Use

A language model was used to check the grammar of the abstract. No content was generated.

Download