Search NASA⌕ Search

SEARCH · Search NASA

Results for “Hybrid Monte Carlo algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

A Cartesian-diffusion Langevin method for hybrid kinetic-fluid Coulomb scattering in particle-in-cell plasma simulations

A novel, drag-diffusion Langevin method of hybrid, kinetic-fluid Coulomb scattering in plasmas is presented. Unlike previous methods, the frictional drag is always applied in the simulation frame of reference. The velocity-space diffusion is performed in the stationary-fluid frame of reference when anisotropic, and in the laboratory frame when isotropic. While the general method is mass-ratio independent, we focus on interactions of kinetic-ions and fluid-electrons to show first-order modifications to the electron velocity distribution function that are an important correction for the accurate calculation of electric resistivity. Inclusion of sub-cycling and a limit to the maximum collision frequency is shown to allow for arbitrarily large timesteps without numerical failure. Here the Langevin method is compared with a grid-based binary method and found to require a much less restrictive timestep in cases of ion–electron slowing and temperature equilibration; this finding differs from previous work and is dependent on the mass ratio.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Rapid simulation of X-ray scatter measurements for threat detection via GPU-based ray-tracing

Scatter-based X-ray imaging has increased in prominence in areas ranging from cancer diagnostics to threat detection in aviation security, due largely to the development of new algorithms and components over the last decade. However, system design and algorithm development are often hindered by an inability to generate a sucient amount of accurate data. To further the development of scatter-based systems, we created a rapid X-ray scatter simulation tool built with a GPU-centric, parallel ray-tracing framework (NVIDIA OptiX). This tool models a full range of X-ray imaging components and describes 3D objects formed with heterogeneous media using polygon meshes. The scatter simulation algorithm we used is similar to the previously-described hybrid approach; however, instead of employing Monte Carlo techniques, we developed a purely analytical algorithm to sample the distribution of single-scatter events throughout the region of interest. The contribution of scattered photons to the measured signal is then calculated using the first-Born approximation. Here, the accuracy of the implemented pipeline has been validated by comparing simulated against experimental data obtained with a laboratory X-ray scattering system and phantoms of varied materials. Using a single desktop computer with an NVIDIA GTX 770 GPU, we show that the scatter signal generated by an incident fan beam and recorded by a 125 125 element detector array can be simulated in on the order of a few to tens of minutes (depending on the object extent and complexity). As a point of comparison, simulations performed via CPU-based Monte Carlo tools, such as GEANT4 (i.e., the gold standard), can take up to tens of hours to achieve comparable results.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Multiscale Monte Carlo equilibration: Pure Yang-Mills theory

In this study, we present a multiscale thermalization algorithm for lattice gauge theory, which enables efficient parallel generation of uncorrelated gauge field configurations. The algorithm combines standard Monte Carlo techniques with ideas drawn from real space renormalization group and multigrid methods. We demonstrate the viability of the algorithm for pure Yang-Mills gauge theory for both heat bath and hybrid Monte Carlo evolution, and show that it ameliorates the problem of topological freezing up to controllable lattice spacing artifacts.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A hybrid Monte Carlo, discontinuous Galerkin method for linear kinetic transport equations

Here we present a hybrid method for time-dependent particle transport problems that combines Monte Carlo (MC) estimation with deterministic solutions based on discrete ordinates. For spatial discretizations, the MC algorithm computes a piecewise constant solution and the discrete ordinates use bilinear discontinuous finite elements. From the hybridization of the problem, the resulting problem solved by Monte Carlo is scattering free, resulting in a simple, efficient solution procedure. Between time steps, we use a projection approach to “relabel” collided particles as uncollided particles. In conclusion, from a series of standard 2-D Cartesian test problems we observe that our hybrid method has improved accuracy and reduction in computational complexity of approximately an order of magnitude relative to standard discrete ordinates solutions.

97 MATHEMATICS AND COMPUTING↗

Interaction-expansion inchworm Monte Carlo solver for lattice and impurity models

