Constructions of nets via OAs of strength 3 with a prescribed property
โ Scribed by Yang Li; Jianxing Yin
- Publisher
- John Wiley and Sons
- Year
- 2010
- Tongue
- English
- Weight
- 131 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
โฆ Synopsis
The idea of (t, m, s)-nets was proposed by Niederreiter in 1987. Such nets are highly uniform point distributions in s-dimensional unit cubes and useful in numerical analysis. It is by now well known that (t, m, s)-nets can be equivalently described in terms of ordered orthogonal arrays (OOAs). In this article, we describe an equivalence between an OOA and an orthogonal array (OA) with all its derived orthogonal subarrays being resolvable. We then present a number of constructions for OAs where all their derived orthogonal subarrays are resolvable. These results are finally combined to give new series of (t, m, s)-nets.
๐ SIMILAR VOLUMES
In nmking a careful comparison between the last (the 22d) edition, and the one that precedes it, the expert cannot fail to be struck with the great improvement exhibited by the present edition. We say improvement, although it seemed ahnost impossible that the book in its various editions needed any