Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1812.04259 · Numerische Mathematik

On efficient weighted integration via a change of variables

Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, G.W. Wasilkowski

Published Sep 24, 2020• 7 citations
arXivHTMLPDF
DOI
10.1007/s00211-020-01147-7

Related papers

New averaging technique for approximating weighted integrals

Leszek Plaskota, G.W. Wasilkowski, Yunge Zhao

Journal of Complexity•Feb 14, 2009•12 citations

Diagrammatics

Jan Dereziński, Christian Gérard

The diagrammatic method is one of the most powerful tools of theoretical physics. It allows us to efficiently organize perturbative computations in statistical physics, quantum many-body theory and quantum field theory. The main feature of this method is a representation of individual terms of a perturbative expansion as diagrams ( graphs ). Diagrams consist of vertices representing terms in the perturbation, lines representing pairings between vertices and, possibly, external legs . There exist several kinds of diagrams. We will try to present them in a systematic way. In Sect. 20.1 we present a diagrammatic formalism whose goal is to organize integration of polynomials with respect to a Gaussian measure. This formalism is used extensively in classical statistical physics. It also plays an important role in quantum physics, especially in the Euclidean approach, since many quantum quantities can be expressed in terms of Gaussian integrals over classical variables. We use the term “Gaussian integration” in a rather broad sense. Beside commuting “bosonic” variables, we also consider anti-commuting “fermionic” variables, where we use the Berezin integral with respect to a Gaussian weight. Even in the case of commuting variables, the “Gaussian integral” is not necessarily meant in the sense of measure theory. It denotes an algebraic operation performed on polynomials (or formal power series), which in the case of a positive definite covariance coincides with the usual integral with a Gaussian weight. However, we allow the covariance to be complex, or even negative definite, and do not insist that the operation have a measure theoretic meaning.

Cambridge University Press eBooks•Mar 6, 2013•1 citation

A Universal Algorithm for Multivariate Integration

David Krieg, Erich Novak

Foundations of Computational Mathematics•Feb 18, 2016•34 citations

Exponential convergence and tractability of multivariate integration for Korobov spaces

Josef Dick, Gerhard Larcher, Friedrich Pillichshammer +1 more

In this paper we study multivariate integration for a weighted Korobov space for which the Fourier coefficients of the functions decay exponentially fast. This implies that the functions of this space are infinitely times differentiable. Weights of the Korobov space monitor the influence of each variable and each group of variables. We show that there are numerical integration rules which achieve an exponential convergence of the worst-case integration error. We also investigate the dependence of the worst-case error on the number of variables s s , and show various tractability results under certain conditions on weights of the Korobov space. Tractability means that the dependence on s s is never exponential, and sometimes the dependence on s s is polynomial or there is no dependence on s s at all.

Mathematics of Computation•Nov 2, 2010•55 citations

Construction of lattice rules for multiple integration based on a weighted discrepancy

Vasile Sinescu

High-dimensional integrals arise in a variety of areas, including quantum physics, the physics and chemistry of molecules, statistical mechanics and more recently, in financial applications. In order to approximate multidimensional integrals, one may use Monte Carlo methods in which the quadrature points are generated randomly or quasi-Monte Carlo methods, in which points are generated deterministically. One particular class of quasi-Monte Carlo methods for multivariate integration is represented by lattice rules. Lattice rules constructed throughout this thesis allow good approximations to integrals of functions belonging to certain weighted function spaces. These function spaces were proposed as an explanation as to why integrals in many variables appear to be successfully approximated although the standard theory indicates that the number of quadrature points required for reasonable accuracy would be astronomical because of the large number of variables. The purpose of this thesis is to contribute to theoretical results regarding the construction of lattice rules for multiple integration. We consider both lattice rules for integrals over the unit cube and lattice rules suitable for integrals over Euclidean space. The research reported throughout the thesis is devoted to finding the generating vector required to produce lattice rules that have what is termed a low weighted discrepancy . In simple terms, the discrepancy is a measure of the uniformity of the distribution of the quadrature points or in other settings, a worst-case error. One of the assumptions used in these weighted function spaces is that variables are arranged in the decreasing order of their importance and the assignment of weights in this situation results in so-called product weights . In other applications it is rather the importance of group of variables that matters. This situation is modelled by using function spaces in which the weights are general . In the weighted settings mentioned above, the quality of the lattice rules is assessed by the weighted discrepancy mentioned earlier. Under appropriate conditions on the weights, the lattice rules constructed here produce a convergence rate of the error that ranges from O(n−1/2) to the (believed) optimal O(n−1+δ) for any δ gt 0, with the involved constant independent of the dimension.

