We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on ℓp​ semi-norms.
Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by the optimal rate of convergence for the corresponding function space.
The focus is on algebraic rates of convergence O(N−α+ϵ) for α≥1 and any ϵ>0, where α is the decay of a series representation of the integrand function.
The dependence of the implied constant on the dimension can be controlled by weights which determine the influence of the different coordinates.
Different types of weights are discussed.
The construction of good lattice rules, and polynomial lattice rules, can be done using the same method for all 1<p≤∞; but the case p=1 is special from the construction point of view.
For 1<p≤∞ the component-by-component construction and its fast algorithm for different weighted function spaces is then discussed.status: publishe
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.