Efficient Wiener filtering without preconditioning

We present a new approach to calculate the Wiener filter solution of general data sets. It is trivial to implement, flexible, numerically absolutely stable, and guaranteed to converge. Most importantly, it does not require an ingenious choice of preconditioner to work well. The method is capable of taking into account inhomogeneous noise distributions and arbitrary mask geometries. It iteratively builds up the signal reconstruction by means of a messenger field, introduced to mediate between the different preferred bases in which signal and noise properties can be specified most conveniently. Using cosmic microwave background (CMB) radiation data as a showcase, we demonstrate the capabilities of our scheme by computing Wiener filtered WMAP7 temperature and polarization maps at full resolution for the first time. We show how the algorithm can be modified to synthesize fluctuation maps, which, combined with the Wiener filter solution, result in unbiased constrained signal realizations, consistent with the observations. The algorithm performs well even on simulated CMB maps with Planck resolution and dynamic range.Comment: 5 pages, 2 figures. Submitted to Astronomy and Astrophysics. Replaced to match published versio

ARKCoS: Artifact-Suppressed Accelerated Radial Kernel Convolution on the Sphere

We describe a hybrid Fourier/direct space convolution algorithm for compact radial (azimuthally symmetric) kernels on the sphere. For high resolution maps covering a large fraction of the sky, our implementation takes advantage of the inexpensive massive parallelism afforded by consumer graphics processing units (GPUs). Applications involve modeling of instrumental beam shapes in terms of compact kernels, computation of fine-scale wavelet transformations, and optimal filtering for the detection of point sources. Our algorithm works for any pixelization where pixels are grouped into isolatitude rings. Even for kernels that are not bandwidth limited, ringing features are completely absent on an ECP grid. We demonstrate that they can be highly suppressed on the popular HEALPix pixelization, for which we develop a freely available implementation of the algorithm. As an example application, we show that running on a high-end consumer graphics card our method speeds up beam convolution for simulations of a characteristic Planck high frequency instrument channel by two orders of magnitude compared to the commonly used HEALPix implementation on one CPU core while maintaining at typical a fractional RMS accuracy of about 1 part in 10^5.Comment: 10 pages, 6 figures. Submitted to Astronomy and Astrophysics. Replaced to match published version. Code can be downloaded at https://github.com/elsner/arkco

Fast calculation of the Fisher matrix for cosmic microwave background experiments

The Fisher information matrix of the cosmic microwave background (CMB) radiation power spectrum coefficients is a fundamental quantity that specifies the information content of a CMB experiment. In the most general case, its exact calculation scales with the third power of the number of data points N and is therefore computationally prohibitive for state-of-the-art surveys. Applicable to a very large class of CMB experiments without special symmetries, we show how to compute the Fisher matrix in only O(N^2 log N) operations as long as the inverse noise covariance matrix can be applied to a data vector in time O(l_max^3 log l_max). This assumption is true to a good approximation for all CMB data sets taken so far. The method takes into account common systematics such as arbitrary sky coverage and realistic noise correlations. As a consequence, optimal quadratic power spectrum estimation also becomes feasible in O(N^2 log N) operations for this large group of experiments. We discuss the relevance of our findings to other areas of cosmology where optimal power spectrum estimation plays a role.Comment: 4 pages, 1 figures. Accepted for publication in Astronomy and Astrophysics Letters. Replaced to match published versio

A note on the Guerra and Talagrand theorems for Mean Field Spin Glasses: the simple case of spherical models

The aim of this paper is to discuss the main ideas of the Talagrand proof of the Parisi Ansatz for the free-energy of Mean Field Spin Glasses with a physicist's approach. We consider the case of the spherical $p$-spin model, which has the following advantages: 1) the Parisi Ansatz takes the simple ``one step replica symmetry breaking form'', 2) the replica free-energy as a function of the order parameters is simple enough to allow for numerical maximization with arbitrary precision. We present the essential ideas of the proof, we stress its connections with the theory of effective potentials for glassy systems, and we reduce the technically more difficult part of the Talagrand's analysis to an explicit evaluation of the solution of a variational problem.Comment: 20 pages, 5 figures. Added references and minor language correction

Series Expansion of the Off-Equilibrium Mode Coupling Equations

We show that computing the coefficients of the Taylor expansion of the solution of the off-equilibrium dynamical equations characterizing models with quenched disorder is a very effective way to understand the long time asymptotic behavior. We study the $p=3$ spherical spin glass model, and we compute the asymptotic energy (in the critical region and down to $T=0$) and the coefficients of the time decay of the energy.Comment: 9 pages, LaTeX, 3 uuencoded figure

Covariant spectator theory of np scattering: Effective range expansions and relativistic deuteron wave functions

We present the effective range expansions for the 1S_0 and 3S_1 scattering phase shifts, and the relativistic deuteron wave functions that accompany our recent high precision fits (with chi^2/N{data} approx 1) to the 2007 world np data below 350 MeV. The wave functions are expanded in a series of analytical functions (with the correct asymptotic behavior at both large and small arguments) that can be Fourier-transformed from momentum to coordinate space and are convenient to use in any application. A fortran subroutine to compute these wave functions can be obtained from the authors.Comment: 32 pages, 14 figure

Using hybrid GPU/CPU kernel splitting to accelerate spherical convolutions

We present a general method for accelerating by more than an order of magnitude the convolution of pixelated functions on the sphere with a radially-symmetric kernel. Our method splits the kernel into a compact real-space component and a compact spherical harmonic space component. These components can then be convolved in parallel using an inexpensive commodity GPU and a CPU. We provide models for the computational cost of both real-space and Fourier space convolutions and an estimate for the approximation error. Using these models we can determine the optimum split that minimizes the wall clock time for the convolution while satisfying the desired error bounds. We apply this technique to the problem of simulating a cosmic microwave background (CMB) anisotropy sky map at the resolution typical of the high resolution maps produced by the Planck mission. For the main Planck CMB science channels we achieve a speedup of over a factor of ten, assuming an acceptable fractional rms error of order 1.e-5 in the power spectrum of the output map.Comment: 9 pages, 11 figures, 1 table, accepted by Astronomy & Computing w/ minor revisions. arXiv admin note: substantial text overlap with arXiv:1211.355