Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPreconditioner-free Wiener filtering with a dense noise matrix
103
0
0.0
(
0
)
Added by
Kevin M. Huffenberger
Publication date
2017
fields
Physics
and research's language is
English
Authors
Kevin M. Huffenberger
Ask ChatGPT about the research
No Arabic abstract
This work extends the Elsner & Wandelt (2013) iterative method for efficient, preconditioner-free Wiener filtering to cases in which the noise covariance matrix is dense, but can be decomposed into a sum whose parts are sparse in convenient bases. The new method, which uses multiple messenger fields, reproduces Wiener filter solutions for test problems, and we apply it to a case beyond the reach of the Elsner & Wandelt (2013) method. We compute the Wiener filter solution for a simulated Cosmic Microwave Background map that contains spatially-varying, uncorrelated noise, isotropic $1/f$ noise, and large-scale horizontal stripes (like those caused by the atmospheric noise). We discuss simple extensions that can filter contaminated modes or inverse-noise filter the data. These techniques help to address complications in the noise properties of maps from current and future generations of ground-based Microwave Background experiments, like Advanced ACTPol, Simons Observatory, and CMB-S4.
rate research
Read More
We present an augmented version of our dual messenger algorithm for spin field reconstruction on the sphere, while accounting for highly non-trivial and realistic noise models such as modulated correlated noise. We also describe an optimization method for the estimation of noise covariance from Monte Carlo simulations. Using simulated Planck polarized cosmic microwave background (CMB) maps as a showcase, we demonstrate the capabilities of the algorithm in reconstructing pure E and B maps, guaranteed to be free from ambiguous modes resulting from the leakage or coupling issue that plagues conventional methods of E/B separation. Due to its high speed execution, coupled with lenient memory requirements, the algorithm can be optimized in exact global Bayesian analyses of state-of-the-art CMB data for a statistically optimal separation of pure E and B modes. Our algorithm, therefore, has a potentially key role in the data analysis of high-resolution and high-sensitivity CMB data, especially with the range of upcoming CMB experiments tailored for the detection of the elusive primordial B-mode signal.
A heuristic greedy algorithm is developed for efficiently tiling spatially dense redshift surveys. In its first application to the Galaxy and Mass Assembly (GAMA) redshift survey we find it rapidly improves the spatial uniformity of our data, and naturally corrects for any spatial bias introduced by the 2dF multi object spectrograph. We make conservative predictions for the final state of the GAMA redshift survey after our final allocation of time, and can be confident that even if worse than typical weather affects our observations, all of our main survey requirements will be met.
This paper considers a version of the Wiener filtering problem for equalization of passive quantum linear quantum systems. We demonstrate that taking into consideration the quantum nature of the signals involved leads to features typically not encountered in classical equalization problems. Most significantly, finding a mean-square optimal quantum equalizing filter amounts to solving a nonconvex constrained optimization problem. We discuss two approaches to solving this problem, both involving a relaxation of the constraint. In both cases, unlike classical equalization, there is a threshold on the variance of the noise below which an improvement of the mean-square error cannot be guaranteed.
We derive an optimal linear filter to suppress the noise from the COBE DMR sky maps for a given power spectrum. We then apply the filter to the first-year DMR data, after removing pixels within $20^circ$ of the Galactic plane from the data. The filtered data have uncertainties 12 times smaller than the noise level of the raw data. We use the formalism of constrained realizations of Gaussian random fields to assess the uncertainty in the filtered sky maps. In addition to improving the signal-to-noise ratio of the map as a whole, these techniques allow us to recover some information about the CMB anisotropy in the missing Galactic plane region. From these maps we are able to determine which hot and cold spots in the data are statistically significant, and which may have been produced by noise. In addition, the filtered maps can be used for comparison with other experiments on similar angular scales.
A parallel and nested version of a frequency filtering preconditioner is proposed for linear systems corresponding to diffusion equation on a structured grid. The proposed preconditioner is found to be robust with respect to jumps in the diffusion coefficients. The storage requirement for the preconditioner is O(N),where N is number of rows of matrix, hence, a fairly large problem of size more than 42 million unknowns has been solved on a quad core machine with 64GB RAM. The parallelism is achieved using twisted factorization and SIMD operations. The preconditioner achieves a speedup of 3.3 times on a quad core processor clocked at 4.2 GHz, and compared to a well known algebraic multigrid method, it is significantly faster in both setup and solve times for diffusion equations with jumps.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
