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,693 records · Page 94

DIATOM (Data Initialization and Modification) Library Version 7.0

DIATOM is a library that provides numerical simulation software with a computational geometry front end that can be used to build up complex problem geometries from collections of simpler shapes. The library provides a parser which allows for application-independent geometry descriptions to be embedded in simulation software input decks. Descriptions take the form of collections of primitive shapes and/or CAD input files and material properties that can be used to describe complex spatial and temporal distributions of numerical quantities (often called “database variables” or “fields”) to help define starting conditions for numerical simulations. The capability is designed to be general purpose, robust and computationally efficient. By using a combination of computational geometry and recursive divide-and-conquer approximation techniques, a wide range of primitive shapes are supported to arbitrary degrees of fidelity, controllable through user input and limited only by machine resources. Through the use of call-back functions, numerical simulation software can request the value of a field at any time or location in the problem domain. Typically, this is used only for defining initial conditions, but the capability is not limited to just that use. The most recent version of DIATOM provides the ability to import the solution field from one numerical solution as input for another.

Crawford, David A.↗

Coordinated Optimization and Control of Residential Solid State Power Substations in Electrical Distribution Network

This paper proposes a computationally efficient mixed integer linear programming (MILP) model for the coordinated optimization of solid-state power substations (SSPSs) in a feeder considering the full unbalanced three-phase structure of the distribution grid and its characteristics. The proposed model determines the optimal real and reactive power of each SSPS at the point of common coupling (PCC) that minimizes the operating cost and maximizes the system performance, e.g., voltage regulation and phase balancing. To improve the computational efficiency, an inscribed octagon is introduced to approximate the quadratic capacity constraints of components. Numerical simulation results show the effectiveness of the proposed model and significant improvements in voltage profiles and power imbalance between phases.

Liu, Guodong↗

Simulations of Quantum Circuits with Approximate Noise using qsim and Cirq

We introduce multinode quantum trajectory simulations with qsim, an open source high performance simulator of quantum circuits. qsim can be used as a backend of Cirq, a Python software library for writing quantum circuits. We present a novel delayed inner product algorithm for quantum trajectories which can result in an order of magnitude speedup for low noise simulation. We also provide tools to use this framework in Google Cloud Platform, with high performance virtual machines in a single mode or multinode setting. Multinode configurations are well suited to simulate noisy quantum circuits with quantum trajectories. Finally, we introduce an approximate noise model for Google's experimental quantum computing platform and compare the results of noisy simulations with experiments for several quantum algorithms on Google's Quantum Computing Service.

Isakov, Sergei V.↗

Particle Size Analysis and Distribution

Scanning Electron Microscope (SEM) is a instrument used for examining samples at magnifications from 32 X to 500,000 X (for our instrument). The SEM is attached with an electron gun and is directed onto the sample. The sample then produces an image where it is read on the monitor. The electron gun is positioned at the top because it needs to shoot at the sample that is being tested. The electrons are then shot in a downward motion traveling through several lenses, such as the condenser lens for a more precise reading. Once the samples have been read by the instrument, it will show a picture that has a certain number of particles. Particle size distribution have many uses that are essential to life habits (health) or even conventional use for example construction. Here are just a few examples of how particle size analysis and distribution are being used even today. This Standard Reference Material (SRM) is primarily intended for use in the calibration of equipment used to measure particle size distributions (PSD) in the 9 μm to 30 μm range. A unit of SRM 1984 consists of a single bottle containing approximately 14 g of tungsten carbide/cobalt powder. Certified values: The PSD values at five mass percentiles were measured by scanning electron microscopy (SEM) and laser light scattering (LLS). The NIST certified PSD values by SEM are listed. These certified values were determined by the measurement of over 10 000 individual particles from three bottles. Comparing the certified NIST SRM 1984 tungsten carbide/cobalt powder with our results are almost identical. This is great because more accurate work can be done and proves that our laboratory is able to reproduce NIST results. In conclusion, the scanning electron microscope is used to capture the sampled element and display it to be counted. Without the use of particle distribution, it would be a difficult time to get necessities such as medicine, asthma pumps, constructing materials, or as simple as ink. Overall, our study is an experimental comparison of the techniques we have in house, which are LLS and SEM (combined with the NIH ImageJ software) using the NIST SRM-1984 as a common, well characterized sample so that we have an idea of how the results from the techniques compare.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Hierarchical OPF Algorithm with Improved Gradient Evaluation in Three-Phase Networks

Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient algorithms converge to solutions with voltage violation. In this paper, we improve a recent hierarchical OPF algorithm that rested on primal-dual gradients evaluated with a linearized distribution power flow model. Specifically, we propose a more accurate gradient evaluation method based on an unbalanced three-phase nonlinear distribution power flow model to mitigate the errors arising from linearization. The resultant gradients feature a blocked structure that enables our development of an improved hierarchical primal-dual algorithm to solve the OPF problem. Numerical results on the IEEE 123-bus test feeder and a 4,518-node test feeder show that the proposed method can enhance voltage safety at comparable computational efficiency with the linearized algorithm.

