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,783 records · Page 99

Approximation by simple partial fractions on the semi-axis

This paper investigates the simple partial fractions (that is, the logarithmic derivatives of polynomials) all of whose poles lie within the angular domain {lambda}{sub {gamma}}={l_brace}z:arg z element of ({gamma},2{pi}-{gamma}){r_brace}, for any {gamma} element of [0,{pi}/2]. It is shown that they are contained in a proper half-space of the space L{sub p}(R{sub +}) for any p element of (1,p{sub 0}) (in particular, they are not dense in this space) and conversely, they are dense in L{sub p}(R{sub +}) for any p{>=}p{sub 0}, where p{sub 0}=(2{pi}-2{gamma})/({pi}-2{gamma}). The distances from the poles of a simple partial fraction r to the semi-axis R{sub +} are estimated in terms of the degree of the fraction r and its norm in L{sub 2}(R{sub +}). The approximation properties of sets of simple partial fractions of degree at most n are investigated, as well as properties of the least deviations {rho}{sub n}(f) from these sets for the functions f element of L{sub 2}(R{sub +}). Bibliography: 14 titles.

97 MATHEMATICS AND COMPUTING↗

Parallel octree-based hexahedral mesh generation for eulerian to lagrangian conversion.

Computational simulation must often be performed on domains where materials are represented as scalar quantities or volume fractions at cell centers of an octree-based grid. Common examples include bio-medical, geotechnical or shock physics calculations where interface boundaries are represented only as discrete statistical approximations. In this work, we introduce new methods for generating Lagrangian computational meshes from Eulerian-based data. We focus specifically on shock physics problems that are relevant to ASC codes such as CTH and Alegra. New procedures for generating all-hexahedral finite element meshes from volume fraction data are introduced. A new primal-contouring approach is introduced for defining a geometric domain. New methods for refinement, node smoothing, resolving non-manifold conditions and defining geometry are also introduced as well as an extension of the algorithm to handle tetrahedral meshes. We also describe new scalable MPI-based implementations of these procedures. We describe a new software module, Sculptor, which has been developed for use as an embedded component of CTH. We also describe its interface and its use within the mesh generation code, CUBIT. Several examples are shown to illustrate the capabilities of Sculptor.

99 GENERAL AND MISCELLANEOUS↗

Propagation of radio frequency waves through turbulent plasmas

The practical and economic viability of tokamak fusion reactors depends, in a significant way, on the efficiency of radio frequency (RF) waves to deliver energy and momentum to the plasma in the core of the reactor. The RF electromagnetic waves, excited by antenna structures placed near the wall of a tokamak, have to propagate through the turbulent edge plasma along their path to the core of the fusion device. In present day experiments, the radial width of the edge region and scrape-off layer is of the order of a few centimeters. In ITER, and in future fusion reactors, this width will be of the order of tens of centimeters. Any effects on RF waves due to plasma turbulence have to be properly understood in order to optimize the delivery of RF energy and momentum into the core. This paper is on a multi-pronged, theoretical and computational, approach that is being pursued to quantify the effect of edge plasma turbulence on the propagation of RF waves. The theoretical and analytical models are based on solutions of the Faraday-Ampere equation in a magnetized plasma and on the Kirchhoff tangent plane approximation. An effective medium approach has been developed so as to approximate the permittivity of a turbulent plasma by analytical expressions. The computations are being carried out with a newly developed code ScaRF that is based on the finite difference finite domain technique for solving Maxwell's equations. The plasma permittivity can be assigned as desired. The code is being used to validate the analytical and theoretical models and to evaluate their limitations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Perturbative readout-error mitigation for near-term quantum computers

Readout errors on near-term quantum computers can introduce significant error to the empirical probability distribution sampled from the output of a quantum circuit. These errors can be mitigated by classical postprocessing given the access of an experimental response matrix that describes the error associated with the measurement of each computational basis state. However, the resources required to characterize a complete response matrix and to compute the corrected probability distribution scale exponentially with the number of qubits, n . In this work, we modify standard matrix inversion techniques using perturbative approximations with significantly reduced complexity and bounded error when the likelihood of high-order bit-flip events is strongly suppressed. Given a characteristic error rate q , we discuss a method to recover the probability of the all-zeros bit string p 0 by sampling only a small subspace of the response matrix before inverting readout error, resulting in a relative speedup of poly [ 2 n / ( n w ) ] , which we motivate using a simplified error model for which the approximation incurs only O ( q w ) error for some integer w . We then provide a generalized technique to efficiently recover full output distributions with O ( q w ) error in the perturbative limit. These approximate techniques for readout-error correction may greatly accelerate near-term quantum computing applications.

97 MATHEMATICS AND COMPUTING↗

On uniform approximation of elliptic functions by Pade approximants