Multiorbital quantum impurity models with general interaction and hybridization terms appear in a wide range of applications, including embedding, quantum transport, and nanoscience. However, most quantum impurity solvers are restricted to a few impurity orbitals, discretized baths, diagonal hybridizations, or density-density interactions. We generalize the inchworm quantum Monte Carlo method to the interaction expansion, and we explore its application to typical single- and multiorbital problems encountered in investigations of impurity and lattice models. Our implementation generically outperforms bare and bold-line quantum Monte Carlo algorithms in the interaction expansion. For the systems studied here, our implementation remains inferior to the more specialized hybridization expansion and auxiliary field algorithms. So, the problem of convergence to unphysical fixed points, which hampers so-called bold-line methods, is not encountered in inchworm Monte Carlo.

36 MATERIALS SCIENCE↗

Assessment of Model-Based Schemes for Accelerating Optimization by RAVEN

Nuclear-Renewable Hybrid Energy Systems (N-R HES) combine different energy technologies in a synergistic way with the objective of achieving a more economical energy production. In this report the particular hybrid system dealt with includes a PWR nuclear reactor, the associated Rankine-based energy conversion cycle (Balance of Plant, BOP), an Industrial Process (IP) for hydrogen production, a gas turbine (Second Energy Source, SES), and a battery (Energy Storage, ES). The RAVEN-based HYBRID framework is used to find the optimal installed capacity and the optimal economical dispatch of each component of the N-R HES. HYBRID solves the coupled capacity planning-economic and dispatch optimization problem with the objective of minimizing the Levelized Cost of Electricity (LCOE). In the optimization of the power dispatch strategy, the HYBRID framework takes into account the time-dependent dynamics of each subsystem by including a Dymola object-oriented model of the process dynamics. To ease the computational burden of the optimization process, an initial guess for the dispatch optimization problem is provided by a preconditioner. The solution guess is calculated by means of a least-marginal cost approach which applies the same criterion behind the screening curve method. Though this algorithm allows evaluating an economically adapted generation mix for a target load duration curve within a few seconds, it neglects the constraints due to the single component dynamics, and it is not able to adequately represent the ES. An improved treatment of the pre-conditioner problem was addressed by introducing a Monte Carlo based optimization algorithm. The new approach takes into account limits on power rates for the system subcomponents, which was not previously done. Additionally, this new Monte-Carlo based preconditioner addresses the problem with the ES component through improved modeling of that component. The new algorithm has been implemented in the HYBRID framework and tested to assess its performance. The results obtained with the new Monte Carlobased preconditioner were benchmarked against those obtained through the reference deterministic approach. The comparison shows that the Monte-Carlo based approach provides improved solution accuracy to the power dispatch optimization problem. Also in this report, the treatment of the penalty function on LCOE is discussed, and an improved penalty function for missed demand is suggested and tested.

Maronati, Giovanni↗

Integrating machine learning interatomic potentials with hybrid reverse Monte Carlo structure refinements in RMCProfile

Structure refinement with reverse Monte Carlo (RMC) is a powerful tool for interpreting experimental diffraction data. To ensure that the under-constrained RMC algorithm yields reasonable results, the hybrid RMC approach applies interatomic potentials to obtain solutions that are both physically sensible and in agreement with experiment. To expand the range of materials that can be studied with hybrid RMC, we have implemented a new interatomic potential constraint in RMCProfile that grants flexibility to apply potentials supported by the Large-scale Atomic/Molecular Massively Parallel Simulator ( LAMMPS ) molecular dynamics code. This includes machine learning interatomic potentials, which provide a pathway to applying hybrid RMC to materials without currently available interatomic potentials. To this end, we present a methodology to use RMC to train machine learning interatomic potentials for hybrid RMC applications.

Cuillier, Paul↗

Restricted Boltzmann Machines for galaxy morphology classification with a quantum annealer

