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 181 records · Page 10

Data-driven wind turbine wake modeling via probabilistic machine learning

Wind farm design primarily depends on the variability of the wind turbine wake flows to the atmospheric wind conditions and the interaction between wakes. Physics-based models that capture the wake flow field with high-fidelity are computationally very expensive to perform layout optimization of wind farms, and, thus, data-driven reduced-order models can represent an efficient alternative for simulating wind farms. In this work, we use real-world light detection and ranging (LiDAR) measurements of wind-turbine wakes to construct predictive surrogate models using machine learning. Specifically, we first demonstrate the use of deep autoencoders to find a low-dimensional latent space that gives a computationally tractable approximation of the wake LiDAR measurements. Then, we learn the mapping between the parameter space and the (latent space) wake flow fields using a deep neural network. Additionally, we also demonstrate the use of a probabilistic machine learning technique, namely, Gaussian process modeling, to learn the parameter-space-latent-space mapping in addition to the epistemic and aleatoric uncertainty in the data. Finally, to cope with training large datasets, we demonstrate the use of variational Gaussian process models that provide a tractable alternative to the conventional Gaussian process models for large datasets. Furthermore, we introduce the use of active learning to adaptively build and improve a conventional Gaussian process model predictive capability. Overall, we find that our approach provides accurate approximations of the wind-turbine wake flow field that can be queried at an orders-of-magnitude cheaper cost than those generated with high-fidelity physics-based simulations.

Deep neural networks↗

Angular momentum role in the hypercritical accretion of binary-driven hypernovae

The induced gravitational collapse paradigm explains a class of energetic, E{sub iso}≳10{sup 52} erg, long-duration gamma-ray bursts (GRBs) associated with Ic supernovae, recently named binary-driven hypernovae. The progenitor is a tight binary system formed of a carbon–oxygen (CO) core and a neutron star (NS) companion. The supernova ejecta of the exploding CO core trigger a hypercritical accretion process onto the NS, which reaches the critical mass in a few seconds, and gravitationally collapses to a black hole, emitting a GRB. In our previous simulations of this process, we adopted a spherically symmetric approximation to compute the features of the hypercritical accretion process. We here present the first estimates of the angular momentum transported by the supernova ejecta, L{sub acc}, and perform numerical simulations of the angular momentum transfer to the NS during the hyperaccretion process in full general relativity. We show that the NS (1) reaches either the mass-shedding limit or the secular axisymmetric instability in a few seconds depending on its initial mass, (2) reaches a maximum dimensionless angular momentum value, [cJ/(GM{sup 2})]{sub max}≈0.7, and (3) can support less angular momentum than the one transported by supernova ejecta, L{sub acc}>J{sub NS,max}, hence there is an angular momentum excess that necessarily leads to jetted emission.

79 ASTRONOMY AND ASTROPHYSICS↗

Online multimedia retrieval on CPU–GPU platforms with adaptive work partition

Nearest neighbors search is a core operation found in several online multimedia services. These services have to handle very large databases, while, at the same time, they must minimize the query response times observed by users. This is specially complex because those services deal with fluctuating query workloads (rates). Consequently, they must adapt at run-time to minimize the response times as the load varies. In this paper, we address the aforementioned challenges with a distributed memory parallelization of the product quantization nearest neighbor search, also known as IVFADC, for hybrid CPU–GPU machines. Overall, our parallel IVFADC implements an out-of-GPU memory execution scheme to use the GPU for databases in which the index does not fit in its memory, which is crucial for searching in very large databases. The careful use of CPU and GPU with work stealing led to an average response time reduction of 2.4 as compared to using the GPU only. Also, our approach to adapt the system to fluctuating loads, called Dynamic Query Processing Policy (DQPP), attained a response time reduction of up to 5 vs. the best static (BS) policy for moderate loads. The system has attained high query processing rates and near-linear scalability in all experiments. We have evaluated our system on a machine with up to 256 NVIDIA V100 GPUs processing a database of 256 billion SIFT features vectors.

97 MATHEMATICS AND COMPUTING↗

Logarithmic divergences in the k-inflationary power spectra computed through the uniform approximation