Diagonal Pade approximants of elliptic functions are studied. It is known that the absence of uniform convergence of such approximants is related to them having spurious poles that do not correspond to any singularities of the function being approximated. A sequence of piecewise rational functions is proposed, which is constructed from two neighbouring Pade approximants and approximates an elliptic function locally uniformly in the Stahl domain. The proof of the convergence of this sequence is based on deriving strong asymptotic formulae for the remainder function and Pade polynomials and on the analysis of the behaviour of a spurious pole. Bibliography: 23 titles.

97 MATHEMATICS AND COMPUTING↗

Gauge properties of the guiding center variational symplectic integrator

Recently, variational symplectic algorithms have been developed for the long-time simulation of charged particles in magnetic fields. As a direct consequence of their derivation from a discrete variational principle, these algorithms have very good long-time energy conservation, as well as exactly preserving discrete momenta. We present stability results for these algorithms, focusing on understanding how explicit variational integrators can be designed for this type of system. It is found that for explicit algorithms an instability arises because the discrete symplectic structure does not become the continuous structure in the t → 0 limit. We examine how a generalized gauge transformation can be used to put the Lagrangian in the "antisymmetric discretization gauge," in which the discrete symplectic structure has the correct form, thus eliminating the numerical instability. Finally, it is noted that the variational guiding center algorithms are not electromagnetically gauge invariant. By designing a model discrete Lagrangian, we show that the algorithms are approximately gauge invariant as long as A and Φ are relatively smooth. A gauge invariant discrete Lagrangian is very important in a variational particle-in-cell algorithm where it ensures current continuity and preservation of Gauss's law.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Beyond Fisher forecasting for cosmology

The planning and design of future experiments rely heavily on forecasting to assess the potential scientific value provided by a hypothetical set of measurements. The Fisher information matrix, due to its convenient properties and low computational cost, provides an especially useful forecasting tool. However, the Fisher matrix only provides a reasonable approximation to the true likelihood when data are nearly Gaussian distributed and observables have nearly linear dependence on the parameters of interest. Also, Fisher forecasting techniques alone cannot be used to assess their own validity. Thorough sampling of the exact or mock likelihood can definitively determine whether a Fisher forecast is valid, though such sampling is often prohibitively expensive. Here we propose a simple test, based on the Derivative Approximation for likelihoods (DALI) technique, to determine whether the Fisher matrix provides a good approximation to the exact likelihood. We show that the Fisher matrix becomes a poor approximation to the true likelihood in regions where two-dimensional slices of level surfaces of the DALI approximation to the likelihood differ from two-dimensional slices of level surfaces of the Fisher approximation to the likelihood. We demonstrate that our method accurately predicts situations in which the Fisher approximation deviates from the true likelihood for various cosmological models and several data combinations, with only a modest increase in computational cost compared to standard Fisher forecasts.

79 ASTRONOMY AND ASTROPHYSICS↗

Data-based stochastic model reduction for the Kuramoto–Sivashinsky equation

In this paper, the problem of constructing data-based, predictive, reduced models for the Kuramoto–Sivashinsky equation is considered, under circumstances where one has observation data only for a small subset of the dynamical variables. Accurate prediction is achieved by developing a discrete-time stochastic reduced system, based on a NARMAX (Nonlinear Autoregressive Moving Average with eXogenous input) representation. The practical issue, with the NARMAX representation as with any other, is to identify an efficient structure, i.e., one with a small number of terms and coefficients. This is accomplished here by estimating coefficients for an approximate inertial form. Finally, the broader significance of the results is discussed.

97 MATHEMATICS AND COMPUTING↗

Continuous-variable quantum computation with spatial degrees of freedom of photons

We discuss the use of the transverse spatial degrees of freedom of photons propagating in the paraxial approximation for continuous-variable information processing. Given the wide variety of linear optical devices available, a diverse range of operations can be performed on the spatial degrees of freedom of single photons. Here we show how to implement a set of continuous quantum logic gates which allow for universal quantum computation. In contrast with the usual quadratures of the electromagnetic field, the entire set of single-photon gates for spatial degrees of freedom does not require optical nonlinearity and, in principle, can be performed with a single device: the spatial light modulator. Nevertheless, nonlinear optical processes, such as four-wave mixing, are needed in the implementation of two-photon gates. The efficiency of these gates is at present very low; however, small-scale investigations of continuous-variable quantum computation are within the reach of current technology. In this regard, we show how novel cluster states for one-way quantum computing can be produced using spontaneous parametric down-conversion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An optimum approximation of n-point correlation functions of random heterogeneous material systems

