Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximate computing”

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 1,495 records · Page 83

Normal and resonant Auger spectroscopy of isocyanic acid, HNCO

In this study, we investigate HNCO by resonant and nonresonant Auger electron spectroscopy at the K-edges of carbon, nitrogen, and oxygen, employing soft X-ray synchrotron radiation. In comparison with the isosteric but linear CO 2 molecule, spectra of the bent HNCO molecule are similar but more complex due to its reduced symmetry, wherein the degeneracy of the π-orbitals is lifted. Resonant Auger electron spectra are presented at different photon energies over the first core-excited 1s → 10a' resonance. All Auger electron spectra are assigned based on ab initio configuration interaction computations combined with the one-center approximation for Auger intensities and moment theory to consider vibrational motion. The calculated spectra were scaled by a newly introduced energy scaling factor, and generally, good agreement is found between experiment and theory for normal as well as resonant Auger electron spectra. A comparison of resonant Auger spectra with nonresonant Auger structures shows a slight broadening as well as a shift of the former spectra between –8 and –9 eV due to the spectating electron. Since HNCO is a small molecule and contains the four most abundant atoms of organic molecules, the reported Auger electron decay spectra will provide a benchmark for further theoretical approaches in the computation of core electron spectra.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Charts and Tables for Estimating the Stability of the Compressible Laminar Boundary Layer with Heat Transfer and Arbitrary Pressure Gradient

The minimum critical Reynolds numbers for the similar solutions of the compressible laminar boundary layer computed by Cohen and Reshotko and also for the Falkner and Skan solutions as recomputed by Smith have been calculated by Lin's rapid approximate method for two-dimensional disturbances. These results enable the stability of the compressible laminar boundary layer with heat transfer and pressure gradient to be easily estimated after the behavior of the boundary layer has been computed by the approximate method of Cohen and Reshotko. The previously reported unusual result (NACA Technical Note 4037) that a highly cooled stagnation point flow is more unstable than a highly cooled flat-plate flow is again encountered. Moreover, this result is found to be part of the more general result that a favorable pressure gradient is destabilizing for very cool walls when the Mach number is less than that for complete stability. The minimum critical Reynolds numbers for these wall temperature ratios are, however, all larger than any value of the laminar-boundary-layer Reynolds number likely to be encountered. For Mach numbers greater than those for which complete stability occurs a favorable pressure gradient is stabilizing, even for very cool walls.

Tetervin, Neal↗

Experimental Aerodynamic Simulation of Scallop Ice Accretion on a Swept Wing

Understanding the aerodynamic impact of swept-wing ice accretions is a crucial component of the design of modern aircraft. Computer-simulation tools are commonly used to approximate ice shapes, so the necessary level of detail or fidelity of those simulated ice shapes must be understood relative to high-fidelity representations of the ice. Previous tests were performed in the NASA Icing Research Tunnel to acquire high-fidelity ice shapes. From this database, full-span artificial ice shapes were designed and manufactured for both an 8.9%-scale and 13.3%-scale semispan wing model of the CRM65 which has been established as the full-scale baseline for this swept-wing project. These models were tested in the Walter H. Beech wind tunnel at Wichita State University and at the ONERA F1 facility, respectively. The data collected in the Wichita St. University wind tunnel provided a low-Reynolds number baseline study while the pressurized F1 facility produced data over a wide range of Reynolds and Mach numbers with the highest Reynolds number studied being approximately Re=11.9x106. Past work focused on only three different fidelity variations for ice shapes based on multiple icing conditions. This work presents a more detailed investigation into several fidelity representations of a single highly three-dimensional scallop ice accretion. Sensitivity to roughness size and application technique on a low-fidelity smooth ice shape is described. The data indicate that the aerodynamic performance is not especially sensitive to the grit variations. An ice accretion code was also used to generate ice shapes for aerodynamic testing and comparisons. These ice shapes have a general appearance like the low-fidelity smooth ice shapes, but in this case, the computer-generated ice shape is significantly smaller. As such, the impact of that ice shape on the aerodynamic performance of the wing is reduced compared to the smooth ice shape based on the icing experiment for those same conditions. Spanwise discontinuities were also introduced to a low-fidelity ice shape in an attempt to quantify the impact of those variation in the high-fidelity ice shape. While the lift data indicate good agreement between the high-fidelity ice shapes and the low-fidelity ice shapes and the low-fidelity ice shapes with spanwise discontinuities, a closer investigation of the data suggests potential, significant differences in the flowfield. These results were similar at both facilities over the wide range of test conditions utilized.

