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,405 records · Page 78

Solution of the Skyrme-Hartree-Fock-Bogolyubov equations in the Cartesian deformed harmonic-oscillator basis. (VII) HFODD (v2.49t): A new version of the program

We describe the new version (v2.49t) of the code HFODD which solves the nuclear Skyrme Hartree-Fock (HF) or Skyrme Hartree-Fock-Bogolyubov (HFB) problem by using the Cartesian deformed harmonic-oscillator basis. In the new version, we have implemented the following physics features: (i) the isospin mixing and projection, (ii) the finite temperature formalism for the HFB and HF+BCS methods, (iii) the Lipkin translational energy correction method, (iv) the calculation of the shell correction. A number of specific numerical methods have also been implemented in order to deal with large-scale multi-constraint calculations and hardware limitations: (i) the two-basis method for the HFB method, (ii) the Augmented Lagrangian Method (ALM) for multi-constraint calculations, (iii) the linear constraint method based on the approximation of the RPA matrix for multi-constraint calculations, (iv) an interface with the axial and parity-conserving Skyrme-HFB code HFBTHO, (v) the mixing of the HF or HFB matrix elements instead of the HF fields. Special care has been paid to using the code on massively parallel leadership class computers. For this purpose, the following features are now available with this version: (i) the Message Passing Interface (MPI) framework, (ii) scalable input data routines, (iii) multi-threading via OpenMP pragmas, (iv) parallel diagonalization of the HFB matrix in the simplex breaking case using the ScaLAPACK library. Finally, several little significant errors of the previous published version were corrected.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

Extension of the weak-line approximation and application to correlated-k methods

Global climate models require accurate and rapid computation of the radiative transfer through the atmosphere. Correlated-k methods are often used. One of the approximations used in correlated-k models is the weakline approximation. We introduce an approximation T/sub g/ which reduces to the weak-line limit when optical depths are small, and captures the deviation from the weak-line limit as the extinction deviates from the weak-line limit. This approximation is constructed to match the first two moments of the gamma distribution to the k-distribution of the transmission. We compare the errors of the weak-line approximation with T/sub g/ in the context of a water vapor spectrum. The extension T/sub g/ is more accurate and converges more rapidly than the weak-line approximation.

54 ENVIRONMENTAL SCIENCES↗

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↗

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↗

Comparing Capacity Value Estimation Techniques for Photovoltaic Solar Power

In this paper, we estimate the capacity value of photovoltaic (PV) solar plants in the western U.S. Our results show that PV plants have capacity values that range between 52% and 93%, depending on location and sun-tracking capability. We further compare more robust but data- and computationally-intense reliability-based estimation techniques with simpler approximation methods. We show that if implemented properly, these techniques provide accurate approximations of reliability-based methods. Overall, methods that are based on the weighted capacity factor of the plant provide the most accurate estimate. We also examine the sensitivity of PV capacity value to the inclusion of sun-tracking systems.

14 SOLAR ENERGY↗

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↗

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

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↗

Communication: Random phase approximation renormalized many-body perturbation theory

We derive a renormalized many-body perturbation theory (MBPT) starting from the random phase approximation (RPA). This RPA-renormalized perturbation theory extends the scope of single-reference MBPT methods to small-gap systems without significantly increasing the computational cost. The leading correction to RPA, termed the approximate exchange kernel (AXK), substantially improves upon RPA atomization energies and ionization potentials without affecting other properties such as barrier heights where RPA is already accurate. Thus, AXK is more balanced than second-order screened exchange [A. Grüneis et al., J. Chem. Phys. 131, 154115 (2009)], which tends to overcorrect RPA for systems with stronger static correlation. Similarly, AXK avoids the divergence of second-order Møller-Plesset (MP2) theory for small gap systems and delivers a much more consistent performance than MP2 across the periodic table at comparable cost. RPA+AXK thus is an accurate, non-empirical, and robust tool to assess and improve semi-local density functional theory for a wide range of systems previously inaccessible to first-principles electronic structure calculations.

74 ATOMIC AND MOLECULAR PHYSICS↗

High Performance Computing and Storage Requirements for Biological and Environmental Research Target 2017