approximation algorithms↗

A generalized polynomial chaos based ensemble Kalman filter with high accuracy

As one of the most adopted sequential data assimilation methods in many areas, especially those involving complex nonlinear dynamics, the ensemble Kalman filter (EnKF) has been under extensive investigation regarding its properties and efficiency. Compared to other variants of the Kalman filter (KF), EnKF is straightforward to implement, as it employs random ensembles to represent solution states. This, however, introduces sampling errors that affect the accuracy of EnKF in a negative manner. Though sampling errors can be easily reduced by using a large number of samples, in practice this is undesirable as each ensemble member is a solution of the system of state equations and can be time consuming to compute for large-scale problems. In this paper we present an efficient EnKF implementation via generalized polynomial chaos (gPC) expansion. The key ingredients of the proposed approach involve (1) solving the system of stochastic state equations via the gPC methodology to gain efficiency; and (2) sampling the gPC approximation of the stochastic solution with an arbitrarily large number of samples, at virtually no additional computational cost, to drastically reduce the sampling errors. The resulting algorithm thus achieves a high accuracy at reduced computational cost, compared to the classical implementations of EnKF. Numerical examples are provided to verify the convergence property and accuracy improvement of the new algorithm. We also prove that for linear systems with Gaussian noise, the first-order gPC Kalman filter method is equivalent to the exact Kalman filter.

97 MATHEMATICS AND COMPUTING↗

Verifying the error bound of numerical computation implemented in computer systems

A verification tool receives a finite precision definition for an approximation of an infinite precision numerical function implemented in a processor in the form of a polynomial of bounded functions. The verification tool receives a domain for verifying outputs of segments associated with the infinite precision numerical function. The verification tool splits the domain into at least two segments, wherein each segment is non-overlapping with any other segment and converts, for each segment, a polynomial of bounded functions for the segment to a simplified formula comprising a polynomial, an inequality, and a constant for a selected segment. The verification tool calculates upper bounds of the polynomial for the at least two segments, beginning with the selected segment and reports the segments that violate a bounding condition.

97 MATHEMATICS AND COMPUTING↗

A TEST OF THICK-TARGET NONUNIFORM IONIZATION AS AN EXPLANATION FOR BREAKS IN SOLAR FLARE HARD X-RAY SPECTRA