•Jan 1, 2008•0 citations

On the Hardness of Approximate Multivariate Integration

Ioannis Koutis

Lecture notes in computer science•Jan 1, 2003•2 citations
The diagrammatic method is one of the most powerful tools of theoretical physics. It allows us to efficiently organize perturbative computations in statistical physics, quantum many-body theory and quantum field theory. The main feature of this method is a representation of individual terms of a perturbative expansion as diagrams ( graphs ). Diagrams consist of vertices representing terms in the perturbation, lines representing pairings between vertices and, possibly, external legs . There exist several kinds of diagrams. We will try to present them in a systematic way. In Sect. 20.1 we present a diagrammatic formalism whose goal is to organize integration of polynomials with respect to a Gaussian measure. This formalism is used extensively in classical statistical physics. It also plays an important role in quantum physics, especially in the Euclidean approach, since many quantum quantities can be expressed in terms of Gaussian integrals over classical variables. We use the term “Gaussian integration” in a rather broad sense. Beside commuting “bosonic” variables, we also consider anti-commuting “fermionic” variables, where we use the Berezin integral with respect to a Gaussian weight. Even in the case of commuting variables, the “Gaussian integral” is not necessarily meant in the sense of measure theory. It denotes an algebraic operation performed on polynomials (or formal power series), which in the case of a positive definite covariance coincides with the usual integral with a Gaussian weight. However, we allow the covariance to be complex, or even negative definite, and do not insist that the operation have a measure theoretic meaning.
In this paper we study multivariate integration for a weighted Korobov space for which the Fourier coefficients of the functions decay exponentially fast. This implies that the functions of this space are infinitely times differentiable. Weights of the Korobov space monitor the influence of each variable and each group of variables. We show that there are numerical integration rules which achieve an exponential convergence of the worst-case integration error. We also investigate the dependence of the worst-case error on the number of variables s s , and show various tractability results under certain conditions on weights of the Korobov space. Tractability means that the dependence on s s is never exponential, and sometimes the dependence on s s is polynomial or there is no dependence on s s at all.
High-dimensional integrals arise in a variety of areas, including quantum physics, the physics and chemistry of molecules, statistical mechanics and more recently, in financial applications. In order to approximate multidimensional integrals, one may use Monte Carlo methods in which the quadrature points are generated randomly or quasi-Monte Carlo methods, in which points are generated deterministically. One particular class of quasi-Monte Carlo methods for multivariate integration is represented by lattice rules. Lattice rules constructed throughout this thesis allow good approximations to integrals of functions belonging to certain weighted function spaces. These function spaces were proposed as an explanation as to why integrals in many variables appear to be successfully approximated although the standard theory indicates that the number of quadrature points required for reasonable accuracy would be astronomical because of the large number of variables. The purpose of this thesis is to contribute to theoretical results regarding the construction of lattice rules for multiple integration. We consider both lattice rules for integrals over the unit cube and lattice rules suitable for integrals over Euclidean space. The research reported throughout the thesis is devoted to finding the generating vector required to produce lattice rules that have what is termed a low weighted discrepancy . In simple terms, the discrepancy is a measure of the uniformity of the distribution of the quadrature points or in other settings, a worst-case error. One of the assumptions used in these weighted function spaces is that variables are arranged in the decreasing order of their importance and the assignment of weights in this situation results in so-called product weights . In other applications it is rather the importance of group of variables that matters. This situation is modelled by using function spaces in which the weights are general . In the weighted settings mentioned above, the quality of the lattice rules is assessed by the weighted discrepancy mentioned earlier. Under appropriate conditions on the weights, the lattice rules constructed here produce a convergence rate of the error that ranges from O(n−1/2) to the (believed) optimal O(n−1+δ) for any δ gt 0, with the involved constant independent of the dimension.