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 739 records · Page 41

Numerical solution of 2D-vector tomography problem using the method of approximate inverse

We propose a numerical solution of reconstruction problem of a two-dimensional vector field in a unit disk from the known values of the longitudinal and transverse ray transforms. The algorithm is based on the method of approximate inverse. Numerical simulations confirm that the proposed method yields good results of reconstruction of vector fields.

97 MATHEMATICS AND COMPUTING↗

Self-shielding models of MICROX-2 code

The MICROX-2 is a transport theory code that solves for the neutron slowing-down and thermalization equations of a two-region lattice cell. In the previous study, a new fine-group cross section library of the MICROX-2 was generated and tested against reference calculations and measurement data. In this study, existing physics models of the MICROX-2 are reviewed and updated to improve the physics calculation performance of the MICROX-2 code, including the resonance self-shielding model and spatial self-shielding factor. The updated self-shielding models have been verified through a series of benchmark calculations against the Monte Carlo code, using homogeneous and pin cell models selected for this study. The results have shown that the updates of the self-shielding factor calculation model are correct and improve the physics calculation accuracy even though the magnitude of error reduction is relatively small. Compared to the existing models, the updates reduced the prediction error of the infinite multiplication factor by approximately 0.1 % and 0.2% for the homogeneous and pin cell models, respectively, considered in this study. (authors)

97 MATHEMATICS AND COMPUTING↗

Predictive modeling of NSTX discharges with the updated multi-mode anomalous transport module

Abstract The objective of this study is twofold: firstly, to demonstrate the consistency between the anomalous transport results produced by updated Multi-Mode Model (MMM) version 9.0.4 and those obtained through gyrokinetic simulations; and secondly, to showcase MMM’s ability to predict electron and ion temperature profiles in low aspect ratio, high beta NSTX discharges. MMM encompasses a range of transport mechanisms driven by electron and ion temperature gradients, trapped electrons, kinetic ballooning, peeling, microtearing, and drift resistive inertial ballooning modes. These modes within MMM are being verified through corresponding gyrokinetic results. The modes that potentially contribute to ion thermal transport are stable in MMM, aligning with both experimental data and findings from linear CGYRO simulations. The isotope effects on these modes are also studied and higher mass is found to be stabilizing, consistent with the experimental trend. The electron thermal power across the flux surface is computed within MMM and compared to experimental measurements and nonlinear CGYRO simulation results. Specifically, the electron temperature gradient modes (ETGM) within MMM account for 2.0 MW of thermal power, consistent with experimental findings. It is noteworthy that the ETGM model requires approximately 5.0 ms of computation time on a standard desktop, while nonlinear CGYRO simulations necessitate 8.0 h on 8 K cores. MMM proves to be highly computationally efficient, a crucial attribute for various applications, including real-time control, tokamak scenario optimization, and uncertainty quantification of experimental data.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Improving the efficiency of G 0 W 0 calculations with approximate spectral decompositions of dielectric matrices

Recently, it was shown that the calculation of quasiparticle energies using the G 0 W 0 approximation can be performed without computing explicitly any virtual electronic states, by expanding the Green function and screened Coulomb interaction in terms of the eigenstates of the static dielectric matrix. Avoiding the evaluation of virtual electronic states leads to improved efficiency and ease of convergence of G 0 W 0 calculations. Here, we propose a further improvement of the efficiency of these calculations, based on an approximation of density-density response functions of molecules and solids. The approximation relies on the calculation of a subset of eigenvectors of the dielectric matrix using the kinetic operator instead of the full Hamiltonian, and it does not lead to any substantial loss of accuracy for the quasiparticle energies. The computational savings introduced by this approximation depend on the system, and they become more substantial as the number of electrons increases.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Min-Max Spaces and Complexity Reduction in Min-Max Expansions

Idempotent methods have been found to be extremely helpful in the numerical solution of certain classes of nonlinear control problems. In those methods, one uses the fact that the value function lies in the space of semiconvex functions (in the case of maximizing controllers), and approximates this value using a truncated max-plus basis expansion. In some classes, the value function is actually convex, and then one specifically approximates with suprema (i.e., max-plus sums) of affine functions. Note that the space of convex functions is a max-plus linear space, or moduloid. In extending those concepts to game problems, one finds a different function space, and different algebra, to be appropriate. Here we consider functions which may be represented using infima (i.e., min-max sums) of max-plus affine functions. It is natural to refer to the class of functions so represented as the min-max linear space (or moduloid) of max-plus hypo-convex functions. We examine this space, the associated notion of duality and min-max basis expansions. In using these methods for solution of control problems, and now games, a critical step is complexity-reduction. In particular, one needs to find reduced-complexity expansions which approximate the function as well as possible. We obtain a solution to this complexity-reduction problem in the case of min-max expansions.

