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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

ASSESSING MAGNETIC TORQUES AND ENERGY FLUXES IN CLOSE-IN STAR–PLANET SYSTEMS

Planets in close-in orbit interact with the magnetized wind of their hosting star. This magnetic interaction was proposed to be a source for enhanced emissions in the chromosphere of the star, and to participate in setting the migration timescale of the close-in planet. The efficiency of the magnetic interaction is known to depend on the magnetic properties of the host star and of the planet, and on the magnetic topology of the interaction. We use a global, three-dimensional numerical model of close-in star–planet systems, based on the magnetohydrodynamics approximation, to compute a grid of simulations for varying properties of the orbiting planet. We propose a simple parametrization of the magnetic torque that applies to the planet, and of the energy flux generated by the interaction. The dependency upon the planet properties and the wind properties is clearly identified in the derived scaling laws, which can be used in secular evolution codes to take into account the effect of magnetic interactions in planet migration. They can also be used to estimate a potential magnetic source of enhanced emissions in observed close-in star–planet systems, in order to constrain observationally possible exoplanetary magnetic fields.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

Canards in a minimal piecewise-linear square-wave burster

We construct a piecewise-linear (PWL) approximation of the Hindmarsh-Rose (HR) neuron model that is minimal, in the sense that the vector field has the least number of linearity zones, in order to reproduce all the dynamics present in the original HR model with classical parameter values. This includes square-wave bursting and also special trajectories called canards, which possess long repelling segments and organise the transitions between stable bursting patterns with n and n + 1 spikes, also referred to as spike-adding canard explosions. We propose a first approximation of the smooth HR model, using a continuous PWL system, and show that its fast subsystem cannot possess a homoclinic bifurcation, which is necessary to obtain proper square-wave bursting. We then relax the assumption of continuity of the vector field across all zones, and we show that we can obtain a homoclinic bifurcation in the fast subsystem. We use the recently developed canard theory for PWL systems in order to reproduce the spike-adding canard explosion feature of the HR model as studied, e.g., in Desroches et al., Chaos 23(4), 046106 (2013).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2013

An improved resonance self-shielding method for heterogeneous fast reactor assembly and core calculations

An improved resonance self-shielding method has been developed to accurately estimate the effective multigroup cross sections for heterogeneous fast reactor assembly and core calculations. In the method, the heterogeneity effect is considered by the use of isotopic escape cross sections while the resonance interference effect is accounted for through the narrow resonance approximation or slowing-down calculations for specific compositions. The isotopic escape cross sections are calculated by solving fixed-source transport equations with the method of characteristics for the whole problem domain. This method requires no pre-calculated resonance integral tables or parameters that are typically necessary in the subgroup method. Preliminary results for multi pin-cell fast reactor problems show that the escape cross sections estimated from the explicit-geometry fixed source calculations produce more accurate eigenvalue and self-shielded effective cross sections than those from conventional one-dimensional geometry models. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2018

Two-Sided Semi-Local Smoothing Splines

A semi-local smoothing spline of degree n and class C{sup p} is a function defined on an interval, having p continuous derivatives on that interval, and coinciding with a polynomial of degree n on the subintervals forming its partition. The domain of each polynomial is a subinterval on which m + 1 values of the approximated function are given, but in order to construct the polynomial, it is necessary to know M ≥ m + 1 values (m and M are determined by the class and the degree of the spline). The additional values can be borrowed from the adjacent subintervals. When constructing an S-spline in the periodic case, the problem of additional values is solved on the basis of periodicity, but in the nonperiodic case, one is expected to define the lacking values of a function beyond the domain. The present paper is aimed at nonperiodic two-sided S-splines whose construction does not require additional data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

On the convergence and convergence order of finite volume gradient schemes for oblique derivative boundary value problems

