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,081 records · Page 60

Nuclear kinetic density from ab initio theory

The nuclear kinetic density is one of many fundamental, nonobservable quantities in density functional theory (DFT) dependent on the nonlocal nuclear density. Often, approximations may be made when computing the density that may result in spurious contributions in other DFT quantities. With the ability to compute the nonlocal nuclear density from ab initio wave functions, it is now possible to estimate effects of such spurious contributions. Herein, we derive the kinetic density using ab initio nonlocal scalar one-body nuclear densities computed within the no-core shell model (NCSM) approach, utilizing two- and three-nucleon chiral interactions as the sole input. The ability to compute translationally invariant nonlocal densities allows us to gauge the impact of the spurious center-of-mass (c.m.) contributions in DFT quantities, such as the kinetic density, and provide ab initio insight into refining energy density functionals. The nonlocal nuclear densities are derived from the NCSM one-body densities calculated in second quantization. We present a review of c.m. contaminated and translationally invariant nuclear densities. We then derive an analytic expression for the kinetic density using these nonlocal densities, producing an ab initio kinetic density. The ground-state nonlocal densities of He 4 , 6 , 8 , C 12 , and O 16 are used to compute the kinetic densities of the aforementioned nuclei. The impact of c.m. removal techniques in the density are discussed and compared to a procedure applied in DFT. The results of this work can be extended to other fundamental quantities in DFT. The use of a general nonlocal density allows for the calculation of fundamental quantities taken as input in theories such as DFT. This allows benchmarking c.m. removal procedures and provides a bridge for comparison between ab initio and DFT many-body techniques.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Collective excitations of supersymmetric plasma

Collective excitations of N=1 supersymmetric electromagnetic plasma are studied. Since the Keldysh-Schwinger approach is used, not only equilibrium but also nonequilibrium plasma, which is assumed to be ultrarelativistic, is under consideration. The dispersion equations of photon, photino, electron, and selectron modes are written down and the self-energies, which enter the equations, are computed in the hard loop approximation. The self-energies are discussed in the context of effective action which is also given. The photon modes and electron ones appear to be the same as in the usual ultrarelativistic plasma of electrons, positrons, and photons. The photino modes coincide with the electron ones and the selectron modes are as of a free relativistic massive particle.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Chiral matrix model of the semi-QGP in QCD

Previously, a matrix model of the region near the transition temperature, in the “semi”quark gluon plasma, was developed for the theory of SU(3) gluons without quarks. In this paper we develop a chiral matrix model applicable to QCD by including dynamical quarks with 2+1 flavors. This requires adding a nonet of scalar fields, with both parities, and coupling these to quarks through a Yukawa coupling, y. Treating the scalar fields in mean field approximation, the effective Lagrangian is computed by integrating out quarks to one loop order. As is standard, the potential for the scalar fields is chosen to be symmetric under the flavor symmetry of SU (3) L × SU(3) R × Z (3) A , except for a term linear in the current quark mass, m qk . In addition, at a nonzero temperature T it is necessary to add a new term, ~ m qk T 2 . The parameters of the gluon part of the matrix model are identical to those for the pure glue theory without quarks. The parameters in the chiral matrix model are fixed by the values, at zero temperature, of the pion decay constant and the masses of the pions, kaons, η , and η' . The temperature for the chiral crossover at T$χ$ = 155 MeV is determined by adjusting the Yukawa coupling y . We find reasonable agreement with the results of numerical simulations on the lattice for the pressure and related quantities. In the chiral limit, besides the divergence in the chiral susceptibility there is also a milder divergence in the susceptibility between the Polyakov loop and the chiral order parameter, with critical exponent β $-$ 1 . We compute derivatives with respect to a quark chemical potential to determine the susceptibilities for baryon number, the $χ$ 2n . Especially sensitive tests are provided by $χ$ 4 $-$ $χ$ 2 and by $χ$ 6 , which changes in sign about T$χ$ . In conclusion, the behavior of the susceptibilities in the chiral matrix model strongly suggests that as the temperature increases from T$χ$ , that the transition to deconfinement is significantly quicker than indicated by the measurements of the (renormalized) Polyakov loop on the lattice.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Step-Down Test Procedure for Wavelet Shrinkage Using Bootstrapping