97 MATHEMATICS AND COMPUTING↗

Direction-Preserving and Schur-Monotonic Semi-Separable Approximations of Symmetric Positive Definite Matrices}

For a given symmetric positive definite matrix A {element_of} R{sup N x N}, we develop a fast and backward stable algorithm to approximate A by a symmetric positive-definite semi-separable matrix, accurate to a constant multiple of any prescribed tolerance. In addition, this algorithm preserves the product, AZ, for a given matrix Z {element_of} R{sup N x d}, where d << N. Our algorithm guarantees the positive-definiteness of the semi-separable matrix by embedding an approximation strategy inside a Cholesky factorization procedure to ensure that the Schur complements during the Cholesky factorization all remain positive definite after approximation. It uses a robust direction-preserving approximation scheme to ensure the preservation of AZ. We present numerical experiments and discuss potential implications of our work.

97 MATHEMATICS AND COMPUTING↗

Direction-preserving and Schur-monotonic Semi-separable Approximations of Symmetric Positive Definite Matrices

For a given symmetric positive definite matrix A {element_of} R{sup nxn}, we develop a fast and backward stable algorithm to approximate A by a symmetric positive-definite semi-separable matrix, accurate to any prescribed tolerance. In addition, this algorithm preserves the product, AZ, for a given matrix Z {element_of} R{sup nxd}, where d << n. Our algorithm guarantees the positive-definiteness of the semi-separable matrix by embedding an approximation strategy inside a Cholesky factorization procedure to ensure that the Schur complements during the Cholesky factorization all remain positive definite after approximation. It uses a robust direction-preserving approximation scheme to ensure the preservation of AZ. We present numerical experiments and discuss potential implications of our work.

97 MATHEMATICS AND COMPUTING↗

HyRec: A fast and highly accurate primordial hydrogen and helium recombination code

We present a state-of-the-art primordial recombination code, HYREC, including all the physical effects that have been shown to significantly affect recombination. The computation of helium recombination includes simple analytic treatments of hydrogen continuum opacity in the He I 2{sup 1}P{sup o}-1{sup 1}S line, the He I]2{sup 3}P{sup o}-1{sup 1}S line, and treats feedback between these lines within the on-the-spot approximation. Hydrogen recombination is computed using the effective multilevel atom method, virtually accounting for an infinite number of excited states. We account for two-photon transitions from 2s and higher levels as well as frequency diffusion in Lyman-{alpha} with a full radiative transfer calculation. We present a new method to evolve the radiation field simultaneously with the level populations and the free electron fraction. These computations are sped up by taking advantage of the particular sparseness pattern of the equations describing the radiative transfer. The computation time for a full recombination history is {approx}2 seconds. This makes our code well suited for inclusion in Monte Carlo Markov chains for cosmological parameter estimation from upcoming high-precision cosmic microwave background anisotropy measurements.

74 ATOMIC AND MOLECULAR PHYSICS↗

Learning planar ising models

Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models, which suggests the problem of seeking the best approximation to a collection of random variables within some tractable family of graphical models. In this paper, we focus our attention on the class of planar Ising models, for which inference is tractable using techniques of statistical physics [Kac and Ward; Kasteleyn]. Based on these techniques and recent methods for planarity testing and planar embedding [Chrobak and Payne], we propose a simple greedy algorithm for learning the best planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. We present the results of numerical experiments evaluating the performance of our algorithm.

36 MATERIALS SCIENCE↗

A Parallel Reconstructed Discontinuous Galerkin Method for the Compressible Flows on Aritrary Grids

A reconstruction-based discontinuous Galerkin method is presented for the solution of the compressible Navier-Stokes equations on arbitrary grids. In this method, an in-cell reconstruction is used to obtain a higher-order polynomial representation of the underlying discontinuous Galerkin polynomial solution and an inter-cell reconstruction is used to obtain a continuous polynomial solution on the union of two neighboring, interface-sharing cells. The in-cell reconstruction is designed to enhance the accuracy of the discontinuous Galerkin method by increasing the order of the underlying polynomial solution. The inter-cell reconstruction is devised to remove an interface discontinuity of the solution and its derivatives and thus to provide a simple, accurate, consistent, and robust approximation to the viscous and heat fluxes in the Navier-Stokes equations. A parallel strategy is also devised for the resulting reconstruction discontinuous Galerkin method, which is based on domain partitioning and Single Program Multiple Data (SPMD) parallel programming model. The RDG method is used to compute a variety of compressible flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results demonstrate that this RDG method is third-order accurate at a cost slightly higher than its underlying second-order DG method, at the same time providing a better performance than the third order DG method, in terms of both computing costs and storage requirements.

