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,081 records · Page 60

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↗

Radiative cooling in shock-heated hydrogen-helium plasmas

Axial and off-axis radiative cooling of cylindrical shock-heated hydrogen-helium plasmas is investigated theoretically and experimentally. The coupled fluid dynamic-radiative transfer equations are solved by a combination of approximation techniques aimed at simplifying the computation of the flux divergence term, namely, the quasi-isothermal approximation and the exponential approximation developed for the solid angle integration. The accuracy of the approximation schemes has been assessed and found acceptable for applying the methods to the rapid computation of the radiatively coupled flow problem. Radiative cooling experiments were conducted in a 6-inch annular arc accelerator shock tube (ANAA) for an initial pressure of 1 torr and shock speeds from 35 to 45 Km/sec. The results indicate that the lateral cooling is small compared with the axial cooling, and that better agreement is achieved between the data and the theoretical results by inclusion of the lateral temperature gradient.

Poon, P. T. Y.↗

Geometric Model for a Parametric Study of the Blended-Wing-Body Airplane

A parametric model is presented for the blended-wing-body airplane, one concept being proposed for the next generation of large subsonic transports. The model is defined in terms of a small set of parameters which facilitates analysis and optimization during the conceptual design process. The model is generated from a preliminary CAD geometry. From this geometry, airfoil cross sections are cut at selected locations and fitted with analytic curves. The airfoils are then used as boundaries for surfaces defined as the solution of partial differential equations. Both the airfoil curves and the surfaces are generated with free parameters selected to give a good representation of the original geometry. The original surface is compared with the parametric model, and solutions of the Euler equations for compressible flow are computed for both geometries. The parametric model is a good approximation of the CAD model and the computed solutions are qualitatively similar. An optimal NURBS approximation is constructed and can be used by a CAD model for further refinement or modification of the original geometry.

Mastin, C. Wayne↗

Materials with periodic internal structure: Computation based on homogenization and comparison with experiment

The combination of thermal and mechanical loading expected in practice means that constitutive equations of metal matrix composites must be developed which deal with time-independent and time-dependent irreversible deformation. Also, the internal state of composites is extremely complicated which underlines the need to formulate macroscopic constitutive equations with a limited number of state variables which represent the internal state at the micro level. One available method for calculating the macro properties of composites in terms of the distribution and properties of the constituent materials is the method of homogenization whose formulation is based on the periodicity of the substructure of the composite. A homogenization procedure was developed which lends itself to the use of the finite element procedure. The efficiency of these procedures, to determine the macroscopic properties of a composite system from its constituent properties, was demonstrated utilizing an aluminum plate perforated by directionally oriented slits. The selection of this problem is based on the fact that, extensive experimental results exist, the macroscopic response is highly anisotropic, and that the slits provide very high stress gradients which severely test the effectiveness of the computational procedures. Furthermore, both elastic and plastic properties were investigated so that the application to practical systems with inelastic deformation should be able to proceed without difficulty. The effectiveness of the procedures was rigorously checked against experimental results and with the predictions of approximate calculations. Using the computational results it is illustrated how macroscopic constitutive equations can be expressed in forms of the elastic and limit load behavior.

Jansson, S.↗

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↗

Essentially nonoscillatory postprocessing filtering methods

High order accurate centered flux approximations used in the computation of numerical solutions to nonlinear partial differential equations produce large oscillations in regions of sharp transitions. Here, we present a new class of filtering methods denoted by Essentially Nonoscillatory Least Squares (ENOLS), which constructs an upgraded filtered solution that is close to the physically correct weak solution of the original evolution equation. Our method relies on the evaluation of a least squares polynomial approximation to oscillatory data using a set of points which is determined via the ENO network. Numerical results are given in one and two space dimensions for both scalar and systems of hyperbolic conservation laws. Computational running time, efficiency, and robustness of method are illustrated in various examples such as Riemann initial data for both Burgers' and Euler's equations of gas dynamics. In all standard cases, the filtered solution appears to converge numerically to the correct solution of the original problem. Some interesting results based on nonstandard central difference schemes, which exactly preserve entropy, and have been recently shown generally not to be weakly convergent to a solution of the conservation law, are also obtained using our filters.

Lafon, F.↗

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↗

High-fidelity Modeling and Visualizing of Solar Radiation Pressure A Framework for High-fidelity Analysis

Solar Radiation Pressure (SRP) is the force produced by the impact of sunlight photons on the surface of the spacecraft. This extra force, despite being small,plays an important role on trajectory design and orbit determination. In this pa-per we present an open-source tool that enables the user to compute high-fidelity approximations of SRP accelerations for a given spacecraft using ray-tracing techniques. The tool also allows the user to compare between different fidelity levels and different models like the N-plate or the cannonball finding a trade-off on the SRP accuracy between computation time and accuracy.

Leandro Zardain↗

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↗

Development of a multiple-parameter nonlinear perturbation procedure for transonic turbomachinery flows: Preliminary application to design/optimization problems

An investigation was conducted to continue the development of perturbation procedures and associated computational codes for rapidly determining approximations to nonlinear flow solutions, with the purpose of establishing a method for minimizing computational requirements associated with parametric design studies of transonic flows in turbomachines. The results reported here concern the extension of the previously developed successful method for single parameter perturbations to simultaneous multiple-parameter perturbations, and the preliminary application of the multiple-parameter procedure in combination with an optimization method to blade design/optimization problem. In order to provide as severe a test as possible of the method, attention is focused in particular on transonic flows which are highly supercritical. Flows past both isolated blades and compressor cascades, involving simultaneous changes in both flow and geometric parameters, are considered. Comparisons with the corresponding exact nonlinear solutions display remarkable accuracy and range of validity, in direct correspondence with previous results for single-parameter perturbations.

Stahara, S. S.↗

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↗