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 793 records · Page 44

Computational test of the infinite order sudden approximation for excitation of linear rigid rotors by collisions with atoms

The infinite order sudden approximation for excitation of linear rigid rotors by collisions with atom is tested by comparing integral state-to-state cross sections with accurate close coupling and coupled states results. The systems studied are HCl-Ar, HCl-He, CO-He, HCN-He, CS-H2 and OCS-H2. With the exception of diatomic hydrides (e.g., HCl) which have atypically large rotational constants the method is found to be very accurate to remarkably low collision energies. This approximation should generally be extremely useful for thermal energy collisions.

Green, S.↗

MULTILEVEL ACCELERATION OF STOCHASTIC COLLOCATION METHODS FOR PDE WITH RANDOM INPUT DATA

Stochastic Collocation (SC) methods for stochastic partial differential equa- tions (SPDEs) suffer from the curse of dimensionality, whereby increases in the stochastic dimension cause an explosion of computational effort. To combat these challenges, multilevel approximation methods seek to decrease computational complexity by balancing spatial and stochastic discretization errors. As a form of variance reduction, multilevel techniques have been successfully applied to Monte Carlo (MC) methods, but may be extended to accelerate other methods for SPDEs in which the stochastic and spatial degrees of freedom are de- coupled. This article presents general convergence and computational complexity analysis of a multilevel method for SPDEs, demonstrating its advantages with regard to standard, single level approximation. The numerical results will highlight conditions under which multilevel sparse grid SC is preferable to the more traditional MC and SC approaches.

Webster, Clayton G↗

Plasma Physics Approximations in Ares

Lee & More derived analytic forms for the transport properties of a plasma. Many hydro-codes use their formulae for electrical and thermal conductivity. The coefficients are complex functions of Fermi-Dirac integrals, F n ( μ/θ ), the chemical potential, μ or ζ = ln(1+e μ/θ ), and the temperature, θ = kT. Since these formulae are expensive to compute, rational function approximations were fit to them. Approximations are also used to find the chemical potential, either μ or ζ . The fits use ζ as the independent variable instead of μ/θ . New fits are provided for A α (ζ ),A β (ζ ), ζ, f(ζ ) = (1 + e -μ/θ )F 1/2 (μ/θ), F 1/2 '/F 1/2 , F c α , and F c β . In each case the relative error of the fit is minimized since the functions can vary by many orders of magnitude. The new fits are designed to exactly preserve the limiting values in the non-degenerate and highly degenerate limits or as ζ→ 0 or ∞. The original fits due to Lee & More and George Zimmerman are presented for comparison.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

ACCELERATING HIGH-ENERGY PULSAR RADIATION CODES

Curvature radiation (CR) is believed to be a dominant mechanism for creating gamma-ray emission from pulsars and is emitted by relativistic particles that are constrained to move along curved magnetic field lines. Additionally, synchrotron radiation (SR) is expected to be radiated by both relativistic primaries (involving cyclotron resonant absorption of radio photons and re-emission of SR photons), or secondary electron-positron pairs (created by magnetic or photon-photon pair production processes involving CR gamma rays in the pulsar magnetosphere). When calculating these high-energy spectra, especially in the context of pulsar population studies where several millions of CR and SR spectra have to be generated, it is profitable to consider approximations that would save computational time without sacrificing too much accuracy. This paper focuses on one such approximation technique, and we show that one may gain significantly in computational speed while preserving the accuracy of the spectral results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Small-angle scattering of particle assemblies

Small-angle scattering formulae for crystalline assemblies of arbitrary particles are derived from powder diffraction theory using the decoupling approximation. To do so, the pseudo-lattice factor is defined, and methods to overcome the limitations of the decoupling approximation are investigated. Further, approximated equations are suggested for the diffuse scattering from various defects of the first kind due to non-ideal particles, including size polydispersity, orientational disorder and positional fluctuation about their ideal positions. Calculated curves using the formalism developed herein are compared with numerical simulations computed without any approximation. For a finite-sized assembly, the scattering from the whole domain of the assembly must also be included, and this is derived using the correlation function approach.

assembly↗

Approximate equations of state in two-temperature plasma mixtures

