DMCA
An Algorithm for the Construction of Spatial Coverage Designs with Implementation in SPLUS (1998)
| Venue: | in Splus, Computers and Geosciences |
| Citations: | 12 - 0 self |
BibTeX
@INPROCEEDINGS{Royle98analgorithm,
author = {J. Andrew Royle and Doug Nychka},
title = {An Algorithm for the Construction of Spatial Coverage Designs with Implementation in SPLUS},
booktitle = {in Splus, Computers and Geosciences},
year = {1998},
pages = {479--488}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Space-filling "coverage" designs are spatial sampling plans which optimize a distance-based criterion. Because they do not depend on the covariance structure of the process to be sampled, coverage designs are more efficiently computed than designs which are optimal for mean squared error criteria. This paper presents an efficient algorithm for the construction of coverage designs and evaluates it's performance in terms of computation time and effectiveness at finding "good" designs. Results suggest that near-optimal designs for reasonably large problems can be computed very efficiently. The algorithm is implemented in the statistical programming language SPLUS, and examples of the construction of coverage designs are given involving an existing network of ozone monitoring sites. Keywords: Spatial design, space-filling designs, spatial statistics, spatial sampling, network design. Address: Box 3000, Boulder, Colorado 80307. (303) 497-1704. 1 Introduction A practical problem in spat...
Keyphrases
spatial coverage design coverage design practical problem network design good design large problem computation time space-filling design space-filling coverage design spatial design spatial sampling plan statistical programming language splus near-optimal design spatial sampling distance-based criterion ozone monitoring site covariance structure spatial statistic error criterion efficient algorithm