Wavelet thresholding (or shrinkage) attempts to remove the noises existing in the signals while preserving inherent pattern characteristics in the reconstruction of true signals. For data-denoising purpose, we present a new wavelet thresholding procedure which employs the step-down testing idea of identifying active contrasts in unreplicated fractional factorial experiments. The proposed method employs bootstrapping methods to a step-down test for thresholding wavelet coefficients. By introducing the concept of a false discovery error rate in testing wavelet coefficients, we shrink the wavelet coefficients with p -values higher than the error rate. The error rate controls the expected proportion of wrongly accepted coefficients among chosen wavelet coefficients. Bootstrap samples are used to approximate the p -value for computational efficiency. We also present some guidelines for selecting the values of hyper-parameters which affect the performance in the step-down thresholding procedure. Based on some common testing signals and an air-conditioner sounds example, the comparison of our proposed procedure with other thresholding methods in the literature is performed. The analytical results show that the proposed procedure has a potential in data-denoising and data-reduction in a variety of signal reconstruction applications.

42 ENGINEERING↗

Joint Electricity and Natural Gas Transmission Planning with Endogenous Market Feedbacks

Recent trends in gas-fired power plant installation has increased the connections between the electric power and natural gas industries. Despite these dependencies, both industries must meet commercial, political, operational and technical requirements that often force the industries to plan and operate in isolation. As a result, undesired situations may arise, such as those experienced by both systems during the winter of 2013/2014 in the northeastern United States. In this work, we consider the technical challenges and present a Combined Electricity and Gas Expansion (CEGE) planning model. The CEGE model minimizes the cost of meeting gas and electricity demand during high stress conditions and introduces an elasticity model for analysis of gas-price volatility caused by congestion. The underlying mathematical formulation considers recent advances in convex approximations to make the problem computationally tractable when applied to large-scale CEGE instances. We conduct an indepth analysis on integrated test systems that include the New England area.

03 NATURAL GAS↗

Calculating frequency at loads in simulations of electro-mechanical transients

This paper introduces a new method for calculating frequency at an electrical load in simulations of electro-mechanical transients. The method is designed for simulation studies that require accurate models of sensors such as phasor measurement units and F-Net devices, which measure frequency at locations away from generating plants. These sensors are poised to become critical components in the control systems of electrical power grids, and therefore simulation tools that incorporate accurate models of these devices are essential. The method proposed here corrects two drawbacks of using numerically computed phase angle derivatives to approximate frequency. First, it eliminates spurious spikes in frequencies calculated at loads. Second, it eliminates instabilities induced by the simulator in studies of frequency responsive loads. The proposed method is derived from a simplified model of the generators and loads in an electrical system, but in the final analysis does not depend critically on these simplifications and is therefore applicable to more sophisticated models. The method is demonstrated with the simplified model applied to the IEEE 14 and 300 bus systems.

42 ENGINEERING↗

srMO-BO-3GP: A sequential regularized multi-objective Bayesian optimization for constrained design applications using an uncertain Pareto classifier

Bayesian optimization (BO) is an efficient and flexible global optimization framework that is applicable to a very wide range of engineering applications. To leverage the capability of the classical BO, many extensions, including multi-objective, multi-fidelity, parallelization, and latent-variable modeling, have been proposed to address the limitations of the classical BO framework. In this work, we propose a novel multi-objective BO formalism, called srMO-BO-3GP, to solve multi-objective optimization problems in a sequential setting. Three different Gaussian processes (GPs) are stacked together, where each of the GPs is assigned with a different task. The first GP is used to approximate a single-objective computed from the multi-objective definition, the second GP is used to learn the unknown constraints, and the third one is used to learn the uncertain Pareto frontier. At each iteration, a multi-objective augmented Tchebycheff function is adopted to convert multi-objective to single-objective, where the regularization with a regularized ridge term is also introduced to smooth the single-objective function. Finally, we couple the third GP along with the classical BO framework to explore the convergence and diversity of the Pareto frontier by the acquisition function for exploitation and exploration. The proposed framework is demonstrated using several numerical benchmark functions, as well as a thermomechanical finite element model for flip-chip package design optimization.