This work is an improvement of the previous note (Bradji in: Fuhrmann et al., Finite volumes for complex applications VII–methods, theoretical aspects. Proceedings of the FVCA 7, Berlin, 2014) which dealt with the convergence analysis of a finite volume scheme for the Poisson’s equation with a linear oblique derivative boundary condition. The formulation of the finite volume scheme given in Bradji (in: Fuhrmann et al., Finite volumes for complex applications VII–methods, theoretical aspects. Proceedings of the FVCA 7, Berlin, 2014) involves the discrete gradient introduced recently in Eymard et al. (IMA J Numer Anal 30(4):1009–1043, 2010). In this paper, we consider the convergence analysis of finite volume schemes involving the discrete gradient of Eymard et al. (IMA J Numer Anal 30(4):1009–1043, 2010) for elliptic and parabolic equations with linear oblique derivative boundary conditions. Linear oblique derivative boundary conditions arise for instance in the study of the motion of water in a canal, cf. Lesnic (Commun Numer Methods Eng 23(12):1071–1080, 2007). We derive error estimates in several norms which allow us to get error estimates for the approximations of the exact solutions and its first derivatives. In particular, we provide an error estimate between the gradient of the exact solutions and the discrete gradient of the approximate solutions. Convergence of the family of finite volume approximate solutions towards the exact solution under weak regularity assumption is also investigated. In the case of parabolic equations with oblique derivative boundary conditions, we develop a new discrete a priori estimate result. The proof of this result is based on the use of a discrete mean Poincaré–Wirtinger inequality. Thanks to the stated a priori estimate and to a comparison with an appropriately chosen auxiliary finite volume scheme, we derive the convergence results. This work can be viewed as a continuation of the previous work (Bradji and Gallouët in Int J Finite Vol 3(2):1–35, 2006) where a convergence analysis for a finite volume scheme, based on the admissible mesh of Eymard et al. (In: Ciarlet and Lions, Handbook of numerical analysis, North-Holland, Amsterdam, 2000), for the Poisson’s equation with a linear oblique derivative boundary conditions is given. The obtained convergence results do not require any relation between the mesh sizes of the spatial and time discretizations. Some numerical tests are presented for both elliptic and parabolic equations. In particular, we present three methods to compute the discrete solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Generalized trigonometric Fourier-series method with automatic time step control for non-linear point kinetics equations

The trigonometric Fourier-series method (TFS) is generalized to provide approximate solutions for non-linear point kinetics equations with feedback using varying step sizes. This method can provide a very stable solution against the size of the discrete time step allowing much larger step sizes to be used. Systems of the point kinetics equations are solved using Fourier-series expansion over a partition of the total time interval. The approximate solution requires determining the series coefficients over each time step in that partition. These coefficients are determined using the high-order derivatives of the solution vector at the beginning of the time step introducing a system of linear algebraic equations to be solved at each step. This system is similar to the Vandermonde system. Two successive orders of the partial sums are used to estimate the local truncation error. This error and some other constrains are used to produce the largest step size allowable at each step while keeping the error within a specific tolerance. The process of calculating suitable step sizes should be automatic and inexpensive. Convergence and stability of the proposed method are discussed and a new formula is introduced to maintain stability. The proposed method solves the general linear and non-linear kinetics problems. The method has been applied to five different types of reactivities including step/ramp insertions with temperature feedback. The method is seemed to be valid for larger time intervals than those used in the conventional numerical integration, and is thus useful in reducing computing time. Computational results are found to be consistent with the analysis, they demonstrate that the convergence of the iteration scheme can be accelerated and the resulting computing times can be greatly reduced while maintain computational accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Counting generations in birth and death processes with competing Erlang and exponential waiting times

Lymphocyte populations, stimulated in vitro or in vivo, grow as cells divide. Stochastic models are appropriate because some cells undergo multiple rounds of division, some die, and others of the same type in the same conditions do not divide at all. If individual cells behave independently, then each cell can be imagined as sampling from a probability density of times to division and death. The exponential density is the most mathematically and computationally convenient choice. It has the advantage of satisfying the memoryless property, consistent with a Markov process, but it overestimates the probability of short division times. With the aim of preserving the advantages of a Markovian framework while improving the representation of experimentally-observed division times, we consider a multi-stage model of cellular division and death. We use Erlang-distributed (or, more generally, phase-type distributed) times to division, and exponentially distributed times to death. We classify cells into generations, using the rule that the daughters of cells in generation n are in generation n + 1. In some circumstances, our representation is equivalent to established models of lymphocyte dynamics. We find the growth rate of the cell population by calculating the proportions of cells by stage and generation. The exponent describing the late-time cell population growth, and the criterion for extinction of the population, differs from what would be expected if N steps with rate λ were equivalent to a single step of rate λ/N. We link with a published experimental dataset, where cell counts were reported after T cells were transferred to lymphopenic mice, using Approximate Bayesian Computation. In the comparison, the death rate is assumed to be proportional to the generation and the Erlang time to division for generation 0 is allowed to differ from that of subsequent generations. The multi-stage representation is preferred to a simple exponential in posterior distributions, and the mean time to first division is estimated to be longer than the mean time to subsequent divisions.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2013

Reservoir Modeling by Data Integration via Intermediate Spaces and Artificial Intelligence Tools in MPS Simulation Frameworks

Conditioning stochastic simulations are very important in many geostatistical applications that call for the introduction of nonlinear and multiple-point data in reservoir modeling. Here, a new methodology is proposed for the incorporation of different data types into multiple-point statistics (MPS) simulation frameworks. Unlike the previous techniques that call for an approximate forward model (filter) for integration of secondary data into geologically constructed models, the proposed approach develops an intermediate space where all the primary and secondary data are easily mapped onto. Definition of the intermediate space, as may be achieved via application of artificial intelligence tools like neural networks and fuzzy inference systems, eliminates the need for using filters as in previous techniques. The applicability of the proposed approach in conditioning MPS simulations to static and geologic data is verified by modeling a real example of discrete fracture networks using conventional well-log data. The training patterns are well reproduced in the realizations, while the model is also consistent with the map of secondary data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Distinguishability and chiral stability in solution: Effects of decoherence and intermolecular interactions

