A new fast parallel statistical measurement technique for computational cosmology
by Robert J. Thacker, H.M.P. Couchman
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 4, No. 5/6, 2006

Abstract: Higher order cumulants of point processes require significant computational effort to calculate, particularly when evaluated using standard methods such as counts-in-cells. While newer techniques based on tree algorithms are more efficient, they still suffer from shot noise problems in homogeneous systems. We present a new algorithm for calculating higher order moments using Fourier methods. A filtering technique is used to suppress noise, and this approach allows us to calculate skew and kurtosis even when the point process is highly homogeneous. The algorithm can be implemented efficiently in a shared memory parallel environment provided a data-local random sampling technique is used.

Online publication date: Tue, 01-May-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com