The National Energy Research Scientific Computing Center (NERSC) is the primary computing center for the DOE Office of Science, serving approximately 4,500 users working on some 650 projects that involve nearly 600 codes in a wide variety of scientific disciplines. In addition to large-­scale computing and storage resources NERSC provides support and expertise that help scientists make efficient use of its systems. The latest review revealed several key requirements, in addition to achieving its goal of characterizing BER computing and storage needs.

59 BASIC BIOLOGICAL SCIENCES↗

Relics of spatial curvature in the primordial non-gaussianity

We study signatures in the Cosmic Microwave Background (CMB) induced by the presence of strong spatial curvature prior to the epoch of inflation which generated our present universe. If inflation does not last sufficiently long to drive the large-scale spatial curvature to zero, then presently observable scales may have left the horizon while spatial slices could not be approximated by a flat, Euclidean geometry. We compute corrections to the power spectrum and non-gaussianity of the CMB temperature anisotropy in this scenario. The power spectrum does not receive significant corrections and is a weak diagnostic of the presence of curvature in the initial conditions, unless its running can be determined with high accuracy. However, the bispectral non-gaussianity parameter f{sub NL} receives modifications on the largest observable scales. We estimate that the maximum signal would correspond to f{sub NL} ∼ 0.3, which is out of reach for present-day microwave background experiments.

79 ASTRONOMY AND ASTROPHYSICS↗

Investigation of the possibility to use a fine-mesh solver for resolving coupled neutronics and thermal-hydraulics

The development of a fine-mesh coupled neutronic/thermal-hydraulic solver is touched upon in this paper. The reported work investigates the feasibility of using finite volume techniques to discretize a set of conservation equations modeling neutron transport, fluid dynamics, and heat transfer within a single numerical tool. With the long-term objective of developing fine-mesh computing capabilities for a few selected fuel assemblies in a nuclear core, this preliminary study considers an infinite array of a single fuel assembly having a finite height. Thermal-hydraulic conditions close to the ones existing in PWRs are taken as a first test case. The neutronic modeling relies on the diffusion approximation in a multi-energy group formalism, with cross-sections pre-calculated and tabulated at the sub-pin level using a Monte Carlo technique. The thermal-hydraulics is based on the Navier-Stokes equations, complemented by an energy conservation equation. The non-linear coupling terms between the different conservation equations are fully resolved using classical iteration techniques. Early tests demonstrate that the numerical tool provides an unprecedented level of details of the coupled solution estimated within the same numerical tool and thus avoiding any external data transfer, using fully consistent models between the neutronics and the thermal-hydraulics. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A computationally efficient method for tempered fractional differential equations with application

This paper investigates the numerical approximation of the tempered fractional integral by using the Sinc-collocation scheme. The algorithm is extended to solve a class of tempered fractional differential equations that converges to the solution with exponential rate. Several numerical examples compare the numerical approximations with the exact solutions. The behavioral responses of the lumped capacitance model with tempered fractional order for transient conduction are investigated. The efficiency and accuracy of the proposed scheme are analyzed in the perspective of the L{sub 2}-norm error and convergence order.

97 MATHEMATICS AND COMPUTING↗

Analysis and Simulation of One-Dimensional Transport Models for Lithium Symmetric Cells

The main objective of this paper is to analyze transport models for lithium symmetric cells and arrive at an efficient model and code to simulate the same. Two one-dimensional models are considered. The first model uses the dilute solution Nernst–Planck equations in conjunction with the electroneutrality assumption (EN-NP model). For binary electrolytes, an analytical solution for electrolyte concentration is derived and compared with numerical solutions by an approximate finite volume method. The second approach relaxes the electroneutrality assumption by way of Poisson’s equation for the electrostatic potential (PNP model). The computational difficulties of the PNP model are tackled using the approximate finite volume method, with demonstrated convergence characteristics even with bulk dimensions several orders of magnitude larger than the characteristic double layer size. A robust code is developed for the PNP model. The computationally efficient transport models can facilitate simulations, physical understanding, and analysis. This is illustrated by a case study in which these models are coupled with modified kinetic models, which are then parameterized with experimental voltage response data using a systems-level approach. The estimated parameters provide further insight into the electrochemical phenomena underpinning voltage transitions in symmetric cells.

25 ENERGY STORAGE↗

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