Woodard, Brian↗

Solar Temperature Variations Computed from SORCE SIM Irradiances Observed During 2003-2020

NASA’s Solar Radiation and Climate Experiment (SORCE) Spectral Irradiance Monitor (SIM) instrument produced about 17 years of daily average Spectral Solar Irradiance ( SSI ) data for wavelengths 240 nm – 2416 nm. We choose a day of minimal solar activity, 2008-08-24, during the 2008 − 2009 minimum between cycles 23 and 24, and compute the brightness temperature (𝑇 o ) from that day’s solar spectral irradiance (𝑆𝑆𝐼 o ). We consider small variations of T and SSI about these reference values, and derive linear and quadratic analytic approximations by Taylor expansion about the reference day values. To determine approximation accuracy, we compare to exact brightness temperatures T computed from the Planck spectrum, by solving analytically for T , or equivalent root-finding in Wolfram Mathematica. We find that the linear analytic approximation overestimates, while the quadratic underestimates the exact result. This motivates search for statistical “fit” models “in between” the two analytic models, with minimum root-mean-square-error RMSE. We make this search using open-source statistical R software, determine coefficients for linear and quadratic fit models, and compare statistical with analytic RMSE’s. When only linear analytic and fit models are compared, the fit model is superior at ultraviolet, visible, and near infrared wavelengths. This again holds true when comparing only quadratic models. Quadratic is superior to linear for both analytic and statistical models, and statistical fits give smallest RMSE’s. Lastly, we use linear analytic and fit models to find an interpolating function in wavelength, useful in case the SIM results need adjustment to another choices of wavelengths, to compare or extend to any other instrument.

SORCE↗

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks: Preprint

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous–enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗

Brain Connectomics: Opportunities for High-Performance Computing (Final Report)

The human brain is estimated to contain approximately 100 trillion neural connections. This complex map of connectivity (human connectome) underlies cognitive processes and informs disease states, but until recently, studying the human connectome has been hampered by the difficulty of collecting and processing suitable data for analysis. In this context, an initiative denominated The Human Connectome Project (HCP) was created to acquire and collect the largest, most cohesive set of brain data to accelerate neuroscience research. Recently the HCP released a magnetic resonance (MR) dataset of brain imagery with unprecedented scale and organization, together with high quality spatial and temporal resolution; however, fully taking advantage of this high-resolution brain imagery to estimate neurological connectivity networks requires high-performance computing (HPC). In this project, we explored the feasibility of using HPC resources at Lawrence Livermore to effectively estimate brain connectivity networks from this large set of imagery. Specifically, we addressed one of the main current challenges in brain connectomics, which is to advance the computation of individual structural and functional connectomes.

42 ENGINEERING↗

A real-time approximate optimal guidance law for flight in a plane

A real-time guidance scheme is presented for the problem of maximizing the payload into orbit subject to the equations of motion of a rocket over a nonrotating spherical earth. The flight is constrained to a path in the equatorial plane while reaching an orbital altitude at orbital injection speeds. The dynamics of the problem can be separated into primary and perturbation effects by a small parameter, epsilon, which is the ratio of the atmospheric scale height to the radius of the earth. The Hamilton-Jacobi-Bellman or dynamic programming equation is expanded in an asymptotic series where the zeroth-order term (epsilon = 0) can be obtained in closed form. The neglected perturbation terms are included in the higher-order terms of the expansion, which are determined from the solution of first-order linear partial differential equations requiring only integrations which are quadratures. The quadratures can be performed rapidly with emerging computer capability, so that real-time approximate optimization can be used to construct the launch guidance law. The application of this technique to flight in three-dimensions is made apparent from the solution presented.

Feeley, Timothy S.↗

Spherical Parameter Estimation and MPDV Applications