We examine the effect of decoherence and intermolecular interactions (chiral discrimination energies) on the chiral stability and the distinguishability of initially pure versus mixed states in an open chiral system. Under a two-level approximation for a system, intermolecular interactions are introduced by a mean-field theory, and interaction between a system and an environment is modeled by a continuous measurement of a population difference between the two chiral states. The resultant equations are explored for various parameters, with emphasis on the combined effects of the initial condition of the system, the chiral discrimination energies, and the decoherence in determining: the distinguishability as measured by a population difference between the initially pure and mixed states, and the decoherence process; the chiral stability as measured by the purity decay; and the stationary state of the system at times long relative to the time scales of the system dynamics and of the environmental effects.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Scattering Amplitudes in a Neighborhood of Limit Rays in Short-Wave Diffraction by Elongated Bodies of Revolution

In the paper, diffraction problems of a plane wave by smooth, convex, and elongated bodies of revolution are considered within the framework of short-wave approximation (axially symmetric cases). The scattering amplitudes are calculated in the direction of limit rays, and the influence of the elongation of the scatterers on the amplitudes behavior is investigated. Mathematical techniques of our approach are based on the Green’s formulas in the exterior of the scatterers and numerical calculations of the wave field current in the boundary layers in the vicinity of the light-shadow zone. It is established that the elongation of axially symmetric bodies relatively weakly affects the scattering amplitudes of the short-wave asymptotics. The main contribution to the amplitudes is made by the solution of the 2D diffraction problem by a convex, smooth curve in the cross section of the scatterers by a plane containing the rotation axis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Regularizing the linearly extrapolated BDF2 scheme for incompressible flows with time relaxation

This paper presents a highly-efficient finite element scheme for the time relaxation model (TRM). The efficiency is achieved through the second-order BDF2 time-stepping scheme with linear extrapolation (BDF2LE). The accuracy of the scheme is also greatly enhanced through the use of the divergence-free Scott-Vogeulis finite elements, and van Cittert approximate deconvolution. A complete finite element analysis is provided, which includes rigorous proofs for the stability, well-possessedness, and convergence of both velocity and pressure solutions. Furthermore, we also demonstrate that the inclusion of the linear time relaxation term preserves the long-time stability of the unregularized BDF2LE scheme. Finally, numerical experiments are presented that demonstrate the added stability and accuracy that time relaxation can provide.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Theoretical and experimental study of the rule for heat transfer coefficient in hot stamping of high strength steels

Heat transfer is a crucial aspect for hot stamping process, the fully austenitized boron steel blank with temperature about 900°C is transferred to the tool, then formed rapidly and quenched in the cooled tool. The desired fully martensitic transformation will happen only if the cooling rate exceeds a critical value approximately 27 K/s. During such process, the heat transfer coefficient (abbreviated as HTC) between the tool and blank plays a decisive role for the variation of the blank temperature. In this work, a theoretical formula based on the joint-roughness model is presented to describe the law of HTC, which relies on the roughness, hardness, and other material parameters of the tool and blank. Moreover, a non-contact temperature measuring system based on the infrared thermal camera is built to catch the temperature change course, and then the HTC value is derived through the inverse analysis. Based on the theoretical and experimental results, the change rule of HTC especially its dependence on the process pressure will be discussed in detail.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Communication: Spin densities within a unitary group based spin-adapted open-shell coupled-cluster theory: Analytic evaluation of isotropic hyperfine-coupling constants for the combinatoric open-shell coupled-cluster scheme

We report analytical calculations of isotropic hyperfine-coupling constants in radicals using a spin-adapted open-shell coupled-cluster theory, namely, the unitary group based combinatoric open-shell coupled-cluster (COSCC) approach within the singles and doubles approximation. A scheme for the evaluation of the one-particle spin-density matrix required in these calculations is outlined within the spin-free formulation of the COSCC approach. In this scheme, the one-particle spin-density matrix for an open-shell state with spin S and M{sub S} = + S is expressed in terms of the one- and two-particle spin-free (charge) density matrices obtained from the Lagrangian formulation that is used for calculating the analytic first derivatives of the energy. Benchmark calculations are presented for NO, NCO, CH{sub 2}CN, and two conjugated π-radicals, viz., allyl and 1-pyrrolyl in order to demonstrate the performance of the proposed scheme.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2013

Monte Carlo study of electron-beam penetration and backscattering in multi-walled carbon nanotube materials: The effect of different scattering models