97 MATHEMATICS AND COMPUTING↗

Optimization of Simultaneous Measurement for Variational Quantum Eigensolver Applications

Variational quantum eigensolver (VQE) is a promising algorithm suitable for near-term quantum computers. VQE aims to approximate solutions to exponentially-sized optimization problems by executing a polynomial number of quantum sub-problems. However, the number of subproblems scales as N-4 for typical problems of interest-a daunting growth rate that poses a serious limitation for emerging applications such as quantum computational chemistry. We mitigate this issue by exploiting the simultaneous measurability of subproblems corresponding to commuting terms. Our technique transpiles VQE instances into a format optimized for simultaneous measurement, ultimately yielding 8-30x lower cost. Our work also encompasses a synthesis tool for compiling simultaneous measurement circuits with minimal overhead. We demonstrate experimental validation of our techniques by estimating the ground state energy of deuteron with a quantum computer. We also investigate the underlying statistics of simultaneous measurement and devise an adaptive strategy for mitigating harmful covariance terms.

quantum computing↗

An algorithm for linearizing convex extremal problems

This paper suggests a method of approximating the solution of minimization problems for convex functions of several variables under convex constraints is suggested. The main idea of this approach is the approximation of a convex function by a piecewise linear function, which results in replacing the problem of convex programming by a linear programming problem. To carry out such an approximation, the epigraph of a convex function is approximated by the projection of a polytope of greater dimension. In the first part of the paper, the problem is considered for functions of one variable. In this case, an algorithm for approximating the epigraph of a convex function by a polygon is presented, it is shown that this algorithm is optimal with respect to the number of vertices of the polygon, and exact bounds for this number are obtained. After this, using an induction procedure, the algorithm is generalized to certain classes of functions of several variables. Applying the suggested method, polynomial algorithms for an approximate calculation of the L{sub p}-norm of a matrix and of the minimum of the entropy function on a polytope are obtained. Bibliography: 19 titles.

97 MATHEMATICS AND COMPUTING↗

Automated Mapping of a Plane Curvilinear Contour by a Smooth Set of Arcs in Rotary and Deep Extrusion

The use of smooth continuous approximating curves consisting of arcs of circles to solve production problems is considered. A relatively simple and efficient recurrent algorithm is developed for use with Kompas-3D, MS Excel, and other software. The algorithm is based on the property of the bisector of a triangle. An analytical form of the approximating curve is determined. A real-time graphic interactive interface in Kompas-3D software is derived. Some irregular mapping situations are described. Practical results are outlined.

42 ENGINEERING↗

High order spatial expansion for the method of characteristics applied to 3-D geometries

The method of characteristics is an efficient and flexible technique to solve the neutron transport equation and has been extensively used in two-dimensional calculations because it permits to deal with complex geometries. However, because of a very fast increase in storage requirements and number of floating operations, its direct application to three-dimensional routine transport calculations it is not still possible. In this work we introduce and analyze several modifications aimed to reduce memory requirements and to diminish the computing burden. We explore high-order spatial approximation, the use of intermediary trajectory-dependent flux expansions and the possibility of dynamic trajectory reconstruction from local tracking for typed subdomains. (authors)

97 MATHEMATICS AND COMPUTING↗

Learning algorithms for stack filter classifiers

Stack Filters define a large class of increasing filter that is used widely in image and signal processing. The motivations for using an increasing filter instead of an unconstrained filter have been described as: (1) fast and efficient implementation, (2) the relationship to mathematical morphology and (3) more precise estimation with finite sample data. This last motivation is related to methods developed in machine learning and the relationship was explored in an earlier paper. In this paper we investigate this relationship by applying Stack Filters directly to classification problems. This provides a new perspective on how monotonicity constraints can help control estimation and approximation errors, and also suggests several new learning algorithms for Boolean function classifiers when they are applied to real-valued inputs.

97 MATHEMATICS AND COMPUTING↗

Extension of PENELOPE to protons: Simulation of nuclear reactions and benchmark with Geant4

