Search NASA⌕ Search

SEARCH · Search NASA

Results for “multiple iterations”

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 163 records · Page 9

MC-15 Users Manual

The current iteration of field -capable neutron multiplicity counters is the Multiplicity Counter 15 tube detector (MC-15) shown in Figure 1. This was a tri-lab effort between Los Alamos National Laboratory (LANL), Lawrence Livermore National Laboratory (LLNL), and Sandia National Laboratories (SNL). The MC-15 incorporates significant improvements over previous man-portable neutron multiplicity counters of the LANL NPOD and the Ortec Fission Meter™. These improvements include finer time resolution of 100 ns, more advanced on-board computing power for near-real-time onboard analysis, a sunlight readable color touchscreen for ease of use, a USB 2.0 interface for data transfer, and hot-swappable rechargeable batteries that provide 14 hours of run time.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Safeguards-Informed Hybrid Imagery Dataset [Poster]

Deep Learning computer vision models require many thousands of properly labelled images for training, which is especially challenging for safeguards and nonproliferation, given that safeguards-relevant images are typically rare due to the sensitivity and limited availability of the technologies. Creating relevant images through real-world staging is costly and limiting in scope. Expert-labeling is expensive, time consuming, and error prone. We aim to develop a data set of both realworld and synthetic images that are relevant to the nuclear safeguards domain that can be used to support multiple data science research questions. In the process of developing this data, we aim to develop a novel workflow to validate synthetic images using machine learning explainability methods, testing among multiple computer vision algorithms, and iterative synthetic data rendering. We will deliver one million images – both real-world and synthetically rendered – of two types uranium storage and transportation containers with labelled ground truth and associated adversarial examples.

97 MATHEMATICS AND COMPUTING↗

Progress Towards A Measurement of Neutrino Induced Charged Current Neutral Pion Production in the MicroBooNE Experiment

An analysis of MicroBooNE data with a signal of one muon, one neutral pion, and no charged pions is presented. Studying neutral pion production in the MicroBooNE detector provides an opportunity to better understand neutrino-argon interactions, and is crucial for future accelerator-based neutrino oscillation experiments. This analysis presents the progress towards the first measurement of the differential cross section for charged current (CC) $π^0$ production in neutrino-argon interactions. Using a dataset corresponding to about 7 × 10 20 protons on target (POT), we present an analysis which aims to measure the single differential cross sections as a function of the $π^0$ kinematic variables such as momentum and scattering angle. The Wiener-SVD technique for unfolding the measurement is presented and demonstrated using multiple generator predictions. A future iteration of this analysis will compare an unfolded data measurement to these models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The use of coherence functions to determine dynamic excitation sources on launch vehicle payloads

The problem of determining the relative contribution of simultaneous acoustic and mechanical inputs to the response of structures under combined dynamic loads was studied. An analytical technique developed by Bendat for calculating ordinary, partial, and multiple coherence functions, using an iterative nonmatrix approach was applied to data obtained from laboratory tests on a complex structural assembly. Testing was performed in an acoustically 'live' room. Up to three random inputs, having similar spectral content and varying degrees of mutual coherence, and a single output were used. Stationary and nonstationary inputs were used. It was concluded that the technique provided an effective method of identifying sources of dynamic excitation and evaluating their relative contributions to the measured output at structural resonances, for stationary random inputs. An attempt to apply the technique to nonstationary inputs did not yield consistent results.

Barrett, S.↗

Numerical Simulation of 3-D Supersonic Viscous Flow in an Experimental MHD Channel

The 3-D supersonic viscous flow in an experimental MHD channel has been numerically simulated. The experimental MHD channel is currently in operation at NASA Ames Research Center. The channel contains a nozzle section, a center section, and an accelerator section where magnetic and electric fields can be imposed on the flow. In recent tests, velocity increases of up to 40% have been achieved in the accelerator section. The flow in the channel is numerically computed using a new 3-D parabolized Navier-Stokes (PNS) algorithm that has been developed to efficiently compute MHD flows in the low magnetic Reynolds number regime. The MHD effects are modeled by introducing source terms into the PNS equations which can then be solved in a very e5uent manner. To account for upstream (elliptic) effects, the flowfield can be computed using multiple streamwise sweeps with an iterated PNS algorithm. The new algorithm has been used to compute two test cases that match the experimental conditions. In both cases, magnetic and electric fields are applied to the flow. The computed results are in good agreement with the available experimental data.