42 ENGINEERING↗

The Study of Magnetic Fluid Flows in a Laterally Heated Vertical Channel

Convection of a stratified magnetic fluid in a laterally heated vertical channel is investigated experimentally and theoretically. The dynamics of the behavior of convective rolls, their velocity and deformation, are investigated. It is shown that the complex inhomogeneous structure of the flow is attributed to the stratification of nanoparticles in the gravitational field. On the basis of a mathematical model of convection in the Boussinesq approximation, a large series of computational experiments are carried out for various parameters of the problem: the initial distribution of nanopartciles, the Boltzmann number, the Soret parameter, and the sedimentation length. A range of parameters is found in which the numerical and experimental results are qualitatively similar.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Pressio

Reduced-order Models (ROMs). ROMs are "compressed" approximations of high-fidelity computational models. Implementing ROM methods in production codes is typically intrusive, i.e. the native codes must be adapted and modified, with individual ROM methods reimplemented in every application code. This clearly constitutes an obstacle to users who want to use ROMs. To address this, we have developed Pressio, which is a C++ header-only ROM library that can be used by an application code in a non-intrusive fashion. The main objectives behind the design of Pressio are: (a) support for general computational models (data structures, PDE types); (b) heterogeneous hardware (CPU, GPU); (c) performance; and (d) extensibility. Using metaprogramming techniques, Pressio detects and leverages the application?s native linear algebra data structures (e.g. vector and matrix) to run the ROM methods. The application only needs to expose the velocity vector and Jacobian matrix via an adapter class. Pressio checks at compile time that the target application meets the correct API. The library is structured in several modular packages including (a) non-linear least-square solvers (e.g. Gauss-Newton with and without line-search); (b) singular value decomposition (for the computation of the ROM generalized coordinates) and (c) algebraic hyper-reduction.SAND2019-5878 M

Blonigan, Patrick↗

Pressio v.1.0

Reduced-order Models (ROMs). ROMs are "compressed" approximations of high-fidelity computational models. Implementing ROM methods in production codes is typically intrusive, i.e. the native codes must be adapted and modified, with individual ROM methods reimplemented in every application code. This clearly constitutes an obstacle to users who want to use ROMs. To address this, we have developed Pressio, which is a C++ header-only ROM library that can be used by an application code in a non-intrusive fashion. The main objectives behind the design of Pressio are: (a) support for general computational models (data structures, PDE types); (b) heterogeneous hardware (CPU, GPU); (c) performance; and (d) extensibility. Using metaprogramming techniques, Pressio detects and leverages the application?s native linear algebra data structures (e.g. vector and matrix) to run the ROM methods. The application only needs to expose the velocity vector and Jacobian matrix via an adapter class. Pressio checks at compile time that the target application meets the correct API. The library is structured in several modular packages including (a) non-linear least-square solvers (e.g. Gauss-Newton with and without line-search); (b) singular value decomposition (for the computation of the ROM generalized coordinates) and (c) algebraic hyper-reduction.SAND2019-5878 M

Blonigan, Patrick↗

Single-Logarithmic Corrections to Small-$x$ Helicity Evolution

The small- x x quark helicity evolution equations at double-logarithmic order, with the kernel \sim\alpha_s\ln^2(1/x) ∼ α s ln 2 ( 1 / x ) , have been derived previously. In this work, we derive the single-logarithmic corrections to the equations, to order \alpha_s\ln(1/x) α s ln ( 1 / x ) of the evolution kernel. The new equations include the effects of the running coupling and the unpolarized small- x x evolution, both of which are parametrically significant at single-logarithmic order. The large- N_c N c and large- N_c\ N_f N c N f approximations to the equation are computed. (Here, N_c N c and N_f N f are the numbers of quark colors and flavors, respectively.) Their solutions will provide more precise estimates of the quark helicity distribution at small x x , contributing to the resolution of the proton spin puzzle.

Tawabutr, Yossathorn↗