We present the application of Restricted Boltzmann Machines (RBMs) to the task of astronomical image classification using a quantum annealer built by D-Wave Systems. Morphological analysis of galaxies provides critical information for studying their formation and evolution across cosmic time scales. We compress the images using principal component analysis to fit a representation on the quantum hardware. Then, we train RBMs with discriminative and generative algorithms, including contrastive divergence and hybrid generative-discriminative approaches. We compare these methods to Quantum Annealing (QA), Markov Chain Monte Carlo (MCMC) Gibbs Sampling, Simulated Annealing (SA) as well as machine learning algorithms like gradient boosted decision trees. We find that RBMs implemented on D-wave hardware perform well, and that they show some classification performance advantages on small datasets, but they don't offer a broadly strategic advantage for this task. During this exploration, we analyzed the steps required for Boltzmann sampling with the D-Wave 2000Q, including a study of temperature estimation, and examined the impact of qubit noise by comparing and contrasting the original D-Wave 2000Q to the lower-noise version recently made available. While these analyses ultimately had minimal impact on the performance of the RBMs, we include them for reference.

79 ASTRONOMY AND ASTROPHYSICS↗

Multi-node and Multi-core Performance Studies of a Monte Carlo code RMC

Over the past 15 years the architecture of high-performance computing systems has become increasingly heterogeneous with individual computing cores being subdivided into nodes and even auxiliary co-processing units such as graphics processing units or the Intel many integrated core co-processors. In fact, future computer platforms is moving toward a larger number of nodes and cores with lower memory available per node. Today, several production Monte Carlo codes use some types of hybrid parallelism strategy that makes use of shared-memory parallelism within a computing node and message-passing parallelism between nodes, which enables the codes to utilize available computing resources as much as possible, both among and within computing nodes on a cluster. The so-called hybrid parallelization is also possible with Reactor Monte Carlo Code RMC by activating both MPI and OpenMP parallel algorithms together. On HPC' which typically consists of several or several-ten thousand nodes equipping 16-32 computing intra-cores per node, simulation of RMC can be carried out in the hybrid parallelization with the MPI inter-node parallelization and the OpenMP intra-node parallelization. RMC has adopted a hybrid message-passing and shared-memory approach to parallelism, which enables the code to utilize available computing resources, both among and within computing nodes on a cluster. Shared-memory parallelism is especially valuable for large-model simulations because it enables multiple compute cores within a node to share common model information such as the geometry description, material, cross section and tally data, thus reducing the memory usage per processor. The calculation on the Tianhe-2 supercomputer took 6144 cores, resulting in a rate of 173,314,000 neutrons/minute for BEAVRS benchmark. While pin-wise full core H-M benchmark burnup calculations with millions of depletion regions was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 1,843,200 burnable regions per minute. Keeping up with the continuing trend for increases in the number of computing resources within modern HPC systems is a significant challenge for teams that develop and maintain high-performance MC radiation transport solvers. order to address this challenge, RMC has adopted a hybrid message-passing and shared-memory approach to parallelism, which enables the code to utilize available computing resources, both among and within computing nodes on a cluster. Shared-memory parallelism is especially valuable for large-model simulations because it enables multiple compute cores within a node to share common model information such as the geometry description, material and composition definitions, and cross section data, thus reducing the memory usage per processor. The parallel performance has been studied by using two complex and representative benchmarks, H-M and BEAVRS benchmark. All simulations were run on Intel Xeon E5-2692 12 core, 2.2 GHz processors at MilkyWay-2 Super Computer with up to 12,288 available computing cores. While employing MPI parallelism, excellent parallel efficiency is achieved even above 12,000 processors and RMC reaches the parallel efficiency of 96% on 12,288 cores for the pin-by-pin computation of the BEAVRS benchmark. While BEAVRS criticality benchmark was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 173,314,000 particles per minute. While pin-wise full core H-M benchmark burnup calculations with millions of depletion regions was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 1,843,200 burnable regions per minute. Results from these studies demonstrate that RMC, using the hybrid parallel model described in this paper, is able to handle pin-wise full core burnup calculations with millions of depletion regions and scales well through thousands of processors. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

SmoQyDQMC.jl: A flexible implementation of determinant quantum Monte Carlo for Hubbard and electron-phonon interactions

