2013
DOI: 10.1051/0004-6361/201321494
|View full text |Cite
|
Sign up to set email alerts
|

Libsharp – spherical harmonic transforms revisited

Abstract: We present libsharp, a code library for spherical harmonic transforms (SHTs), which evolved from the libpsht library and addresses several of its shortcomings, such as adding MPI support for distributed memory systems and SHTs of fields with arbitrary spin, but also supporting new developments in CPU instruction sets like the Advanced Vector Extensions (AVX) or fused multiplyaccumulate (FMA) instructions. The library is implemented in portable C99 and provides an interface that can be easily accessed from othe… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
77
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 78 publications
(83 citation statements)
references
References 28 publications
(53 reference statements)
0
77
0
Order By: Relevance
“…The major bottleneck of the code performance is due to the need of calculating a single inverse spherical harmonic transform which is required to obtain the overpixelized map of the unlensed signal. This can certainly be alleviated further by using better algorithms and/or numerical implementations, e.g., capitalizing on hardware accelerators such as GPGPU (Hupca et al 2012;Szydlarski et al 2011;Fabbian et al 2012;Reinecke & Seljebotn 2013). We leave these code optimizations for future work.…”
Section: Discussionmentioning
confidence: 99%
“…The major bottleneck of the code performance is due to the need of calculating a single inverse spherical harmonic transform which is required to obtain the overpixelized map of the unlensed signal. This can certainly be alleviated further by using better algorithms and/or numerical implementations, e.g., capitalizing on hardware accelerators such as GPGPU (Hupca et al 2012;Szydlarski et al 2011;Fabbian et al 2012;Reinecke & Seljebotn 2013). We leave these code optimizations for future work.…”
Section: Discussionmentioning
confidence: 99%
“…Order of magnitude of the accuracy of the HEALPix spherical harmonic transform, averaged over the parameter N side . have been widely studied in the past (see, e.g., Reinecke 2011;Doroshkevich et al 2011;Reinecke & Seljebotn 2013), and that of the MW sampling were presented in McEwen & Wiaux (2011). We do not compile the entirety of these results here, but we have reproduced the essential results on our machine; Table 1 summarises the orders of accuracy of the HEALPix iterative spherical harmonic transform.…”
Section: Numerical Validationmentioning
confidence: 99%
“…Using the same setup as previously, we calculated the maximum error on the spherical harmonic coefficients when performing the transform back and forth, averaged over the values of N side , since the results were found to be sensitive only to the ratio L/N side . Even with several iterations, which multiplies the number of transforms and thus computation time, the spherical harmonic transform in HEALPix remains at least an order of magnitude less accurate than the MW and GLESP counterparts (which, being both theoretically exact, achieve comparable performances, see Reinecke 2011;Reinecke & Seljebotn 2013;Doroshkevich et al 2011;McEwen & Wiaux 2011). Since the wavelet transforms implemented in MRS and Needatool are also computed in harmonic space, their complexity and accuracy are dominated by that of the underlying spherical harmonic transforms.…”
Section: Numerical Validationmentioning
confidence: 99%
“…(31), (32) allow us to consider a spatially varying g nl , too. We focus on a scalar for simplicity.…”
Section: The Bayesian G Nl -Posteriormentioning
confidence: 99%