A systematic study of electron-beam penetration and backscattering in multi-walled carbon nanotube (MWCNT) materials for beam energies of {approx}0.3 to 30 keV is presented based on event-by-event Monte Carlo simulation of electron trajectories using state-of-the-art scattering cross sections. The importance of different analytic approximations for computing the elastic and inelastic electron-scattering cross sections for MWCNTs is emphasized. We offer a simple parameterization for the total and differential elastic-scattering Mott cross section, using appropriate modifications to the Browning formula and the Thomas-Fermi screening parameter. A discrete-energy-loss approach to inelastic scattering based on dielectric theory is adopted using different descriptions of the differential cross section. The sensitivity of electron penetration and backscattering parameters to the underlying scattering models is examined. Our simulations confirm the recent experimental backscattering data on MWCNT forests and, in particular, the steep increase of the backscattering yield at sub-keV energies as well as the sidewalls escape effect at high-beam energies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2015

Approximating electronically excited states with equation-of-motion linear coupled-cluster theory

A new perturbative approach to canonical equation-of-motion coupled-cluster theory is presented using coupled-cluster perturbation theory. A second-order Møller-Plesset partitioning of the Hamiltonian is used to obtain the well known equation-of-motion many-body perturbation theory equations and two new equation-of-motion methods based on the linear coupled-cluster doubles and linear coupled-cluster singles and doubles wavefunctions. These new methods are benchmarked against very accurate theoretical and experimental spectra from 25 small organic molecules. It is found that the proposed methods have excellent agreement with canonical equation-of-motion coupled-cluster singles and doubles state for state orderings and relative excited state energies as well as acceptable quantitative agreement for absolute excitation energies compared with the best estimate theory and experimental spectra.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Fast Fourier Transform for multivariate aggregate claims

The Fast Fourier Transform provides an alternative approximate method to evaluate the distribution of aggregate losses in insurance and finance. The efficiency of this method has already been proved for univariate and bivariate insurance models; therefore, in this paper, we extend it to a multivariate setting by considering its application to a particular model that includes losses of different types and dependency between them. Since the Fourier transform method works with truncated claims distributions, it can generate aliasing errors by wrapping around the probability mass that lies at the truncation point below this point. To eliminate this problem, we also discuss a suitable change of measure called exponential tilting that forces the tail of the distribution to decrease at exponential rate. Other possible errors are also discussed. We also illustrate the method on several numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Generalization of the Cauchy–Poisson Method and the Construction of Timoshenko-Type Equations

We consider a generalization of the Cauchy–Poisson method to the n-dimensional Euclidean space and its application to the construction of hyperbolic approximations. The presented investigation generalizes and supplements the results obtained earlier. In the Euclidean space, we introduce certain restrictions for the derivatives. The principle of hyperbolic degeneracy in terms of parameters is formulated and its realization in the form of necessary and sufficient conditions is presented. In a special case of fourdimensional space (in which the operators are preserved up to the sixth order), we obtain a generalized hyperbolic equation for the bending vibrations of plates with coefficients that depend only on the Poisson ratio. This equation includes, as special cases, the well-known Bernoulli–Euler, Kirchhoff, Rayleigh, and Timoshenko equations. As the development of Maxwell's and Einstein's investigations of the propagation of perturbations with finite velocity in continuous media, we can mention the nontrivial construction of Timoshenko’s equation for the bending vibrations of a beam.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Final Report: Sampling-Based Algorithms for Estimating Structure in Big Data.

The purpose of this project was to develop sampling-based algorithms to discover hidden struc- ture in massive data sets. Inferring structure in large data sets is an increasingly common task in many critical national security applications. These data sets come from myriad sources, such as network traffic, sensor data, and data generated by large-scale simulations. They are often so large that traditional data mining techniques are time consuming or even infeasible. To address this problem, we focus on a class of algorithms that do not compute an exact answer, but instead use sampling to compute an approximate answer using fewer resources. The particular class of algorithms that we focus on are streaming algorithms , so called because they are designed to handle high-throughput streams of data. Streaming algorithms have only a small amount of working storage - much less than the size of the full data stream - so they must necessarily use sampling to approximate the correct answer. We present two results: * A streaming algorithm called HyperHeadTail , that estimates the degree distribution of a graph (i.e., the distribution of the number of connections for each node in a network). The degree distribution is a fundamental graph property, but prior work on estimating the degree distribution in a streaming setting was impractical for many real-world application. We improve upon prior work by developing an algorithm that can handle streams with repeated edges, and graph structures that evolve over time. * An algorithm for the task of maintaining a weighted subsample of items in a stream, when the items must be sampled according to their weight, and the weights are dynamically changing. To our knowledge, this is the first such algorithm designed for dynamically evolving weights. We expect it may be useful as a building block for other streaming algorithms on dynamic data sets.

97 MATHEMATICS AND COMPUTING↗