Kato, Hiromasa↗

CAISSON: Interconnect Network Simulator

Cray response to HPCS initiative. Model future petaflop computer interconnect. Parallel discrete event simulation techniques for large scale network simulation. Built on WarpIV engine. Run on laptop and Altix 3000. Can be sized up to 1000 simulated nodes per host node. Good parallel scaling characteristics. Flexible: multiple injectors, arbitration strategies, queue iterators, network topologies.

network simulation↗

3D-MAT Multi-rate Thermal Expansion and Restrained Thermal Growth

In an effort to characterize 3D Multifunctional Ablative Thermal Protection System (3D-MAT), a quartz fiber / cyanate ester composite for NASA’s Orion Multipurpose Crew Vehicle, Southern Research carried out multiple test efforts. Southern Research evaluated the coefficient of free thermal expansion at multiple heating rates in the X, Y and Z directions. To further understand the results, we further evaluated the material via Restrained Thermal Growth (RTG) in the X direction. The RTG test series involved testing via multiple procedures, resulting in an iterative process and a final conclusion.

Jay D Feldman↗

Advanced Nodal P 3 /SP 3 Axial Transport Solvers for the MPACT 2D/1D Scheme

As part of its initiative to provide multiphysics simulations of nuclear reactor cores, the Consortium for Advanced Simulation of Light Water Reactors (CASL) is developing the Virtual Environment for Reactor Applications Core Simulator (VERA-CS). The MPACT code, which is the primary neutron transport solver of VERA-CS, employs the two-dimensional/one-dimensional (2D/1D) method to solve 3-dimensional neutron transport problems and provide sub-pin-level resolution of the power distribution. While 2D method of characteristics is used to solve for the transport effects within each plane, 1D-nodal methods are used axially. There have been extensive studies of the 2D/1D method with a variety nodal methods, and the P 3 /SP 3 solver has proved to be an effective method of providing higher-fidelity solutions while maintaining a low computational burden.The current implementation in MPACT wraps a one-node nodal expansion method (NEM) kernel for each moment, iterating between them and performing multiple sweeps to resolve flux distributions. However, it has been observed that this approach is more sensitive to convergence problems. This paper documents the theory and application two new nodal P 3 /SP 3 approaches to be used within the 2D/1D method in MPACT. These two approaches aim to provide enhanced stability compared with the pre-existing one-node approach. Results from the HY-NEM-SP 3 solver show that the accuracy is consistent with the one-node formulations and provides improved convergence for some problems; but the solver has issues with cases in thin planes. Although the 2N-SENM-SP 3 solver is still under development, it is intended to resolve the issues with HY-NEM-SP 3 but it will incur some additional computational burden by necessitating an additional 1D-CMFD-P 3 solver to generate the second moment cell-averaged scalar flux.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Pushing memory bandwidth limitations through efficient implementations of Block-Krylov space solvers on GPUs

Lattice quantum chromodynamics simulations in nuclear physics have benefited from a tremendous number of algorithmic advances such as multigrid and eigenvector deflation. These improve the time to solution but do not alleviate the intrinsic memory-bandwidth constraints of the matrix-vector operation dominating iterative solvers. Batching this operation for multiple vectors and exploiting cache and register blocking can yield a super-linear speed up. Block-Krylov solvers can naturally take advantage of such batched matrix-vector operations, further reducing the iterations to solution by sharing the Krylov space between solves. However, practical implementations typically suffer from the quadratic scaling in the number of vector-vector operations. Here, using the QUDA library, we present an implementation of a block-CG solver on NVIDIA GPUs which reduces the memory-bandwidth complexity of vector-vector operations from quadratic to linear. We present results for the HISQ discretization, showing a 5x speedup compared to highly-optimized independent Krylov solves on NVIDIA's SaturnV cluster.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks

In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l-∝ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. Additionally, we further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.

97 MATHEMATICS AND COMPUTING↗

Multiple zeros of polynomials

For polynomials of higher degree, iterative numerical methods must be used. Four iterative methods are presented for approximating the zeros of a polynomial using a digital computer. Newton's method and Muller's method are two well known iterative methods which are presented. They extract the zeros of a polynomial by generating a sequence of approximations converging to each zero. However, both of these methods are very unstable when used on a polynomial which has multiple zeros. That is, either they fail to converge to some or all of the zeros, or they converge to very bad approximations of the polynomial's zeros. This material introduces two new methods, the greatest common divisor (G.C.D.) method and the repeated greatest common divisor (repeated G.C.D.) method, which are superior methods for numerically approximating the zeros of a polynomial having multiple zeros. These methods were programmed in FORTRAN 4 and comparisons in time and accuracy are given.

Wood, C. A.↗

Real-space solution to the electronic structure problem for nearly a million electrons

We report a Kohn–Sham density functional theory calculation of a system with more than 200 000 atoms and 800 000 electrons using a real-space high-order finite-difference method to investigate the electronic structure of large spherical silicon nanoclusters. Our system of choice was a 20 nm large spherical nanocluster with 202 617 silicon atoms and 13 836 hydrogen atoms used to passivate the dangling surface bonds. To speed up the convergence of the eigenspace, we utilized Chebyshev-filtered subspace iteration, and for sparse matrix–vector multiplications, we used blockwise Hilbert space-filling curves, implemented in the PARSEC code. For this calculation, we also replaced our orthonormalization + Rayleigh–Ritz step with a generalized eigenvalue problem step. We utilized all of the 8192 nodes (458 752 processors) on the Frontera machine at the Texas Advanced Computing Center. We achieved two Chebyshev-filtered subspace iterations, yielding a good approximation of the electronic density of states. Our work pushes the limits on the capabilities of the current electronic structure solvers to nearly 106 electrons and demonstrates the potential of the real-space approach to efficiently parallelize large calculations on modern high-performance computing platforms.

Chemistry↗

Flux stabilization in neutron problems with fixed sources

Although critical core calculations are the most common in design and safety analysis, fixed source calculations are needed for specific applications, e.g. to compute ex-core detector response functions, to develop new methodologies for dilution and reload error accidents and more in general for all situations involving sub-critical shut-down states. It is well known that the source problem becomes difficult to be solved with core configuration close to criticality, i.e. with the multiplication factor approaching unity, for the occurrence of numerical ill-conditioning and very high number of iterations, possibly leading to failure in the flux convergence. In this work, the Wielandt Eigen-shift technique used in iterative methods of critical problems is developed for source problems too, in order to stabilize the solution. The mathematical basis and the proof of the convergence are discussed. Compared to the existing methods, this technique allows also more control to avoid singular behavior at inner iterations. Numerical tests with a 1D analytical benchmark are reported to prove the robustness of the technique. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Performance of direct and iterative algorithms on an optical systolic processor

The frequency-multiplexed optical linear algebra processor (OLAP) is treated in detail with attention to its performance in the solution of systems of linear algebraic equations (LAEs). General guidelines suitable for most OLAPs, including digital-optical processors, are advanced concerning system and component error source models, guidelines for appropriate use of direct and iterative algorithms, the dominant error sources, and the effect of multiple simultaneous error sources. Specific results are advanced on the quantitative performance of both direct and iterative algorithms in the solution of systems of LAEs and in the solution of nonlinear matrix equations. Acoustic attenuation is found to dominate iterative algorithms and detector noise to dominate direct algorithms. The effect of multiple spatial errors is found to be additive. A theoretical expression for the amount of acoustic attenuation allowed is advanced and verified. Simulations and experimental data are included.

Ghosh, A. K.↗

Designing reduced-order linear multivariable controllers using experimentally derived plant data