Spatio-Temporal Data Analysis at Scale Using Models Based on Gaussian Processes

Gaussian processes are the most commonly used statistical model for spatial and spatio-temporal processes that vary continuously. They are broadly applicable in the physical sciences and engineering and are also frequently used to approximate the output of complex computer models, deterministic or stochastic. We undertook research related to theory, computation, and applications of Gaussian processes as well as some work on estimating extremes of distributions for which a Gaussian process assumption might be inappropriate. Our theoretical contributions include the development of new classes of spatial-temporal covariance functions with desirable properties and new results showing that certain covariance models lead to predictions with undesirable properties. To understand how Gaussian process models behave when applied to deterministic computer models, we derived what we believe to be the first significant results on the large sample properties of estimators of parameters of Gaussian processes when the actual process is a simple deterministic function. Finally, we investigated some theoretical issues related to maxima of observations with varying upper bounds and found that, depending on the circumstances, standard large sample results for maxima may or may not hold. Our computational innovations include methods for analyzing large spatial datasets when observations fall on a partially observed grid and methods for estimating parameters of a Gaussian process model from observations taken by a polar-orbiting satellite. In our application of Gaussian process models to deterministic computer experiments, we carried out some matrix computations that would have been infeasible using even extended precision arithmetic by focusing on special cases in which all elements of the matrices under study are rational and using exact arithmetic. The applications we studied include total column ozone as measured from a polar-orbiting satellite, sea surface temperatures over the Pacific Ocean, and annual temperature extremes at a site in New York City. In each of these applications, our theoretical and computational innovations were directly motivated by the challenges posed by analyzing these and similar types of data.

97 MATHEMATICS AND COMPUTING↗

A Vorticity Description of the Nuclear Cloud

We describe a model of the nuclear cloud in terms of the vorticity field associated with a buoyant vortex ring. A series of physical approximations are introduced that lower computational costs and render the model amenable for operational use. The determination of model parameters from the yield and emplacement of the weapon is also discussed.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Leveraging a Neural Network-Enhanced Reproducing Kernel Particle Method for Multiphysics Degradation Modeling of Energy Storage Materials

Energy storage materials exhibit strong electro-chemo-mechanical coupling and highly anisotropic material properties, contributing to the formation and propagation of micro-cracking during charge/discharge cycling and resulting in reduced performance and service life. A coupled electro-chemo-mechanical reproducing kernel particle method (RKPM) formulation has been developed to analyze this system. With microstructural images supplied by the National Renewable Energy Laboratory (NREL), pixel-based model construction by RKPM is used to represent the complex material microstructures that dictate the coupled physics of these systems. Traditional electro-chemo-mechanical models rely on mesh-based finite element methods, which can lead to difficulties in meshing such complex geometries and capturing crack propagation due to mesh dependency. Here, a neural network-enhanced reproducing kernel particle method (NN-RKPM) [1, 2] is introduced to effectively model damage and crack propagation in the material microstructures; the location, orientation, and solution transition near a localization are automatically captured by superimposed block-level NN optimizations. This NN enrichment approach allows for effective modeling of localizations via a fixed background discretization, relieving tedious efforts for adaptive refinement in traditional mesh-based methods. Applications to the heterogeneous microstructures of Li-ion battery cathodes will be presented to demonstrate the effectiveness of the proposed methods. NN-RKPM is additionally used to inform how crack opening and closure in turn affect the coupled chemical equations and material microstructure. Reference: [1] Baek, J., Chen, J. S., Susuki, K., "Neural Network enhanced Reproducing Kernel Particle Method for Modeling Localizations," International Journal for Numerical Methods in Engineering, Vol. 123, pp 4422-4454, https://doi.org/10.1002/nme.7040, 2022. [2] Baek, J., Chen, J. S., "A Neural Network-Based Enrichment of Reproducing Kernel Approximation for Modeling Brittle Fracture", Computer Methods in Applied Mechanics and Engineering Vol. 410, 116590, 2024.

degradation↗

Easy-plane spin Hall nano-oscillators as spiking neurons for neuromorphic computing