Solar nonthermal hard X-ray (HXR) flare spectra often cannot be fitted by a single power law, but rather require a downward break in the photon spectrum. A possible explanation for this spectral break is nonuniform ionization in the emission region. We have developed a computer code to calculate the photon spectrum from electrons with a power-law distribution injected into a thick target in which the ionization decreases linearly from 100% to zero. We use the bremsstrahlung cross section from Haug, which closely approximates the full relativistic Bethe-Heitler cross section, and compare photon spectra computed from this model with those obtained by Kontar et al., who used a step-function ionization model and the Kramers approximation to the cross section. We find that for HXR spectra from a target with nonuniform ionization, the difference (DELTAgamma) between the power-law indexes above and below the break has an upper limit between approx0.2 and 0.7 that depends on the power-law index delta of the injected electron distribution. A broken power-law spectrum with a higher value of DELTAgamma cannot result from nonuniform ionization alone. The model is applied to spectra obtained around the peak times of 20 flares observed by the Ramaty High-Energy Solar Spectroscopic Imager from 2002 to 2004 to determine whether thick-target nonuniform ionization can explain the measured spectral breaks. A Monte Carlo method is used to determine the uncertainties of the best-fit parameters, especially on DELTAgamma. We find that 15 of the 20 flare spectra require a downward spectral break and that at least six of these could not be explained by nonuniform ionization alone because they had values of DELTAgamma with less than a 2.5% probability of being consistent with the computed upper limits from the model. The remaining nine flare spectra, based on this criterion, are consistent with the nonuniform ionization model.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Two-Yukawa fluid at a hard wall: Field theory treatment

We apply a field-theoretical approach to study the structure and thermodynamics of a two-Yukawa fluid confined by a hard wall. We derive mean field equations allowing for numerical evaluation of the density profile which is compared to analytical estimations. Beyond the mean field approximation, analytical expressions for the free energy, the pressure, and the correlation function are derived. Subsequently, contributions to the density profile and the adsorption coefficient due to Gaussian fluctuations are found. Both the mean field and the fluctuation terms of the density profile are shown to satisfy the contact theorem. We further use the contact theorem to improve the Gaussian approximation for the density profile based on a better approximation for the bulk pressure. The results obtained are compared to computer simulation data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Approximate Green’s Function Coupled Cluster A Method Employing Effective Dimension Reduction

The Green’s function coupled cluster (GFCC) method, originally proposed in the early 1990s, is a powerful many-body tool for computing and analyzing the electronic structures of molecular structures and periodic systems, especially when electrons are strongly correlated. However, in order for the GFCC method to become an approach that can be routinely used in the electronic structure calculations, more robust linear algebraic techniques and approximations need to be employed to reduce its extremely high computational overhead. In our recent studies, we showed that the GFCC equation can be numerically solved by seeking solutions of multiple linear systems in the frequency regime of interest, which can be easily distributed in a massively parallel environment, and broaden the avenue for more state-of-the-art numerical linear algebraic tools associated with multiple linear systems to be kicked in to this field. In the present pursuit of this practice, we show a successful application of model order reduction (MOR) techniques in the GFCC framework. Briefly speaking, for a frequency regime of interest that requires a high resolution of spectral function, instead of solving GFCC linear equation in the original dimension for every single frequency point, an easily-solvable linear system model with reduced dimension can be built upon projecting the original GFCC linear system into a subspace, from which the interpolation and extrapolation can give a reasonable approximation to the results of the original GFCC linear equations. Here, we show that the subspace can be properly constructed in an iterative manner from the auxiliary vectors of the GFCC linear equations at some select frequencies inside the frequency regime. During the iterations, the quality of the subspace, as well as the linear system model, can be systematically improved. The approach is tested in this work in terms of the efficiency and accuracy of computing spectral functions for some typical molecular systems including carbon monoxide, 1,3-butadiene, benzene, and adenine molecules. As a byproduct, the high quality linear system model is also found to be able to provide high quality initial guess for the existing linear solver to improve the convergence performance.

Peng, Bo↗

Surrogate Model Guided Optimization of Expensive Black-Box Multi-Objective Problems: A Posteriori Methods

