scholarly journals Construction algorithms for polynomial lattice rules for multivariate integration

2005 ◽  
Vol 74 (252) ◽  
pp. 1895-1922 ◽  
Author(s):  
J. Dick ◽  
F. Y. Kuo ◽  
F. Pillichshammer ◽  
I. H. Sloan
Keyword(s):  
Lattice Rules ◽  
Multivariate Integration ◽  
Construction Algorithms

scholarly journals Constructions of general polynomial lattices for multivariate integration

2007 ◽  
Vol 76 (1) ◽  
pp. 93-110 ◽  
Author(s):  
Peter Kritzer ◽  
Friedrich Pillichshammer
Keyword(s):  
Hilbert Spaces ◽  
Lattice Rules ◽  
Irreducible Polynomials ◽  
Worst Case ◽  
Multivariate Integration ◽  
Construction Algorithm ◽  
General Polynomial ◽  
Construction Algorithms ◽  
Digital Nets

We study a construction algorithm for certain polynomial lattice rules modulo arbitrary polynomials. The underlying polynomial lattices are special types of digital nets as introduced by Niederreiter. Dick, Kuo, Pillichshammer and Sloan recently introduced construction algorithms for polynomial lattice rules modulo irreducible polynomials which yield a small worst-case error for integration of functions in certain weighted Hilbert spaces. Here, we generalize these results to the case where the polynomial lattice rules are constructed moduloarbitrarypolynomials.

Construction Algorithms for Good Extensible Lattice Rules

2009 ◽  
Vol 30 (3) ◽  
pp. 361-393 ◽  
Author(s):  
Harald Niederreiter ◽  
Friedrich Pillichshammer
Keyword(s):  
Lattice Rules ◽  
Construction Algorithms

scholarly journals Constructing Embedded Lattice Rules for Multivariate Integration

2006 ◽  
Vol 28 (6) ◽  
pp. 2162-2188 ◽  
Author(s):  
Ronald Cools ◽  
Frances Y. Kuo ◽  
Dirk Nuyens
Keyword(s):  
Lattice Rules ◽  
Multivariate Integration

The Strong Tractability of Multivariate Integration Using Lattice Rules

2004 ◽  
pp. 259-273 ◽  
Author(s):  
Fred J. Hickernell ◽  
Ian H. Sloan ◽  
Grzegorz W. Wasilkowski
Keyword(s):  
Lattice Rules ◽  
Multivariate Integration

scholarly journals Construction algorithms for higher order polynomial lattice rules

2011 ◽  
Vol 27 (3-4) ◽  
pp. 281-299 ◽  
Author(s):  
Jan Baldeaux ◽  
Josef Dick ◽  
Julia Greslehner ◽  
Friedrich Pillichshammer
Keyword(s):  
Higher Order ◽  
Lattice Rules ◽  
Order Polynomial ◽  
Construction Algorithms

Dimension-Descending Algorithm for Spherical Delaunay Triangulation

2011 ◽  
Vol 130-134 ◽  
pp. 2915-2919
Author(s):  
Ping Duan ◽  
Jia Tian Li ◽  
Jia Li
Keyword(s):  
Delaunay Triangulation ◽  
Time Complexity ◽  
Image Point ◽  
Spherical Space ◽  
Projected Image ◽  
Plane Image ◽  
Projection Center ◽  
Space Data ◽  
Construction Algorithms ◽  
Main Construction

Spherical Delaunay triangulation (SDT) which is a powerful tool to represent, organize and analyze spherical space data has become a focus of spherical GIS research. Projection stitching algorithm is one of the main construction algorithms of SDT. The basic idea of stitching algorithm is that the sphere is divided into two hemispheres to avoid projected image point coincidence. So, the practicality of projection stitching algorithm is lower because of merging two hemispheres. Aimed at the disadvantage of projection stitching algorithm, this paper puts forward a new algorithm to construct SDT used perspective projection principle. The projection center is placed on sphere to establish one-to-one mapping between spherical space points and plane image points. Experiment shows that the time complexity of our algorithm depends on Delaunay triangulation construction algorithm of the plane.

Sign in / Sign up

Export Citation Format

Share Document