An approximate solution for n-point correlation functions is developed in this study. In the approximate solution, weight functions are used to connect subsets of (n-1)-point correlation functions to estimate the full set of n-point correlation functions. In previous related studies, simple weight functions were introduced for the approximation of three and four-point correlation functions. In this work, the general framework of the weight functions is extended and derived to achieve optimum accuracy for approximate n-point correlation functions. Such approximation can be utilized to construct global n-point correlation functions for a system when there exist limited information about these functions in a subset of space. To verify its accuracy, the new formulation is used to approximate numerically three-point correlation functions from the set of two-point functions directly evaluated from a virtually generated isotropic heterogeneous microstructure representing a particulate composite system. Similarly, three-point functions are approximated for an anisotropic glass fiber/epoxy composite system and compared to their corresponding reference values calculated from an experimental dataset acquired by computational tomography. Results from both virtual and experimental studies confirm the accuracy of the new approximation. The new formulation can be utilized to attain a more accurate approximation to global n-point correlation functions for heterogeneous material systems with a hierarchy of length scales.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

High-Fidelity Calibration and Characterization of Hyperspectral Computed Tomography System

This document archives the results developed by the Lab Directed Research and Development (LDRD) project sponsored by Sandia National Laboratories (SNL). In this work, a numerical study was performed to show the feasibility of approximating the non-linear operator of SNL's unique high-energy hyperspectral computed tomography system as a sequence of linear operators. The four main results gained from this work include the development of a simulation test-bed using a particle-transport Monte Carlo approach; the demonstration to assemble a linear operator of almost-arbitrary resolution for a given narrow energy window, developing a compression approach to dramatically reduce the size of the linear operator via a spline approach, and the demonstration of using the linear operator to perform processing of x-ray data; in this case, the development of an iterative reconstruction method. This numerical study has indicated that if these results can be replicated on the SNL system, the improved performance could be revolutionary as the method to approximate the nonlinear operator for a hyperspectral CT system is not feasible to perform on a traditional CT system.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Reduced-order modeling for nonlocal diffusion problems

In several settings, diffusive behavior is observed to not follow the rate of spread predicted by parabolic partial differential equations (PDEs) such as the heat equation. Such behaviors, often referred to as anomalous diffusion, can be modeled using nonlocal equations for which points at a finite distance apart can interact. An example of such models is provided by fractional derivative equations. Because of the nonlocal interactions, discretized nonlocal systems have less sparsity, often significantly less, compared with corresponding discretized PDE systems. As such, the need for reduced-order surrogates that can be used to cheaply determine approximate solutions is much more acute for nonlocal models compared with that for PDEs. In this paper, we consider the construction, application, and testing of proper orthogonal decomposition (POD) reduced models for an integral equation model for nonlocal diffusion. For certain modeling parameters, the model we consider allows for discontinuous solutions and includes fractional Laplacian kernels as a special case. Preliminary computational results illustrate the potential of using POD to obtain accurate approximations of solutions of nonlocal diffusion equations at much lower costs compared with, for example, standard finite element methods. Copyright © 2016 John Wiley & Sons, Ltd.

97 MATHEMATICS AND COMPUTING↗

Reassessing the Market—Computation Interface to Enhance Grid Security and Efficiency

The goal of this project is to reconsider core market and reliability processes that can potentially yield to transformative advances in power grid security, reliability, and efficiency. Current electric power market designs are strongly a function of computing capabilities and limitations that were available in the mid-to-late 1990s, circa deregulation. This includes constructs such as: (1) a 2-tiered day-ahead/real-time market construct; and (2) linearized (“DC”) real power flow approximations in dispatch and pricing. At that time, state-of-the-art computational capabilities could at the limit address deterministic mixed-integer programming formulations of unit commitment (UC) and linear programming formulations of economic dispatch (ED) at limited fidelity and scale. Such constraints forced limited look-ahead time-horizons, crude approximations of AC power flow physics and operations, and artificial partitioning between day-ahead markets, hour(s)-ahead reliability processes, and real-time markets. Consequently, these limitations have resulted in limited security and reliability with increasing out-of-market payments, particularly as uncertainty associated with renewables and distributed energy resources grows.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A master equation and moment approach for biochemical systems with creation-time-dependent bimolecular rate functions

Noise and stochasticity are fundamental to biology and derive from the very nature of biochemical reactions where thermal motion of molecules translates into randomness in the sequence and timing of reactions. This randomness leads to cell-to-cell variability even in clonal populations. Stochastic biochemical networks have been traditionally modeled as continuous-time discrete-state Markov processes whose probability density functions evolve according to a chemical master equation (CME). In diffusion reaction systems on membranes, the Markov formalism, which assumes constant reaction propensities is not directly appropriate. This is because the instantaneous propensity for a diffusion reaction to occur depends on the creation times of the molecules involved. In this work, we develop a chemical master equation for systems of this type. While this new CME is computationally intractable, we make rational dimensional reductions to form an approximate equation, whose moments are also derived and are shown to yield efficient, accurate results. This new framework forms a more general approach than the Markov CME and expands upon the realm of possible stochastic biochemical systems that can be efficiently modeled.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Investigation of electron-atom/molecule scattering resonances: Two complex multiconfigurational self-consistent field approaches

