اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA multi-level solver for Gaussian constrained CMB realizations
82
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a multi-level solver for drawing constrained Gaussian realizations or finding the maximum likelihood estimate of the CMB sky, given noisy sky maps with partial sky coverage. The method converges substantially faster than existing Conjugate Gradient (CG) methods for the same problem. For instance, for the 143 GHz Planck frequency channel, only 3 multi-level W-cycles result in an absolute error smaller than 1 microKelvin in any pixel. Using 16 CPU cores, this translates to a computational expense of 6 minutes wall time per realization, plus 8 minutes wall time for a power spectrum-dependent precomputation. Each additional W-cycle reduces the error by more than an order of magnitude, at an additional computational cost of 2 minutes. For comparison, we have never been able to achieve similar absolute convergence with conventional CG methods for this high signal-to-noise data set, even after thousands of CG iterations and employing expensive preconditioners. The solver is part of the Commander 2 code, which is available with an open source license at http://commander.bitbucket.org/.
قيم البحث
اقرأ أيضاً
BICEP Array is the newest multi-frequency instrument in the BICEP/Keck Array program. It is comprised of four 550 mm aperture refractive telescopes observing the polarization of the cosmic microwave background (CMB) at 30/40, 95, 150 and 220/270 GHz
with over 30,000 detectors. We present an overview of the receiver, detailing the optics, thermal, mechanical, and magnetic shielding design. BICEP Array follows BICEP3s modular focal plane concept, and upgrades to 6 wafer to reduce fabrication with higher detector count per module. The first receiver at 30/40 GHz is expected to start observing at the South Pole during the 2019-20 season. By the end of the planned BICEP Array program, we project $sigma(r) sim 0.003$, assuming current modeling of polarized Galactic foreground and depending on the level of delensing that can be achieved with higher resolution maps from the South Pole Telescope.
Many problems in stellar astrophysics feature flows at low Mach numbers. Conventional compressible hydrodynamics schemes frequently used in the field have been developed for the transonic regime and exhibit excessive numerical dissipation for these f
lows. While schemes were proposed that solve hydrodynamics strictly in the low Mach regime and thus restrict their applicability, we aim at developing a scheme that correctly operates in a wide range of Mach numbers. Based on an analysis of the asymptotic behavior of the Euler equations in the low Mach limit we propose a novel scheme that is able to maintain a low Mach number flow setup while retaining all effects of compressibility. This is achieved by a suitable modification of the well-known Roe solver. Numerical tests demonstrate the capability of this new scheme to reproduce slow flow structures even in moderate numerical resolution. Our scheme provides a promising approach to a consistent multidimensional hydrodynamical treatment of astrophysical low Mach number problems such as convection, instabilities, and mixing in stellar evolution.
We present a method for beam deconvolution for cosmic microwave background (CMB) anisotropy measurements. The code takes as input the time-ordered data, along with the corresponding detector pointings and known beam shapes, and produces as output the
harmonic a_Tlm, a_Elm, and a_Blm coefficients of the observed sky. From these one can further construct temperature and Q and U polarisation maps. The method is applicable to absolute CMB measurements with wide sky coverage, and is independent of the scanning strategy. We test the code with extensive simulations, mimicking the resolution and data volume of Planck 30GHz and 70GHz channels, but with exaggerated beam asymmetry. We apply it to multipoles up to l=1700 and examine the results in both pixel space and harmonic space. We also test the method also in presence of white noise.
We propose an efficient numerical algorithm for the solution of diffeomorphic image registration problems. We use a variational formulation constrained by a partial differential equation (PDE), where the constraints are a scalar transport equation.
We use a pseudospectral discretization in space and second-order accurate semi-Lagrangian time stepping scheme for the transport equations. We solve for a stationary velocity field using a preconditioned, globalized, matrix-free Newton-Krylov scheme. We propose and test a two-level Hessian preconditioner. We consider two strategies for inverting the preconditioner on the coarse grid: a nested preconditioned conjugate gradient method (exact solve) and a nested Chebyshev iterative method (inexact solve) with a fixed number of iterations. We test the performance of our solver in different synthetic and real-world two-dimensional application scenarios. We study grid convergence and computational efficiency of our new scheme. We compare the performance of our solver against our initial implementation that uses the same spatial discretization but a standard, explicit, second-order Runge-Kutta scheme for the numerical time integration of the transport equations and a single-level preconditioner. Our improved scheme delivers significant speedups over our original implementation. As a highlight, we observe a 20$times$ speedup for a two dimensional, real world multi-subject medical image registration problem.
We describe the structure and implementation of a moving-mesh hydrodynamics solver in the large-scale parallel code, Charm N-body GrAvity solver (ChaNGa). While largely based on the algorithm described by Springel (2010) that is implemented in AREPO,
our algorithm differs a few aspects. We describe our use of the Voronoi tessellation library, VORO++, to compute the Voronoi tessellation directly. We also incorporate some recent advances in gradient estimation and reconstruction that gives better accuracy in hydrodynamic solutions at minimal computational cost. We validate this module with a small battery of test problems against the smooth particle hydrodynamics solver included in ChaNGa. Finally, we study one example of a scientific problem involving the mergers of two main sequence stars and highlight the small quantitative differences between smooth particle and moving-mesh hydrodynamics. We close with a discussion of anticipated future improvements and advancements.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