We introduce the SmoQyDQMC.jl package, a Julia implementation of the determinant quantum Monte Carlo algorithm. SmoQyDQMC.jl supports generalized tight-binding Hamiltonians with on-site Hubbard and generalized electron-phonon ( e e -ph) interactions, including non-linear e e -ph coupling and anharmonic lattice potentials. Our implementation uses hybrid Monte Carlo methods with exact forces for sampling the phonon fields, enabling efficient simulation of low-energy phonon branches, including acoustic phonons. The SmoQyDQMC.jl package also uses a flexible scripting interface, allowing users to adapt it to different workflows and interface with other software packages in the Julia ecosystem. The code for this package can be downloaded from our GitHub repository at https://github.com/SmoQySuite/SmoQyDQMC.jl or installed using the Julia package manager. The online documentation, including examples, can be obtained from our document page at https://smoqysuite.github.io/SmoQyDQMC.jl/stable/.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Codebase release r0.3 for SmoQyDQMC.jl

We introduce the SmoQyDQMC.jl package, a Julia implementation of the determinant quantum Monte Carlo algorithm. SmoQyDQMC.jl supports generalized tight-binding Hamiltonians with on-site Hubbard and generalized electron-phonon ( e e -ph) interactions, including non-linear e e -ph coupling and anharmonic lattice potentials. Our implementation uses hybrid Monte Carlo methods with exact forces for sampling the phonon fields, enabling efficient simulation of low-energy phonon branches, including acoustic phonons. The SmoQyDQMC.jl package also uses a flexible scripting interface, allowing users to adapt it to different workflows and interface with other software packages in the Julia ecosystem. The code for this package can be downloaded from our GitHub repository at https://github.com/SmoQySuite/SmoQyDQMC.jl or installed using the Julia package manager. The online documentation, including examples, can be obtained from our document page at https://smoqysuite.github.io/SmoQyDQMC.jl/stable/.

Cohen-Stead, Benjamin (ORCID:0000000279156280)↗

Correction for patient table-induced scattered radiation in cone-beam computed tomography (CBCT)

Purpose: In image-guided radiotherapy, an artifact typically seen in axial slices of x-ray cone-beam computed tomography (CBCT) reconstructions is a dark region or ''black hole'' situated below the scan isocenter. The authors trace the cause of the artifact to scattered radiation produced by radiotherapy patient tabletops and show it is linked to the use of the offset-detector acquisition mode to enlarge the imaging field-of-view. The authors present a hybrid scatter kernel superposition (SKS) algorithm to correct for scatter from both the object-of-interest and the tabletop. Methods: Monte Carlo simulations and phantom experiments were first performed to identify the source of the black hole artifact. For correction, a SKS algorithm was developed that uses separate kernels to estimate scatter from the patient tabletop and the object-of-interest. Each projection is divided into two regions, one defined by the shadow cast by the tabletop on the imager and one defined by the unshadowed region. The region not shadowed by the tabletop is processed using the recently developed fast adaptive scatter kernel superposition (fASKS) method which employs asymmetric kernels that best model scatter transport through bodylike objects. The shadowed region is convolved with a combination of slab-derived symmetric SKS kernels and asymmetric fASKS kernels. The composition of the hybrid kernels is projection-angle-dependent. To test the algorithm, pelvis phantom and in vivo data were acquired using a CBCT test stand, a Varian Acuity simulator, and a Varian On-Board Imager, all of which have similar geometries and components. Artifact intensities and Hounsfield unit (HU) accuracies in the reconstructions were assessed before and after the correction. Results: The hybrid kernel algorithm provided effective correction and produced substantially better scatter estimates than the symmetric SKS or asymmetric fASKS methods alone. HU nonuniformities in the reconstructed pelvis phantom were reduced from 220 to 50 HU (i.e., 22%-5%). In the in vivo scans, the black hole artifact was reduced by up to 147 HU, a 73% improvement, and anatomical details in the prostate and rectum areas were made considerably more visible. Conclusions: Radiotherapy tabletops, which are generally flatter and larger than those used for diagnostic CT, can produce significant scatter-related artifacts. The proposed hybrid SKS algorithm accurately estimates scatter from both the object-of-interest and the patient tabletop, and resulting image uniformities and HU accuracies are greatly improved.

60 APPLIED LIFE SCIENCES↗

Conceptual design of a hybrid neutron-gamma detector for study of β-delayed neutrons at the RIB facility of RIKEN