Many engineering applications require the simultaneous optimization of multiple conflicting objective functions. Often, these objective functions are evaluated using highly accurate computer simulations that are computationally too expensive to be evaluated hundreds or thousands of times during optimization. Thus, the goal is to find good approximations of the Pareto front using as few of these expensive simulations as possible. Here, we describe an optimization approach based on surrogate models and diverse sampling strategies to accelerate the search for the Pareto solutions. We use a separate surrogate model for approximating each objective function and then we use the surrogate models to inform where additional expensive simulations should be run. The surrogate models are updated in an active learning framework whenever new information from the expensive simulations becomes available. The sampling strategies aim at balancing local improvements of the approximate Pareto front and global exploration to identify the extrema and fill in large gaps of the approximate Pareto front. We demonstrate on a large set of benchmark problems the effectiveness of the method for finding good approximations of the Pareto front.

MATHEMATICS AND COMPUTING↗

Joint Chance Constraints Reduction Through Learning in Active Distribution Networks

Due to an increase in distributed generation and controllable loads, distribution networks are frequently operating under high levels of uncertainty. Joint chance constraints, which seek to satisfy multiple constraints simultaneously with a prescribed probability, are one way to incorporate uncertainty across sets of constraints for optimization and control of these networks. Due to the complexity of evaluating these constraints directly, sampling approaches or approximations can be used to transform the joint chance constraint into deterministic constraints. However, sampling techniques may be extremely computationally expensive and not suitable for physical networks operating on fast timescales, and conservative approximations may needlessly result in a much higher cost of system operation. The proposed framework aims to provide a scalable, data-driven approach which learns operational trends in a power network, eliminates zero-probability events (e.g., inactive constraints), and uses this additional information to accurately and efficiently approximate the joint chance constraint directly.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An Improved Discrete Least-Squares/Reduced-Basis Method for Parameterized Elliptic PDEs

It is shown that the computational efficiency of the discrete least-squares (DLS) approximation of solutions of stochastic elliptic PDEs is improved by incorporating a reduced-basis method into the DLS framework. In particular, we consider stochastic elliptic PDEs with an affine dependence on the random variable. The goal is to recover the entire solution map from the parameter space to the finite element space. To this end, first, a reduced-basis solution using a weak greedy algorithm is constructed, then a DLS approximation is determined by evaluating the reduced-basis approximation instead of the full finite element approximation. The main advantage of the new approach is that one only need apply the DLS operator to the coefficients of the reduced-basis expansion, resulting in huge savings in both the storage of the DLS coefficients and the online cost of evaluating the DLS approximation. In addition, the recently developed quasi-optimal polynomial space is also adopted in the new approach, resulting in superior convergence rates for a wider class of problems than previous analyzed. Numerical experiments are provided that illustrate the theoretical results.

97 MATHEMATICS AND COMPUTING↗

Photons and baryons before atoms: Improving the tight-coupling approximation

Prior to recombination photons, electrons, and atomic nuclei rapidly scattered and behaved, almost, like a single tightly-coupled photon-baryon plasma. We investigate here the accuracy of the tight-coupling approximation commonly used to numerically evolve the baryon and photon perturbation equations at early times. By solving the exact perturbations equations with a stiff solver starting deep in the radiation-dominated epoch, we find the level of inaccuracy introduced by resorting to the standard first-order tight-coupling approximation. We develop a new second-order approximation in the inverse Thomson opacity expansion and show that it closely tracks the full solution, at essentially no extra numerical cost. We find the bias on estimates of cosmological parameters introduced by the first-order approximation is, for most parameters, negligible. Finally, we show that our second-order approximation can be used to reduce the time needed to compute cosmic microwave background angular spectra by as much as {approx}17%.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

pnnl/projection_ntk

This is a repository for work conducted in our research paper we would like to make open source. The main features are that we forked another open source library and added functionality that enabled us to compute neural-kernel objects using random vector projection software for both computer vision and large language text models. The new features are specifically code that enables the calculation of objects we define and refer to as the projection pseudo neural tangent kernel and the projection trace neural tangent kernel; both of which are approximations of the empirical neural tangent kernel. The software that computes the projections themselves are not part of the invention, but are necessarily tied to our software and licensed via MIT license, and BSD 2 license.

