d2lri: A nonadaptive algorithm for two-dimensional cubature
β Scribed by Michael Hill; Ian Robinson
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 206 KB
- Volume
- 112
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
We describe a nonadaptive automatic cubature routine for integration over a wide variety of two-dimensional domains, including inΓΏnite regions. The underlying algorithm ΓΏrst maps the region onto the unit square, applies a periodizing sixth-order Sidi transformation and then generates a sequence of approximations based on embedded lattice rules. Numerical experiments suggest that the routine is reliable and e cient for a wide range of integrand types and that it is often more e ective than other published routines for integrands with a singularity along the boundary and for integration over inΓΏnite domains.
π SIMILAR VOLUMES
In the classical two-dimensional bin packing problem one is asked to pack a set of rectangular items, without overlap and without any rotation, into the minimum number of identical square bins. We give an approximation algorithm with absolute worst-case ratio of 3.
This paper describes a two-dimensional implementation of a monotonical logical grid (MLG) algorithm for a Monte Carlo study of a two-dimensional Lennard-Jones fluid, and compares its performance with a conventional link-cell algorithm with the same purpose. It is obtained that the MLG scales approxi
## Abstract The phase of an image obtained with many magnetic resonance imaging techniques is related to some physical variable of interest. This phase needs to be unwrapped, which is complicated by the presence of noise and multiple objects of irregular shape. A new twoβdimensional phase unwrappin