Fast computation of temperature and polarization coupling matrices
Georgia Kiddier, Steven Gratton

TL;DR
The paper introduces a fast, exact method for computing CMB mode-coupling matrices using optimized Wigner-3j symbol evaluations, significantly accelerating calculations while maintaining accuracy.
Contribution
It presents a novel approach that reduces computational cost of coupling matrices by exploiting analytic structures and recurrence relations, enabling efficient parallelization on modern hardware.
Findings
Achieves 6-25x speedup over standard methods.
Maintains numerical accuracy in coupling matrix calculations.
Supports efficient parallelization on CPUs and GPUs.
Abstract
We present a fast and exact method for computing CMB mode-coupling matrices based on an optimised evaluation of Wigner-3j symbols. The method exploits analytic structure in the relevant Wigner-3j symbol configurations appearing in temperature and polarization coupling matrices, expressing all required quantities in terms of a small set of recurrence-generated values which are precomputed and stored in lookup tables. This approach reduces the computational cost of constructing the full coupling matrices whilst maintaining numerical accuracy. We demonstrate the performance of the threej_cosmo implementation using realistic survey masks from current CMB experiments. Relative to standard recursion-based approaches used in existing pseudo-C_l pipelines, the method achieves speedups of 6-25x in practical coupling-matrix constructions, with the largest gains occurring at high multipoles. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Electromagnetic Scattering and Analysis · Matrix Theory and Algorithms
