Abstract
With today’s high-speed computers, drawing large numbers of subsamples with replacement (the bootstrap) or without (the permutation test) is no longer a problem, unless or until the entire world begins computing resampling tests. To prepare for this eventuality, and because computational efficiency is essential in the search for more powerful tests, a primary focus of research in resampling today is the development of algorithms for rapid computation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Good, P. (2000). Increasing Computational Efficiency. In: Permutation Tests. Springer Series in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3235-1_13
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3235-1_13
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-3237-5
Online ISBN: 978-1-4757-3235-1
eBook Packages: Springer Book Archive