Purpose: Describing the implementation of nuclear reactions in the extension of the Monte Carlo code (MC) PENELOPE to protons (PENH) and benchmarking with Geant4.Methods: PENH is based on mixed-simulation mechanics for both elastic and inelastic electromagnetic collisions (EM). The adopted differential cross sections for EM elastic collisions are calculated using the eikonal approximation with the Dirac–Hartree–Fock–Slater atomic potential. Cross sections for EM inelastic collisions are computed within the relativistic Born approximation, using the Sternheimer–Liljequist model of the generalized oscillator strength. Nuclear elastic and inelastic collisions were simulated using explicitly the scattering analysis interactive dialin database for {sup 1}H and ICRU 63 data for {sup 12}C, {sup 14}N, {sup 16}O, {sup 31}P, and {sup 40}Ca. Secondary protons, alphas, and deuterons were all simulated as protons, with the energy adapted to ensure consistent range. Prompt gamma emission can also be simulated upon user request. Simulations were performed in a water phantom with nuclear interactions switched off or on and integral depth–dose distributions were compared. Binary-cascade and precompound models were used for Geant4. Initial energies of 100 and 250 MeV were considered. For cases with no nuclear interactions simulated, additional simulations in a water phantom with tight resolution (1 mm in all directions) were performed with FLUKA. Finally, integral depth–dose distributions for a 250 MeV energy were computed with Geant4 and PENH in a homogeneous phantom with, first, ICRU striated muscle and, second, ICRU compact bone.Results: For simulations with EM collisions only, integral depth–dose distributions were within 1%/1 mm for doses higher than 10% of the Bragg-peak dose. For central-axis depth–dose and lateral profiles in a phantom with tight resolution, there are significant deviations between Geant4 and PENH (up to 60%/1 cm for depth–dose distributions). The agreement is much better with FLUKA, with deviations within 3%/3 mm. When nuclear interactions were turned on, agreement (within 6% before the Bragg-peak) between PENH and Geant4 was consistent with uncertainties on nuclear models and cross sections, whatever the material simulated (water, muscle, or bone).Conclusions: A detailed and flexible description of nuclear reactions has been implemented in the PENH extension of PENELOPE to protons, which utilizes a mixed-simulation scheme for both elastic and inelastic EM collisions, analogous to the well-established algorithm for electrons/positrons. PENH is compatible with all current main programs that use PENELOPE as the MC engine. The nuclear model of PENH is realistic enough to give dose distributions in fair agreement with those computed by Geant4.

61 RADIATION PROTECTION AND DOSIMETRY↗

Multi-plane moment-of-fluid interface reconstruction in 3D

Moment-of-fluid (MOF) methods for interface reconstruction approximate the region occupied by material in each mesh element only through reference to its geometric moments. Here, we present a 3D MOF method that represents the material (POM) in each cell as the convex intersection of the cell and multiple half-spaces, each selected to minimize the least-squares error between computed moments of the approximated material and provided reference moments. This optimization problem is highly non-linear and non-convex, making the numerical result very sensitive to the initial guess. To create an effective initial guess in each cell, we construct an ellipsoid from 0th–2nd order reference moments such that its shape corresponds with that of the POM. Within this ellipsoid we inscribe a polyhedron, and initialize the minimization problem with the half-spaces defined by each of its faces. The inscribed polyhedron has minimally 4 faces, and using up to 3rd order moments permits optimization over up to 20 unknown values. We therefore define MOF methods that utilize 4, 5, or 6 half-spaces, correspondingly initialized with the faces of a single inscribed tetrahedron, triangular prism, or hexahedron. Stability of the non-linear optimization is further improved with a prepossessing step that normalizes the reference moments according to the axes of the reference ellipsoid. Using this approach, the non-linear least-squares solver reliably converges to a near-global minimum from a single initial guess. We demonstrate accuracy and robustness using single-cell and multi-cell examples over a wide spectrum of geometry. In particular, we demonstrate our ability to exactly reproduce several important and complex features defined by up to four half-spaces, such as corners, filaments, filament tips, and embedded material in the cell.

3D interface reconstruction↗

Scalar relativistic computations of nuclear magnetic shielding and g-shifts with the zeroth-order regular approximation and range-separated hybrid density functionals

Density functional theory (DFT) calculations of NMR chemical shifts and molecular g-tensors with Gaussian-type orbitals are implemented via second-order energy derivatives within the scalar relativistic zeroth order regular approximation (ZORA) framework. Nonhybrid functionals, standard (global) hybrids, and range-separated (Coulomb-attenuated, long-range corrected) hybrid functionals are tested. Origin invariance of the results is ensured by use of gauge-including atomic orbital (GIAO) basis functions. The new implementation in the NWChem quantum chemistry package is verified by calculations of nuclear shielding constants for the heavy atoms in HX (X=F, Cl, Br, I, At) and H2X (X = O, S, Se, Te, Po), and Te chemical shifts in a number of tellurium compounds. The basis set and functional dependence of g-shifts is investigated for 14 radicals with light and heavy atoms. The problem of accurately predicting F NMR shielding in UF6-nCln, n = 1 to 6, is revisited. The results are sensitive to approximations in the density functionals, indicating a delicate balance of DFT self-interaction vs. correlation. For the uranium halides, the results with the range-separated functionals are mixed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