An iterative numerical algorithm for simultaneously improving multiple performance and stability robustness criteria for multivariable feedback systems is developed. The unsatisfied design criteria are improved by updating the free parameters of an initial, stabilizing controller's state-space matrices. Analytical expressions for the gradients of the design criteria are employed to determine a parameter correction that improves all of the feasible, unsatisfied design criteria at each iteration. A controller design is performed using the algorithm with experimentally derived data from a large space structure test facility. Experimental results of the controller's performance at the facility are presented.

Frazier, W. G.↗

redMaPPer. I. Algorithm and SDSS DR8 catalog

We describe redMaPPer, a new red sequence cluster finder specifically designed to make optimal use of ongoing and near-future large photometric surveys. The algorithm has multiple attractive features: (1) it can iteratively self-train the red sequence model based on a minimal spectroscopic training sample, an important feature for high-redshift surveys. (2) It can handle complex masks with varying depth. (3) It produces cluster-appropriate random points to enable large-scale structure studies. (4) All clusters are assigned a full redshift probability distribution P(z). (5) Similarly, clusters can have multiple candidate central galaxies, each with corresponding centering probabilities. (6) The algorithm is parallel and numerically efficient: it can run a Dark Energy Survey-like catalog in ∼500 CPU hours. (7) The algorithm exhibits excellent photometric redshift performance, the richness estimates are tightly correlated with external mass proxies, and the completeness and purity of the corresponding catalogs are superb. We apply the redMaPPer algorithm to ∼10, 000 deg{sup 2} of SDSS DR8 data and present the resulting catalog of ∼25,000 clusters over the redshift range z in [0.08, 0.55]. The redMaPPer photometric redshifts are nearly Gaussian, with a scatter σ {sub z} ≈ 0.006 at z ≈ 0.1, increasing to σ {sub z} ≈ 0.02 at z ≈ 0.5 due to increased photometric noise near the survey limit. The median value for |Δz|/(1 + z) for the full sample is 0.006. The incidence of projection effects is low (≤5%). Detailed performance comparisons of the redMaPPer DR8 cluster catalog to X-ray and Sunyaev-Zel'dovich catalogs are presented in a companion paper.

79 ASTRONOMY AND ASTROPHYSICS↗

Subcritical Multiplication with a Fixed Source

In a subcritical, multiplying medium, the system multiplication describes the expected total number of neutrons created by a single source neutron. Subcriticality plays a large role in criticality safety and thus it is vital for the subcritical multiplication factor be accurate, especially as a system approaches criticality. This work examines the accuracy of calculating the system multiplication using the MCNP6.2 ® k-eigenvalue power iteration (KCODE) method when a fixed-point source is present in a multiplying medium, for near critical systems. This work compares the standard approach for calculating system multiplication, using the fixed-source calculational approach, to a new, single k-eigenvalue power iteration approach that incorporates a fixed-source component and a fission-source component into a single calculation. For the remainder of this paper, some theoretical background and numerical results for an approximate k eigenvalue approach, an accurate fixed-source approach and a new and more accurate k-eigenvalue approach to computing system multiplication are provided.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Adaptive Multi-Sensor Localization Information Fusion for Autonomous Urban Air Mobility Operations

An adaptive method is developed to iteratively fuse the information provided by multiple sensors to enable autonomous urban air mobility type operations. First, noisy and bias corrupted IMU readings are processed as soon as they arrive using kinematic equations represented in the vehicle's body frame. To correct the systems drift resulting from the integration, an information content measure is introduced to decide on the environment. For the cluttered environment the information provided by environmental sensors is counted as reliable and the drift correction as accurate. For the open space, the GPS data is counted as reliable, and the drift correction is done based on the GPS readings. The measurement noise effects are minimize using Iterated Extended Kalman Filter framework. The algorithm is implemented in the in-house developed FlightDeckz simulation environment using an IMU model, simulated video recorded from a camera mounted on the vehicle (for the purpose of this study, outside scenery was generated with XPlane), which flies in an urban environment, and GPS data generated from the environment's digital map.

Onboard Perception↗