A new algebraic least square approach is presented for estimating effective zero center for verification of MPDV(Multichannel Photon Doppler Velocimetry) probe designs. Unlike previous algebraic least square methods for spherical parameter estimation, the new method can be shown to be concise in mathematic formulations, easy of computations, invariant under rigid -body transformations, no need for numerical approximations, and precise in dealing with precise data.

97 MATHEMATICS AND COMPUTING↗

Probabilistic Design of a Wind Tunnel Model to Match the Response of a Full-Scale Aircraft

approach is presented for carrying out the reliability-based design of a plate-like wing that is part of a wind tunnel model. The goal is to design the wind tunnel model to match the stiffness characteristics of the wing box of a flight vehicle while satisfying strength-based risk/reliability requirements that prevents damage to the wind tunnel model and fixtures. The flight vehicle is a modified F/A-18 aircraft. The design problem is solved using reliability-based optimization techniques. The objective function to be minimized is the difference between the displacements of the wind tunnel model and the corresponding displacements of the flight vehicle. The design variables control the thickness distribution of the wind tunnel model. Displacements of the wind tunnel model change with the thickness distribution, while displacements of the flight vehicle are a set of fixed data. The only constraint imposed is that the probability of failure is less than a specified value. Failure is assumed to occur if the stress caused by aerodynamic pressure loading is greater than the specified strength allowable. Two uncertain quantities are considered: the allowable stress and the thickness distribution of the wind tunnel model. Reliability is calculated using Monte Carlo simulation with response surfaces that provide approximate values of stresses. The response surface equations are, in turn, computed from finite element analyses of the wind tunnel model at specified design points. Because the response surface approximations were fit over a small region centered about the current design, the response surfaces were refit periodically as the design variables changed. Coarse-grained parallelism was used to simultaneously perform multiple finite element analyses. Studies carried out in this paper demonstrate that this scheme of using moving response surfaces and coarse-grained computational parallelism reduce the execution time of the Monte Carlo simulation enough to make the design problem tractable. The results of the reliability-based designs performed in this paper show that large decreases in the probability of stress-based failure can be realized with only small sacrifices in the ability of the wind tunnel model to represent the displacements of the full-scale vehicle.

Mason, Brian H.↗

A side-by-side comparison of the solidification dynamics of quasicrystalline and approximant phases in the Al–Co–Ni system

Quasicrystals and their approximants have triggered widespread interest due to the challenge of solving their complex crystal structures as well as their possibly exceptional properties. The structural motifs of approximants are similar to those of the corresponding quasicrystals, but to what extent are their crystallization pathways the same? Unfortunately, there have been very few in situ experimental investigations to answer this question. Here, by leveraging the high penetrating power of hard X-rays, synchrotron-based X-ray tomography was conducted in order to capture the nucleation and growth of a decagonal quasicrystal and its related approximant. The combination of data-driven computational analysis with new thermodynamic databases allowed the characterization, with high precision, of the constitutional and kinetic driving forces for crystallization. The experimental results prove that the growth of both crystals from a liquid is dominated by first-order kinetics. Nevertheless, and somewhat surprisingly, significant differences were observed in their rates of nucleation and growth. The reasons for such divergent behaviours are discussed in light of contemporary theories of intermetallic crystallization.

36 MATERIALS SCIENCE↗

Toward perturbation theory methods on a quantum computer

Perturbation theory, used in a wide range of fields, is a powerful tool for approximate solutions to complex problems, starting from the exact solution of a related, simpler problem. Advances in quantum computing, especially over the past several years, provide opportunities for alternatives to classical methods. Here, we present a general quantum circuit estimating both the energy and eigenstates corrections that is far superior to the classical version when estimating second-order energy corrections. We demonstrate our approach as applied to the two-site extended Hubbard model. In addition to numerical simulations based on qiskit, results on IBM’s quantum hardware are also presented. Our work offers a general approach to studying complex systems with quantum devices, with no training or optimization process needed to obtain the perturbative terms, which can be generalized to other Hamiltonian systems both in chemistry and physics.

97 MATHEMATICS AND COMPUTING↗

On the Solution of ℓ 0 -Constrained Sparse Inverse Covariance Estimation Problems