Here, the conceptual design of the BRIKEN neutron detector at the radioactive ion beam factory (RIBF) of the RIKEN Nishina Center is reported. The BRIKEN setup is a complex system aimed at detecting heavy-ion implants, β particles, γ rays and β-delayed neutrons. The whole setup includes the Advanced Implantation Detection Array (AIDA), two HPGe Clover detectors and up to 166 3 He-filled counters embedded in a high-density polyethylene moderator. The design is quite complex due to the large number and different types of 3 He-tubes involved and the additional constraints introduced by the ancillary detectors for charged particles and γ rays. This article reports on a novel methodology developed for the conceptual design and optimisation of the 3 He-counter array, aiming for the best possible performance in terms of neutron detection. The algorithm is based on a geometric representation of two selected detector parameters of merit, namely, the average neutron detection efficiency and the efficiency flatness as a function of a reduced number of geometric variables. The response of the neutron detector is obtained from a systematic Monte Carlo simulation implemented in GEANT4. The robustness of the algorithm allowed us to design a versatile detection system, which operated in hybrid mode includes the full neutron counter and two clover detectors for high-precision gamma spectroscopy. In addition, the system can be reconfigured into a compact mode by removing the clover detectors and re-arranging the 3 He tubes in order to maximize the neutron detection performance. Both operation modes shows a rather flat and high average efficiency. In summary, we have designed a system which shows an average efficiency for hybrid mode ( 3 He tubes + clovers) of 68.6% and 64% for neutron energies up to 1 and 5 MeV, respectively. For compact mode (only 3 He tubes), the average efficiency is 75.7% and 71% for neutron energies up to 1 and 5 MeV, respectively. The performance of the BRIKEN detection system has been also quantified by means of Monte Carlo simulations with different neutron energy distributions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Forward-Weighted CADIS Method for Variance Reduction of Monte Carlo Reactor Analyses

Current state-of-the-art tools and methods used to perform 'real' commercial reactor analyses use high-fidelity transport codes to produce few-group parameters at the assembly level for use in low-order methods applied at the core level. Monte Carlo (MC) methods, which allow detailed and accurate modeling of the full geometry and energy details and are considered the 'gold standard' for radiation transport solutions, are playing an ever-increasing role in correcting and/or verifying the several-decade-old methodology used in current practice. However, the prohibitive computational requirements associated with obtaining fully converged system-wide solutions restrict the role of MC to benchmarking deterministic results at a limited number of state-points for a limited number of relevant quantities. A goal of current research at Oak Ridge National Laboratory (ORNL) is to change this paradigm by enabling the direct use of MC for full-core reactor analyses. The most significant of the many technical challenges that must be overcome is the slow non-uniform convergence of system-wide MC estimates and the memory requirements associated with detailed solutions throughout a reactor (problems involving hundreds of millions of different material and tally regions due to fuel irradiation, temperature distributions, and the needs associated with multi-physics code coupling). To address these challenges, research has focused on development in the following two areas: (1) a hybrid deterministic/MC method for determining high-precision fluxes throughout the problem space in k-eigenvalue problems and (2) an efficient MC domain-decomposition algorithm that partitions the problem phase space onto multiple processors for massively parallel systems, with statistical uncertainty estimation. The focus of this paper is limited to the first area mentioned above. It describes the FW-CADIS method applied to variance reduction of MC reactor analyses and provides initial results for calculating group-wise fluxes throughout a generic 2-D pressurized water reactor (PWR) quarter core model.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A hybrid approach to the neutron transport K-eigenvalue problem using NDA-based algorithms

In order to provide more physically accurate solutions to the neutron transport equation it has become increasingly popular to use Monte Carlo simulation to model nuclear reactor dynamics. These Monte Carlo methods can be extremely expensive, so we turn to a class of methods known as hybrid methods, which combine known deterministic and stochastic techniques to solve the transport equation. In our work, we show that we can simulate the action of a transport sweep using a Monte Carlo simulation in order to solve the k-eigenvalue problem. We'll accelerate the solution using nonlinear diffusion acceleration (NDA) as in [1,2]. Our work extends the results in [1] to use Monte Carlo simulation as the high-order solver. (authors)

