|
|||||||||||||||||||
|
name & dimensionality | kind | in/out | description |
---|---|---|---|
nsmax | I4B | IN | the Nside value of the map to analyse. |
nlmax | I4B | IN | the maximum l value for the analysis. |
nmmax | I4B | IN | the maximum m value for the analysis. |
map_TQU(0:12*nsmax**2-1) | SP/ DP | IN | if only the temperature map is to be analyse, the map-array should be passed with this rank. |
map_TQU(0:12*nsmax**2-1, 1:3) | SP/ DP | IN | if both temperature an polarisation maps are to be analysed, the map array should have this rank, where the second index is (1,2,3) corresponding to (T,Q,U). |
alm_TGC(1:p, 0:nlmax, 0:nmmax) | SPC/ DPC | OUT | The alm values output from the analysis. p is 1 or 3 dependent on wether polarisation is included or not. In the former case, the first index is (1,2,3) corresponding to (T,E,B). |
zbounds(1:2) | DP | IN | section of the map on which to perform the alm analysis, expressed in terms of If zbounds(1)<zbounds(2), the analysis is performed on the strip zbounds(1)<z<zbounds(2); if not, it is performed outside of the strip zbounds(2)<z<zbounds(1). |
w8ring_TQU(1:2*nsmax, 1:p) | DP | IN | ring weights for quadrature corrections. If ring weights are not used, this array should be 1 everywhere. p is 1 for a temperature analysis and 3 for (T,Q,U). |
plm(0:(nlmax+1)(nlmax+2)nsmax-1), OPTIONAL | DP | IN | If this optional matrix is passed with this rank, precomputed are used instead of recursion. |
plm(0:(nlmax+1)(nlmax+2)nsmax-1,1:3), OPTIONAL | DP | IN | If this optional matrix is passed with this rank, precomputed AND precomputed tensor harmonics are used instead of recursion. |
Analyses temperature and polarisation maps passed in map. The map has an Nside of 256, and the analysis is performed up to 512 in l and m. The resulting alm coefficients for temperature and polarisation are returned in alm. A cut on each side of the equator is applied. Uniform weights are used. Since the optional plm array is provided with rank one, precomputed scalar are used while tensor harmonics are computed with a recursion.
Eric Hivon 2010-06-18
|
||||||
|
||||||