The sparse inverse covariance matrix is used to model conditional dependencies between variables in a graphical model to fit a multivariate Gaussian distribution. Estimating the matrix from data are well known to be computationally expensive for large-scale problems. Sparsity is employed to handle noise in the data and to promote interpretability of a learning model. Although the use of a convex ℓ 1 regularizer to encourage sparsity is common practice, the combinatorial ℓ 0 penalty often has more favorable statistical properties. In this paper, we directly constrain sparsity by specifying a maximally allowable number of nonzeros, in other words, by imposing an ℓ 0 constraint. Here, we introduce an efficient approximate Newton algorithm using warm starts for solving the nonconvex ℓ 0 -constrained inverse covariance learning problem. Numerical experiments on standard data sets show that the performance of the proposed algorithm is competitive with state-of-the-art methods.

$\ell_0$-Constrained↗

Bayesian optimization to design a novel x-ray shaping device

In radiation therapy, x-ray dose must be precisely sculpted to the tumor, while simultaneously avoiding surrounding organs at risk. This requires modulation of x-ray intensity in space and/or time. Typically, this is achieved using a multi leaf collimator (MLC) - a complex mechatronic device comprising over one hundred individually powered tungsten ‘leaves’ that move in or out of the radiation field as required. Here, an all-electronic x-ray collimation concept with no moving parts is presented, termed “SPHINX”: Scanning Pencil-beam High-speed Intensity-modulated X-ray source. SPHINX utilizes a spatially distributed bremsstrahlung target and collimator array in conjunction with magnetic scanning of a high energy electron beam to generate a plurality of small x-ray “beamlets.” A simulation framework was developed in Topas Monte Carlo incorporating a phase space electron source, transport through user defined magnetic fields, bremsstrahlung x-ray production, transport through a SPHINX collimator, and dose in water. This framework was completely parametric, meaning a simulation could be built and run for any supplied geometric parameters. This functionality was coupled with Bayesian optimization to find the best parameter set based on an objective function which included terms to maximize dose rate for a user defined beamlet width while constraining inter-channel cross talk and electron contamination. Designs for beamlet widths of 5, 7, and 10 mm 2 were generated. Each optimization was run for 300 iterations and took approximately 40 h on a 24-core computer. For the optimized 7-mm model, a simulation of all beamlets in water was carried out including a linear scanning magnet calibration simulation. Finally, a back-of-envelope dose rate formalism was developed and used to estimate dose rate under various conditions. The optimized 5–, 7–, and 10-mm models had beamlet widths of 5.1 , 7.2 , and 10.1 mm 2 and dose rates of 3574, 6351, and 10 015 Gy/C, respectively. The reduction in dose rate for smaller beamlet widths is a result of both increased collimation and source occlusion. For the simulation of all beamlets in water, the scanning magnet calibration reduced the offset between the collimator channels and beam centroids from 2.9 ±1.9 mm to 0.01 ±0.03 mm. A slight reduction in dose rate of approximately 2% per degree of scanning angle was observed. Based on a back-of-envelope dose rate formalism, SPHINX in conjunction with next-generation linear accelerators has the potential to achieve substantially higher dose rates than conventional MLC-based delivery, with delivery of an intensity modulated 100 x 100 mm 2 field achievable in 0.9 to 10.6 s depending on the beamlet widths used. Bayesian optimization was coupled with Monte Carlo modeling to generate SPHINX geometries for various beamlet widths. A complete Monte Carlo simulation for one of these designs was developed, including electron beam transport of all beamlets through scanning magnets, x-ray production and collimation, and dose in water. These results demonstrate that SPHINX is a promising candidate for sculpting radiation dose with no moving parts, and has the potential to vastly improve both the speed and robustness of radiotherapy delivery. A multi-beam SPHINX system may be a candidate for delivering magavoltage FLASH RT in humans.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Evolutionary Computing for Low-thrust Navigation