Approximate thermodynamic state relations for multicomponent atomic and molecular gas mixtures are often constructed by artificially partitioning the mixture into its constituent materials and requiring the separated materials to be in temperature and pressure equilibrium. Iterative numerical algorithms have been employed to enforce this equilibration and compute the resulting approximate state relations in single-temperature mixtures. In partially ionized gas mixtures, there is both theoretical and empirical evidence that equilibrating the chemical potentials, number densities, or partial pressures of the free electrons is likely to produce more accurate results than equilibrating the total pressures. Moreover, in many situations of practical interest the free electrons and heavy particles have different temperatures. In this paper, we present a generalized algorithm for equilibrating the heavy-particle and electron temperatures and a third user-specified independent thermodynamic variable in a two-temperature plasma mixture. Test calculations based on the equilibration of total pressure vs. electron pressure are presented for three different mixtures.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Precise calculations of observables of polarized moller scattering: From JLAB to ILC energies

One-loop electroweak corrections to observables of the reaction e{sup -}e{sup -} {yields} e{sup -}e{sup -}({gamma}) were calculated over a broad range of energies: from conditions of the MOLLER experiment at the Thomas Jefferson Laboratory (JLab) to those of planned experiments at the International Linear Collider (ILC). The dependence of various contributions to the observable polarization asymmetry on various renormalization conditions was studied within the scheme of on-shell renormalization. The results were obtained by two methods: precisely, by applying the FeynArts, FormCalc, LoopTools, and Form computer codes, and approximately, with the aid of the asymptotic-estimation methods. The resulting compact formulas are absolutely free from nonphysical parameters and are convenient for deducing numerical estimates. It is shown that the total one-loop correction is independent of renormalization conditions and takes an identical value within different computational schemes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Residuals Approach to Filtering, Smoothing and Identification for Static Distributed Systems

An approach for state estimation and identification of spatially distributed parameters embedded in static distributed (elliptic) system models is advanced. The method of maximum likelihood is used to find parameter values that maximize a likelihood functional for the system model, or equivalently, that minimize the negative logarithm of this functional. To find the minimum, a Newton-Raphson search is conducted that from an initial estimate generates a convergent sequence of parameter estimates. For simplicity, a Gauss-Markov approach is used to approximate the Hessian in terms of products of first derivatives. The gradient and approximate Hessian are computed by first arranging the negative log likelihood functional into a form based on the square root factorization of the predicted covariance of the measurement process. The resulting data processing approach, referred to here by the new term of predicted data covariance square root filtering, makes the gradient and approximate Hessian calculations very simple. A closely related set of state estimates is also produced by the maximum likelihood method: smoothed estimates that are optimal in a conditional mean sense and filtered estimates that emerge from the predicted data covariance square root filter.

Rodriguez, G.↗

Suzuki type estimates for exponentiated sums and generalized Lie-Trotter formulas in JB-algebras

Lie-Trotter-Suzuki product formulas are ubiquitous in quantum mechanics, computing, and simulations. Approximating exponentiated sums with such formulas are investigated in the JB-algebraic setting. We show that the Suzuki type approximation for exponentiated sums holds in JB-algebras, we give explicit estimation formulas, and we deduce three generalizations of Lie-Trotter formulas for arbitrary number elements in such algebras. In conclusion, we also extended the Lie-Trotter formulas in a Jordan Banach algebra from three elements to an arbitrary number of elements.

97 MATHEMATICS AND COMPUTING↗

Analytic saddlepoint approximation for ionization energy loss distributions

Here, we present a saddlepoint approximation for ionization energy loss distributions, valid for arbitrary relativistic velocities of the incident particle 0 < v/c < 1, provided that ionizing collisions are still the dominant energy loss mechanism. We derive a closed form solution closely related to Moyal’s distribution. This distribution is intended for use in simulations with relatively low computational overhead. The approximation generally reproduces the Vavilov most probable energy loss and full width at half maximum to better than 1% and 10%, respectively, with significantly better agreement as Vavilov’s κ approaches 1.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Dynamic Ride-Matching for Large-Scale Transportation Systems

Efficient dynamic ride-matching (DRM) in large-scale transportation systems is a key driver in transport simulations to yield answers to challenging problems. Although the DRM problem is simple to solve, it quickly becomes a computationally challenging problem in large-scale transportation system simulations. Therefore, this study thoroughly examines the DRM problem dynamics and proposes an optimization-based solution framework to solve the problem efficiently. To benefit from parallel computing and reduce computational times, the problem’s network is divided into clusters utilizing a commonly used unsupervised machine learning algorithm along with a linear programming model. Then, these sub-problems are solved using another linear program to finalize the ride-matching. At the clustering level, the framework allows users adjusting cluster sizes to balance the trade-off between the computational time savings and the solution quality deviation. A case study in the Chicago Metropolitan Area, U.S., illustrates that the framework can reduce the average computational time by 58% at the cost of increasing the average pick up time by 26% compared with a system optimum, that is, non-clustered, approach. Another case study in a relatively small city, Bloomington, Illinois, U.S., shows that the framework provides quite similar results to the system-optimum approach in approximately 62% less computational time.