We investigate a calculation method for solving the Mukhanov-Sasaki equation in slow-roll k-inflation based on the uniform approximation (UA) in conjunction with an expansion scheme for slow-roll parameters with respect to the number of e-folds about the so-called turning point. Earlier works on this method have so far gained some promising results derived from the approximating expressions for the power spectra among others, up to second order with respect to the Hubble and sound flow parameters, when compared to other semi-analytical approaches (e.g., Green's function and WKB methods). However, a closer inspection is suggestive that there is a problem when higher-order parts of the power spectra are considered; residual logarithmic divergences may come out that can render the prediction physically inconsistent. Looking at this possibility, we map out up to what order with respect to the mentioned parameters several physical quantities can be calculated before hitting a logarithmically divergent result. It turns out that the power spectra are limited up to second order, the tensor-to-scalar ratio up to third order, and the spectral indices and running converge to all orders. This indicates that the expansion scheme is incompatible with the working equations derived from UA for the power spectra but compatible with that of the spectral indices. For those quantities that involve logarithmically divergent terms in the higher-order parts, existing results in the literature for the convergent lower-order parts calculated in the equivalent fashion should be viewed with some caution; they do not rest on solid mathematical ground.

79 ASTRONOMY AND ASTROPHYSICS↗

A Hybrid Method for Tensor Decompositions that Leverages Stochastic and Deterministic Optimization

In this paper, we propose a hybrid method that uses stochastic and deterministic search to compute the maximum likelihood estimator of a low-rank count tensor with Poisson loss via state-of-theart local methods. Our approach is inspired by Simulated Annealing for global optimization and allows for fine-grain parameter tuning as well as adaptive updates to algorithm parameters. We present numerical results that indicate our hybrid approach can compute better approximations to the maximum likelihood estimator with less computation than the state-of-the-art methods by themselves.

97 MATHEMATICS AND COMPUTING↗

Estimation of unknown variable parameters in moving boundary problems

The problem of estimating unknown variable parameters appearing in moving boundary problems is considered; these are specifically nonlinear diffusion equations defined on a moving spatial domain. A spline-based approximation method that results in a sequence of computationally tractable approximate parameter estimation problems has been developed. A convergence result is proved for a certain class of these moving boundary problems. The paper is concluded with a set of representative numerical examples.

Murphy, K. A.↗

Approximating the Generalized Voronoi Diagram of Closely Spaced Objects

We present an algorithm to compute an approximation of the generalized Voronoi diagram (GVD) on arbitrary collections of 2D or 3D geometric objects. In particular, we focus on datasets with closely spaced objects; GVD approximation is expensive and sometimes intractable on these datasets using previous algorithms. With our approach, the GVD can be computed using commodity hardware even on datasets with many, extremely tightly packed objects. Our approach is to subdivide the space with an octree that is represented with an adjacency structure. We then use a novel adaptive distance transform to compute the distance function on octree vertices. The computed distance field is sampled more densely in areas of close object spacing, enabling robust and parallelizable GVD surface generation. We demonstrate our method on a variety of data and show example applications of the GVD in 2D and 3D.

97 MATHEMATICS AND COMPUTING↗

An accurate method for evaluating the kernel of the integral equation relating lift to downwash in unsteady potential flow

The method is capable of generating approximations of arbitrary accuracy. It is based on approximating the algebraic part of the nonelementary integrals in the kernel by exponential functions and then integrating termwise. The exponent spacing in the approximation is a geometric sequence. The coefficients and exponent multiplier of the exponential approximation are computed by least squares so the method is completely automated. Exponential approximates generated in this manner are two orders of magnitude more accurate than the exponential approximation that is currently most often used for this purpose. The method can be used to generate approximations to attain any desired trade-off between accuracy and computing cost.

Desmarais, R. N.↗

An accurate and efficient method for evaluating the kernel of the integral equation relating pressure to normalwash in unsteady potential flow

This paper describes an accurate economical method for generating approximations to the kernel of the integral equation relating unsteady pressure to normalwash in nonplanar flow. The method is capable of generating approximations of arbitrary accuracy. It is based on approximating the algebraic part of the non elementary integrals in the kernel by exponential approximations and then integrating termwise. The exponent spacing in the approximation is a geometric sequence. The coefficients and exponent multiplier of the exponential approximation are computed by least squares so the method is completely automated. Exponential approximates generated in this manner are two orders of magnitude more accurate than the exponential approximation that is currently most often used for this purpose. Coefficients for 8, 12, 24, and 72 term approximations are tabulated in the report. Also, since the method is automated, it can be used to generate approximations to attain any desired trade-off between accuracy and computing cost.

Desmarais, R. N.↗

Theoretical Prediction of Structural, Electronic, and Magnetic Properties of Rh{sub 2}YIn (Y = Nd, Sm) Full-Heusler Alloys

We have studied the structural, electronic, and magnetic properties of Rh{sub 2}YIn (Y = Nd, Sm) alloys based on rare earth elements, using the full-potential linearized augmented plane-wave method (FP-LAPW) implemented in the Wien2K computer code with the parameterization of the generalized gradient approximation (GGA) and the local density approximation (LDA). Our results reveal a metallic behavior for rare earth-based full-Heusler Rh{sub 2}YIn (Y = Nd, Sm) alloys. Indeed, the structure of the state density illustrates a polarization for the up orientation (metal character) and a pseudo gap at the down orientation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Numerical analysis of a thermal contact problem with adhesion

In this paper, we study a class of dynamic thermal problems involving a frictional normal compliance adhesive contact model and a non-clamped condition for visco-elastic materials. The variational formulation of the problem leads to a general system defined by a second-order quasi-variational evolution inequality on the displacement field coupled with the two first-order evolution equations describing the evolution of the temperature and adhesion. We establish an existence and uniqueness result of the solution on displacement, temperature and adhesion. Then we provide a fully discrete numerical scheme of approximation and derive an error estimate. Finally, various numerical computations are included.

97 MATHEMATICS AND COMPUTING↗

New fractional derivatives applied to the Korteweg–de Vries and Korteweg–de Vries–Burger’s equations

In this paper, we extend the model of the Korteweg–de Vries (KDV) and Korteweg–de Vries–Burger’s (KDVB) to new model time fractional Korteweg–de Vries (TFKDV) and time fractional Korteweg–de Vries-Burger’s (TFKDVB) with Liouville–Caputo (LC), Caputo–Fabrizio (CF), and Atangana-Baleanu (AB) fractional time derivative equations, respectively. We utilize the q-homotopy analysis transform method (q-HATM) to compute the approximate solutions of TFKDV and TFKDVB using LC, CF and AB in Liouville–Caputo sense. We study the convergence analysis of q-HATM by computing the Residual Error Function (REF) and finding the interval of the convergence through the h-curves. Also, we find the optimal values of h so that, we assure the convergence of the approximate solutions. The results are very effective and accurate in solving the TFKDV and TFKDVB.

97 MATHEMATICS AND COMPUTING↗

Random insights into the complexity of two-dimensional tensor network calculations

Projected entangled pair states (PEPS) offer memory-efficient representations of some quantum many-body states that obey an entanglement area law and are the basis for classical simulations of ground states in two-dimensional (2d) condensed matter systems. However, rigorous results show that exactly computing observables from a 2d PEPS state is generically a computationally hard problem. Yet approximation schemes for computing properties of 2d PEPS are regularly used, and empirically seen to succeed, for a large subclass of (“not too entangled”) condensed matter ground states. Adopting the philosophy of random matrix theory, in this work, we analyze the complexity of approximately contracting a 2d random PEPS by exploiting an analytic mapping to an effective replicated statistical mechanics model that permits a controlled analysis at a large bond dimension. Through this statistical-mechanics lens, we argue that (i) although approximately sampling wave-function amplitudes of random PEPS faces a computational-complexity phase transition above a critical bond dimension, and (ii) one can generically efficiently estimate the norm and correlation functions for any finite bond dimension. Furthermore, these results are supported numerically for various bond-dimension regimes. It is an important open question whether the above results for random PEPS apply more generally also to PEPS representing physically relevant ground states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