Georgiev, Kristian↗

A direct approach to estimate the anisotropy of protein structures from small-angle X-ray scattering

In the field of small-angle X-ray scattering (SAXS), the task of estimating the size of particles in solution is usually synonymous with the Guinier plot. The approximation behind this plot, developed by Guinier in 1939, provides a simple yet accurate characterization of the scattering behavior of particles at low scattering angle or momentum transfer q , together with a computationally efficient way of inferring their radii of gyration R G . Moreover, this approximation is valid beyond spherical scatterers, making its use ubiquitous in the SAXS world. However, when it is important to estimate further particle characteristics, such as the anisotropy of the scatterer's shape, no similar or extended approximations are available. Existing tools to characterize the shape of scatterers rely either on prior knowledge of the scatterers' geometry or on iterative procedures to infer the particle shape ab initio . In this work, a low-angle approximation of the scattering intensity I ( q ) for ellipsoids of revolution is developed and it is shown how the size and anisotropy information can be extracted from the parameters of that approximation. The goal of the approximation is not to estimate a particle's full structure in detail, and thus this approach will be less accurate than well known iterative and ab initio reconstruction tools available in the literature. However, it can be considered as an extension of the Guinier approximation and used to generate initial estimates for the aforementioned iterative techniques, which usually rely on R G and D max for initialization. This formulation also demonstrates that nonlinearity in the Guinier plot can arise from anisotropy in the scattering particles. Beyond ideal ellipsoids of revolution, it is shown that this approximation can be used to estimate the size and shape of molecules in solution, in both computational and experimental scenarios. The limits of the approach are discussed and the impact of a particle's anisotropy in the Guinier estimate of R G is assessed.

catalysis (homogeneous), catalysis (heterogeneous)↗

Highly relativistic spinning particle starting near r{sub ph}{sup (-)} in a Kerr field

Using the Mathisson-Papapetrou-Dixon equations, we investigate the trajectories of a spinning particle starting near r{sub ph}{sup (-)} in a Kerr field and moving with the velocity close to the velocity of light (r{sub ph}{sup (-)} is the Boyer-Lindquist radial coordinate of the counter-rotation circular photon orbits). First, as a partial case of these trajectories, we consider the equatorial circular orbit with r=r{sub ph}{sup (-)}. This orbit is described by the solution that is common for the rigorous Mathisson-Papapetrou-Dixon equations and their linear spin approximation. Then different cases of the nonequatorial motions are computed and illustrated by the typical figures. All these orbits exhibit the effects of the significant gravitational repulsion that are caused by the spin-gravity interaction. Possible applications in astrophysics are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Reformulation of Linear and Nonlinear Solid-Phase Diffusion in Lithium-ion Battery Models using Symmetric Polynomials: Mass Conservation and Computational Efficiency

Lithium-ion batteries are typically modeled using porous electrode theory coupled with various transport and reaction mechanisms, along with suitable discretization or approximations for the solid-phase diffusion equation. The solid-phase diffusion equation represents the main computational burden for typical pseudo-2-dimensional (p2D) models since these equations in the pseudo r -dimension must be solved at each point in the computational grid. This substantially increases the complexity of the model as well as the computational time. Traditional approaches towards simplifying solid-phase diffusion possess certain significant limitations, especially in modeling emerging electrode materials which involve phase changes and variable diffusivities. A computationally efficient representation for solid-phase diffusion is discussed in this paper based on symmetric polynomials using Orthogonal Collocation and Galerkin formulation (weak form). A systematic approach is provided to increase the accuracy of the approximation (p form in finite element methods) to enable efficient simulation with a minimal number of semi-discretized equations, ensuring mass conservation even for non-linear diffusion problems involving variable diffusivities. These methods are then demonstrated by incorporation into the full p2D model, illustrating their advantages in simulating high C-rates and short-time dynamic operation of Lithium-ion batteries.

25 ENERGY STORAGE↗