33 ADVANCED PROPULSION SYSTEMS↗

VEXT: A Virtual Observatory Exploration Toolkit

This final report consists of two main parts. The first is taken from a paper by the PiCA (Pittsburgh Computational Astrostatistics) Group which describes our ongoing work in fast computation of n-point correlation functions. We present here a new algorithm for the fast computation of N-point correlation functions in large astronomical data sets. The algorithm is based on kd-trees which are decorated with cached sufficient statistics thus allowing for orders of magnitude speed-ups over the naive non-tree-based implementation of correlation functions. We further discuss the use of controlled approximations within the computation which allows for further acceleration. In summary, our algorithm now makes it possible to compute exact, all-pairs, measurements of the two, three and four-point correlation functions for cosmological data sets like the Sloan Digital Sky Survey and the next generation of Cosmic Microwave Background experiments. The second part summarizes the progress made by the PiCA Group in this area through the AISR grant.

Schneider, Jeff↗

MCNP5 Criticality Validation and Bias for Intermediate Enriched Uranium Systems

The purpose of this analysis is to validate the Monte Carlo N-Particle 5 (MCNP5) code Version 1.40 (LA-UR-03-1987, 2005) and its cross-section database for k-code calculations of intermediate enriched uranium systems on INTEL ® processor based PC's running any version of the WINDOWS operating system. Configurations with intermediate enriched uranium were modeled with the moderator range of 39≤HlFissile≤1438. See Table 2-1 for brief descriptions of selected cases and Table 3-1 for the range of applicability for this validation. A total of 167 input cases were evaluated including bare and reflected systems in a single body or arrays. The 167 cases were taken directly from the previous (Version 4C [Lan 2005]) validation database. Section 2.0 list data used to calculate k-effective (k eff ) for the 167 experimental criticality benchmark cases using the MCNP5 code v1.40 and its cross-section database. Appendix B lists the MCNP cross-section database entries validated for use in evaluating the intermediate enriched uranium systems for criticality safety. The dimensions and atom densities for the intermediate enriched uranium experiments were taken from NEA/NSC/DOC(95)03, September 2005, which will be referred to as the benchmark handbook throughout the report. For these input values, the experimental benchmark k eff is approximately 1.0. The MCNP validation computer runs ran to an accuracy of approximately ±0.001. For the cases where the reported benchmark k eff was not equal to 1.0000 the MCNP calculational results were normalized. The difference between the MCNP validation computer runs and the experimentally measured k eff is the MCNP5 v1.40 bias. The USLSTATS code (ORNL 1998) was utilized to perform the statistical analysis and generate an acceptable maximum k eff limit for calculations of the intermediate enriched uranium type systems.

42 ENGINEERING↗

Iterated Gauss-Seidel GMRES

The GMRES algorithm of Saad and Schultz [SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869] is an iterative method for approximately solving linear systems Ax = b, with initial guess x0 and residual r0 = b Ax0. The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of Vk ). It is well known that this process can be viewed as a QR factorization of the matrix Bk = [r0, AVk] at each iteration. Despite an O (..epsilon..)..kappa.. (Bk ) loss of orthogonality, for unit roundoff ..epsilon..and condition number ..kappa.. , the modified Gram-Schmidt formulation was shown to be backward stable in the seminal paper by Paige et al. [SIAM J. Matrix Anal.Appl., 28 (2006), pp. 264-284]. We present an iterated Gauss-Seidel formulation of the GMRES algorithm (IGS-GMRES) based on the ideas of Ruhe [Linear Algebra Appl., 52 (1983), pp. 591-601] and Swirydowicz et al. [Numer. Linear Algebra Appl., 28 (2020), pp. 1-20]. IGS-GMRES maintains orthogonality to the level O (..epsilon..)..kappa.. (Bk ) or O (..epsilon..), depending on the choice of one or two iterations; for two Gauss-Seidel iterations, the computed Krylov basis vectors remain orthogonal to working accuracy and the smallest singular value of Vk remains close to one. The resulting GMRES method is thus backward stable. We show that IGS-GMRES can be implemented with only a single synchronization point per iteration, making it relevant to large-scale parallel computing environments. We also demonstrate that, unlike MGS-GMRES, in IGS-GMRES the relative Arnoldi residual corresponding to the computed approximate solution no longer stagnates above machine precision even for highly nonnormal systems.