Here we show analytically using a macrospin approximation that easy-plane spin Hall nano-oscillators excited by a spin current polarized perpendicularly to the easy plane have phase dynamics analogous to that of Josephson junctions. Similarly to Josephson junctions, they can reproduce the spiking behavior of biological neurons that is appropriate for neuromorphic computing. To take advantage of typical spin-orbit torques, we use a nanoconstriction geometry, in which the magnetostatic interaction and magnetocrystalline anisotropy are tuned to create an easy plane that includes the interface normal direction. We perform micromagnetic simulations of such oscillators realized in this geometry and show that the easy-plane spiking dynamics is preserved in this experimentally feasible architecture. Finally we simulate two elementary neural network blocks that implement operations essential for neuromorphic computing. First, we show that output spikes energies from two neurons can be summed and injected into a following layer neuron and second, we demonstrate that outputs can be multiplied by synaptic weights implemented by locally modifying the anisotropy.

36 MATERIALS SCIENCE↗

Closures and Simulation for Thermal Radiation Transport in Stochastic Media with Nonlinear Temperature Dependence

Because of the practical challenge of rendering very complex realistic spatial structures for numerical work, it is common practice to resort to characterizing such media as stochastic mixtures of materials, ideally parametrized with low order statistics such as the mean, variance, and correlation functions of the now random material properties. This enables realizations of the medium to be repeatedly generated and radiation transport computations to, in principle, be performed for a large ensemble of these realizations to obtain a statistically well-characterized radiation field. Statistical post-processing yields desired quantities such as conditional and unconditional mean radiation flux and probability distributions of transmitted radiation. However, such computations prove expensive for all but the simplest stochastic geometries and are most suited for benchmarking approximate models. The most common approximations lead to homogenized media so that transport computations are required only on a single medium realization but by construct provide only limited statistical information on the radiation field. Almost all approximate approaches to this problem attempt to develop equations for low order moments of the radiation intensity (mean, second moment, correlation function) but inevitably encounter a closure problem: the equation for any statistical moment will contain terms depending on unknown higher-order moments. Thus, the challenge shifts to one of developing closure relations that relate the unknown moments to the lower order moments. Under very special conditions, an exact closure can be derived but in general closures are heuristically stated constitutive relations. Also, closure approaches depend on whether the mixing statistics are spatially and/or temporally continuous as in fluctuating turbulent fields, or discontinuous as in randomly mixed solid chunks of material. Thus, unconditional averaging is generally applied in the former case but conditional averaging is more appropriate when the mixing is discontinuous. In this work, the emphasis is on binary statistical mixtures of immiscible fluids as as such the quantities of interest are averages (flux, temperature) conditioned on the material type.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Conditioning Analysis of Incomplete Cholesky Factorizations with Orthogonal Dropping

The analysis of preconditioners based on incomplete Cholesky factorization in which the neglected (dropped) components are orthogonal to the approximations being kept is presented. General estimate for the condition number of the preconditioned system is given which only depends on the accuracy of individual approximations. The estimate is further improved if, for instance, only the newly computed rows of the factor are modified during each approximation step. In this latter case it is further shown to be sharp. The analysis is illustrated with some existing factorizations in the context of discretized elliptic partial differential equations.

97 MATHEMATICS AND COMPUTING↗

Computing partition functions in the one-clean-qubit model

We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive-semidefinite Hamiltonians, our method has an expected running-time that is almost linear in [M/( ε rel Z )] 2 , where M is the dimension of the quantum system, Z is the partition function, and ε rel is the relative precision. It is based on approximations of the exponential operator as linear combinations of certain operators related to block-encoding of Hamiltonians or Hamiltonian evolutions. The trace of each operator is estimated using a standard algorithm in the one-clean-qubit model. For large values of Z , our method may run faster than exact classical methods, whose complexities are polynomial in M . We also prove that a version of the partition function estimation problem within additive error is complete for the so-called DQC1 complexity class, suggesting that our method provides a superpolynomial speedup for certain parameter values. Overall, to attain a desired relative precision, we develop a classical procedure based on a sequence of approximations within predetermined additive errors that may be of independent interest.

97 MATHEMATICS AND COMPUTING↗