97 MATHEMATICS AND COMPUTING↗

A hybrid approach for rapid, accurate, and direct kilovoltage radiation dose calculations in CT voxel space

Purpose: To develop and validate a fast and accurate method that uses computed tomography (CT) voxel data to estimate absorbed radiation dose at a point of interest (POI) or series of POIs from a kilovoltage (kV) imaging procedure. Methods: The authors developed an approach that computes absorbed radiation dose at a POI by numerically evaluating the linear Boltzmann transport equation (LBTE) using a combination of deterministic and Monte Carlo (MC) techniques. This hybrid approach accounts for material heterogeneity with a level of accuracy comparable to the general MC algorithms. Also, the dose at a POI is computed within seconds using the Intel Core i7 CPU 920 2.67 GHz quad core architecture, and the calculations are performed using CT voxel data, making it flexible and feasible for clinical applications. To validate the method, the authors constructed and acquired a CT scan of a heterogeneous block phantom consisting of a succession of slab densities: Tissue (1.29 cm), bone (2.42 cm), lung (4.84 cm), bone (1.37 cm), and tissue (4.84 cm). Using the hybrid transport method, the authors computed the absorbed doses at a set of points along the central axis and x direction of the phantom for an isotropic 125 kVp photon spectral point source located along the central axis 92.7 cm above the phantom surface. The accuracy of the results was compared to those computed with MCNP, which was cross-validated with EGSnrc, and served as the benchmark for validation. Results: The error in the depth dose ranged from -1.45% to +1.39% with a mean and standard deviation of -0.12% and 0.66%, respectively. The error in the x profile ranged from -1.3% to +0.9%, with standard deviations of -0.3% and 0.5%, respectively. The number of photons required to achieve these results was 1x10{sup 6}. Conclusions: The voxel-based hybrid method evaluates the LBTE rapidly and accurately to estimate the absorbed x-ray dose at any POI or series of POIs from a kV imaging procedure.

60 APPLIED LIFE SCIENCES↗

Particle filtering with path sampling and an application to a bimodal ocean current model

This paper introduces a recursive particle filtering algorithm designed to filter high dimensional systems with complicated non-linear and non-Gaussian effects. The method incorporates a parallel marginalization (PMMC) step in conjunction with the hybrid Monte Carlo (HMC) scheme to improve samples generated by standard particle filters. Parallel marginalization is an efficient Markov chain Monte Carlo (MCMC) strategy that uses lower dimensional approximate marginal distributions of the target distribution to accelerate equilibration. As a validation the algorithm is tested on a 2516 dimensional, bimodal, stochastic model motivated by the Kuroshio current that runs along the Japanese coast. The results of this test indicate that the method is an attractive alternative for problems that require the generality of a particle filter but have been inaccessible due to the limitations of standard particle filtering strategies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The XFaster Power Spectrum and Likelihood Estimator for the Analysis of Cosmic Microwave Background Maps

We present the XFaster analysis package, XFaster is a fast, iterative angular power spectrum estimator based on a diagonal approximation to the quadratic Fisher matrix estimator. XFaster uses Monte Carlo simulations to compute noise biases and filter transfer functions and is thus a hybrid of both Monte Carlo and quadratic estimator methods. In contrast to conventional pseudo-C ℓ based methods, the algorithm described here requires a minimal number of simulations, and does not require them to be precisely representative of the data to estimate accurate covariance matrices for the bandpowers. The formalism works with polarization-sensitive observations and also data sets with identical, partially overlapping, or independent survey regions. The method was first implemented for the analysis of BOOMERanG data (Netterfield et al. 2002; Jones et al. 2006), and also used as part of the Planck analysis (Rocha et al. 2011). Here, we describe the full, publicly available analysis package, written in Python, as developed for the analysis of data from the 2015 flight of the SPIDER instrument (SPIDER Collaboration 2021). The package includes extensions for self-consistently estimating null spectra and for estimating fits for Galactic foreground contributions. We show results from the extensive validation of XFaster using simulations, and its application to the SPIDER data set.

79 ASTRONOMY AND ASTROPHYSICS↗