Arnoldi-QR↗

Scale effect and optimum relations for sea surface planning

From the general dimensional and mechanical similarity theory it follows that a condition of steady motion of a given shape\bottom with constant speed on the surface of water is determined by four nondimensional parameters. By considering the various systems of independent parameters which are applied in theory and practice and special tests, there is determined their mutual relations and their suitability as planning characteristics. In studying the scale effect on the basis of the Prnndtl formula for the friction coefficient for a turbulent condition the order of magnitude is given of the error in applying the model data to full scale in the case of a single-step bottom For a bottom of complicated shape it is shown how from the test data of the hydrodynamic characteristics for one speed with various loads, or one load with various speeds, there may be obtained by simple computation with good approximation the hydrodynamic characteristics for a different speed or for a different load. (These considerations may be of use in solving certain problems on the stability of planning.) This permits extrapolating the curve of resistance against speed for large speeds inaccessible in the tank tests or for other loads which were not tested. The data obtained by computation are in good agreement with the test results. Problems regarding the optimum trim angle or the optimum width in the case of planning of a flat plate are considered from the point of view of the minimum resistance for a given load on the water and planning speeds. Formulas and graphs are given for the optimum value of the planning coefficient and the corresponding values of the trim angle and width of the flat plate.

Sedov, L.↗

RandONets: Shallow networks with random projections for learning linear and nonlinear operators

Deep neural networks have been extensively used for the solution of both the forward and the inverse problem for dynamical systems. However, their implementation necessitates optimizing a high-dimensional space of parameters and hyperparameters. This fact, along with the requirement of substantial computational resources, pose a barrier to achieving high numerical accuracy, but also interpretability. Here, to address the above challenges, we present Random Projection-based Operator Networks (RandONets): shallow networks with random projections and tailor-made numerical analysis methods that learn accurately and fast linear and nonlinear operators. Building on previous works, we prove that RandOnets are universal approximators of linear and nonlinear operators. Due to their simplicity, RandONets provide a one-step transformation of the input space, facilitating interpretability. For the evaluation of their performance, we focus on operators of PDEs. We show, that RandONets outperform by several orders of magnitude, both in terms of numerical approximation accuracy and computational cost, the “vanilla” DeepONets. Hence, we believe that our method will trigger further developments in the field of scientific machine learning, for the development of new ‘’light”schemes that will provide high accuracy while reducing dramatically the computational cost. A MATLAB toolbox for RandONets, including demos, is available on GitHub at https://github.com/GianlucaFabiani/RandONets.

Interpretable machine learning↗

Differential formulation of the viscous history force on a particle for efficient and accurate computation

It is well known that the computation of the Basset-like history force is very demanding in terms of CPU and memory requirements, since it requires the evaluation of a history integral. We use the recent rational theory of Beylkin & Monzón ( Appl. Comput. Harmon. Anal. , vol. 19, 2005, pp. 17–48) to approximate the history kernel in the form of exponential sums to reformulate the viscous history force in a differential form. This theory allows us to approximate the history kernel in terms of exponential sums to any desired order of accuracy. This removes the need for long-time storage of the acceleration histories of the particle and the fluid. The proposed differential form approximation is applied to compute the history force on a spherical particle in a synthetic turbulent flow and a wall-bounded turbulent channel flow. Particles of various diameters are considered, and results obtained using the present technique are in reasonable agreement with those achieved using the full history integral.

Mechanics↗

Extent of hydrogen coverage of Si(001) under chemical vapor deposition conditions from ab initio approaches

The extent of hydrogen coverage of the Si(001) c(4 × 2) surface in the presence of hydrogen gas has been studied with dispersion corrected density functional theory. Electronic energy contributions are well described using a hybrid functional. The temperature dependence of the coverage in thermodynamic equilibrium was studied computing the phonon spectrum in a supercell approach. As an approximation to these demanding computations, an interpolated phonon approach was found to give comparable accuracy. The simpler ab initio thermodynamic approach is not accurate enough for the system studied, even if corrections by the Einstein model for surface vibrations are considered. The on-set of H{sub 2} desorption from the fully hydrogenated surface is predicted to occur at temperatures around 750 K. Strong changes in hydrogen coverage are found between 1000 and 1200 K in good agreement with previous reflectance anisotropy spectroscopy experiments. These findings allow a rational choice for the surface state in the computational treatment of chemical reactions under typical metal organic vapor phase epitaxy conditions on Si(001).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