Resonances are temporarily bound states which lie in the continuum part of the Hamiltonian. If the electronic coordinates of the Hamiltonian are scaled (“dilated”) by a complex parameter, η = αe{sup iθ} (α, θ real), then its complex eigenvalues represent the scattering states (resonant and non-resonant) while the eigenvalues corresponding to the bound states and the ionization and the excitation thresholds remain real and unmodified. These make the study of these transient species amenable to the bound state methods. We developed a quadratically convergent multiconfigurational self-consistent field method (MCSCF), a well-established bound-state technique, combined with a dilated Hamiltonian to investigate resonances. This is made possible by the adoption of a second quantization algebra suitable for a set of “complex conjugate biorthonormal” spin orbitals and a modified step-length constraining algorithm to control the walk on the complex energy hypersurface while searching for the stationary point using a multidimensional Newton-Raphson scheme. We present our computational results for the {sup 2}PBe{sup −} shape resonances using two different computationally efficient methods that utilize complex scaled MCSCF (i.e., CMCSCF). These two methods are to straightforwardly use CMCSCF energy differences and to obtain energy differences using an approximation to the complex multiconfigurational electron propagator. It is found that, differing from previous computational studies by others, there are actually two {sup 2}PBe{sup −} shape resonances very close in energy. In addition, N{sub 2} resonances are examined using one of these methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computational imaging using a mode-mixing cavity at microwave frequencies

We present a 3D computational imaging system based on a mode-mixing cavity at microwave frequencies. The core component of this system is an electrically large rectangular cavity with one corner re-shaped to catalyze mode mixing, often called a Sinai Billiard. The front side of the cavity is perforated with a grid of periodic apertures that sample the cavity modes and project them into the imaging scene. The radiated fields are scattered by the scene and are measured by low gain probe antennas. The complex radiation patterns generated by the cavity thus encode the scene information onto a set of frequency modes. Assuming the first Born approximation for scattering dynamics, the received signal is processed using computational methods to reconstruct a 3D image of the scene with resolution determined by the diffraction limit. The proposed mode-mixing cavity is simple to fabricate, exhibits low losses, and can generate highly diverse measurement modes. The imaging system demonstrated in this letter can find application in security screening and medical diagnostic imaging.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nonadiabatic Quantum Molecular Dynamics in Dense Manifolds of Electronic States

Most nonadiabatic molecular dynamics methods require the determination of a basis of adiabatic or diabatic electronic states at every time step, but in dense manifolds of electronic states, such approaches become intractable. A notable exception is Ehrenfest molecular dynamics, which can be implemented without explicit determination of such a basis but suffers from unphysical behavior when propagation on a mean-field potential energy surface (PES) does not accurately reflect the true dynamics on multiple electronic states. Here we introduce the multiple cloning for dense manifolds of states (MCDMS) method, a systematically improvable approximation to the multiple cloning method. MCDMS avoids both the mean-field PES problem and the need to compute the full electronic spectrum. This is achieved by reformulating multiple cloning to use a subspace of approximate eigenstates constructed from the time-dependent Ehrenfest electronic wave function. Finally, by application to model systems, we show that this approach allows a substantial reduction in the size of the required electronic basis without significant loss in accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Umbrella sampling: a powerful method to sample tails of distributions

We present the umbrella sampling (US) technique and show that it can be used to sample extremely low-probability areas of the posterior distribution that may be required in statistical analyses of data. In this approach sampling of the target likelihood is split into sampling of multiple biased likelihoods confined within individual umbrella windows. We show that the US algorithm is efficient and highly parallel and that it can be easily used with other existing Markov Chain Monte Carlo (MCMC) samplers. The method allows the user to capitalize on their intuition and define umbrella windows and increase sampling accuracy along specific directions in the parameter space. Alternatively, one can define umbrella windows using an approach similar to parallel tempering. We provide a public code that implements US as a standalone PYTHON package. We present a number of tests illustrating the power of the US method in sampling low-probability areas of the posterior and show that this ability allows a considerably more robust sampling of multimodal distributions compared to standard sampling methods. We also present an application of the method in a real world example of deriving cosmological constraints using the supernova type Ia data. We show that US can sample the posterior accurately down to the approximate to 15 sigma credible region in the Omega(m) - Omega(Lambda) plane, while for the same computational effort the affine-invariant MCMC sampling implemented in the emcee code samples the posterior reliably only to approximate to 3 sigma.

cosmology: cosmological parameters↗