The development of new mission concepts requires efficient methodologies to analyze, design and simulate the concepts before implementation. New mission concepts are increasingly considering the use of ion thrusters for fuel-efficient navigation in deep space. This paper presents parallel, evolutionary computing methods to design trajectories of spacecraft propelled by ion thrusters and to assess the trade-off between delivered payload mass and required flight time. The developed methods utilize a distributed computing environment in order to speed up computation, and use evolutionary algorithms to find globally Pareto-optimal solutions. The methods are coupled with two main traditional trajectory design approaches, which are called direct and indirect. In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. In the indirect approach, a thrust control problem is transformed into a costate control problem, and the initial values of the costate vector are optimized. The developed methods are applied to two problems: 1) an orbit transfer around the Earth and 2) a transfer between two distance retrograde orbits around Europa, the closest to Jupiter of the icy Galilean moons. The optimal solutions found with the present methods are comparable to other state-of-the-art trajectory optimizers and to analytical approximations for optimal transfers, while the required computational time is several orders of magnitude shorter than other optimizers thanks to an intelligent design of control vector discretization, advanced algorithmic parameterization, and parallel computing.

optimization↗

Methods of shield analysis for protection against electrons in space

It is anticipated that many future manned space operations will be radiation limited and that laminated wall structures and the use of new materials will be required to reduce radiation exposure. Methods for electron shield analysis are reviewed in light of anticipated needs in the space program. The most general method is still the Monte Carlo method, which is of limited usefulness for shield analysis due to excessive computer requirements. Methods based on energy deposition coefficients or energy transmission and reflection factors are quite accurate, but are currently limited to aluminum shield material. Analytical methods based on Mar's approximation for the electron transmission factor are relatively general and computer efficient but seriously underestimate shield requirements. A correction to methods using Mar's approximate transmission factor is derived herein and results in a slightly conservative estimate of shield requirements. Techniques for laminated shield design are still lacking.

Wilson, J. W.↗

Efficient emulation of relativistic heavy ion collisions with transfer learning

Measurements from the Large Hadron Collider (LHC) and the Relativistic Heavy Ion Collider (RHIC) can be used to study the properties of quark-gluon plasma. Systematic constraints on these properties must combine measurements from different collision systems and methodically account for experimental and theoretical uncertainties. Such studies require a vast number of costly numerical simulations. While computationally inexpensive surrogate models (“emulators”) can be used to efficiently approximate the predictions of heavy ion simulations across a broad range of model parameters, training a reliable emulator remains a computationally expensive task. We use transfer learning to map the parameter dependencies of one model emulator onto another, leveraging similarities between different simulations of heavy ion collisions. By limiting the need for large numbers of simulations to only one of the emulators, this technique reduces the numerical cost of comprehensive uncertainty quantification when studying multiple collision systems and exploring different models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A sparse matrix–vector multiplication based algorithm for accurate density matrix computations on systems of millions of atoms

Here we present an efficient sparse matrix–vector (SpMV) based method to compute the density matrix P from a given Hamiltonian in electronic structure computations. Our method is a hybrid approach based on Chebyshev–Jackson approximation theory and matrix purification methods like the second order spectral projection purification (SP2). Recent methods to compute the density matrix scale as O(N) in the number of floating point operations but are accompanied by large memory and communication overhead, and they are based on iterative use of the sparse matrix–matrix multiplication kernel (SpGEMM), which is known to be computationally irregular. In addition to irregularity in the sparse Hamiltonian H, the nonzero structure of intermediate estimates of P depends on products of H and evolves over the course of computation. On the other hand, an expansion of the density matrix P in terms of Chebyshev polynomials is straightforward and SpMV based; however, the resulting density matrix may not satisfy the required constraints exactly. In this paper, we analyze the strengths and weaknesses of the Chebyshev–Jackson polynomials and the second order spectral projection purification (SP2) method, and propose to combine them so that the accurate density matrix can be computed using the SpMV computational kernel only, and without having to store the density matrix P. Our method accomplishes these objectives by using the Chebyshev polynomial estimate as the initial guess for SP2, which is followed by using sparse matrix–vector multiplications (SpMVs) to replicate the behavior of the SP2 algorithm for purification. We demonstrate the method on a tight-binding model system of an oxide material containing more than 3 million atoms. In addition, we also present the predicted behavior of our method when applied to near-metallic Hamiltonians with a wide energy spectrum.

42 ENGINEERING↗