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,459 records · Page 81

Finite-Element Methods for Real-Time Simulation of Surgery

Two finite-element methods have been developed for mathematical modeling of the time-dependent behaviors of deformable objects and, more specifically, the mechanical responses of soft tissues and organs in contact with surgical tools. These methods may afford the computational efficiency needed to satisfy the requirement to obtain computational results in real time for simulating surgical procedures as described in Simulation System for Training in Laparoscopic Surgery (NPO-21192) on page 31 in this issue of NASA Tech Briefs. Simulation of the behavior of soft tissue in real time is a challenging problem because of the complexity of soft-tissue mechanics. The responses of soft tissues are characterized by nonlinearities and by spatial inhomogeneities and rate and time dependences of material properties. Finite-element methods seem promising for integrating these characteristics of tissues into computational models of organs, but they demand much central-processing-unit (CPU) time and memory, and the demand increases with the number of nodes and degrees of freedom in a given finite-element model. Hence, as finite-element models become more realistic, it becomes more difficult to compute solutions in real time. In both of the present methods, one uses approximate mathematical models trading some accuracy for computational efficiency and thereby increasing the feasibility of attaining real-time up36 NASA Tech Briefs, October 2003 date rates. The first of these methods is based on modal analysis. In this method, one reduces the number of differential equations by selecting only the most significant vibration modes of an object (typically, a suitable number of the lowest-frequency modes) for computing deformations of the object in response to applied forces.

Basdogan, Cagatay↗

Strategy for reflector pattern calculation: Let the computer do the work

Using high frequency approximations, the secondary pattern of a reflector antenna can be calculated by numerically evaluating a radiation integral I(u,v). In recent years, tremendous effort has been expended to reducing I(u,v) to Fourier integrals. These reduction schemes are invariably reflector geometry dependent. Hence, different analyses/computer software development must be carried out for different reflector shapes/boundaries. it is pointed out, that, as the computer power improves, these reduction schemes are no longer necessary. Comparable accuracy and computation time can be achieved by evaluating I(u,v) by a brute force FFT described in this note. Furthermore, there is virtually no restriction on the reflector geometry by using the brute force FFT.

Lam, P. T.↗

Strategy for reflector pattern calculation - Let the computer do the work

Using high frequency approximations, the secondary pattern of a reflector antenna can be calculated by numerically evaluating a radiation integral I(u,v). In recent years, tremendous effort has been expended to reducing I(u,v) to Fourier integrals. These reduction schemes are invariably reflector geometry dependent. Hence, different analyses/computer software development must be carried out for different reflector shapes/boundaries. It is pointed out, that, as the computer power improves, these reduction schemes are no longer necessary. Comparable accuracy and computation time can be achieved by evaluating I(u,v) by a brute force FFT described in this note. Furthermore, there is virtually no restriction on the reflector geometry by using the brute force FFT.

Lam, P. T.↗

Benchmark calculations on the lowest-energy singlet, triplet, and quintet states of the four-electron harmonium atom

For a wide range of confinement strengths ω, explicitly-correlated calculations afford approximate energies E(ω) of the ground and low-lying excited states of the four-electron harmonium atom that are within few μhartree of the exact values, the errors in the respective energy components being only slightly higher. This level of accuracy constitutes an improvement of several orders of magnitude over the previously published data, establishing a set of benchmarks for stringent calibration and testing of approximate electronic structure methods. Its usefulness is further enhanced by the construction of differentiable approximants that allow for accurate computation of E(ω) and its components for arbitrary values of ω. The diversity of the electronic states in question, which involve both single- and multideterminantal first-order wavefunctions, and the availability of the relevant natural spinorbitals and their occupation numbers make the present results particularly useful in research on approximate density-matrix functionals. The four-electron harmonium atom is found to possess the {sup 3}P{sub +} triplet ground state at strong confinements and the {sup 5}S{sub −} quintet ground state at the weak ones, the energy crossing occurring at ω ≈ 0.0240919.

74 ATOMIC AND MOLECULAR PHYSICS↗

Efficient Delaunay Tessellation through K-D Tree Decomposition

Delaunay tessellations are fundamental data structures in computational geometry. They are important in data analysis, where they can represent the geometry of a point set or approximate its density. The algorithms for computing these tessellations at scale perform poorly when the input data is unbalanced. We investigate the use of k-d trees to evenly distribute points among processes and compare two strategies for picking split points between domain regions. Because resulting point distributions no longer satisfy the assumptions of existing parallel Delaunay algorithms, we develop a new parallel algorithm that adapts to its input and prove its correctness. We evaluate the new algorithm using two late-stage cosmology datasets. The new running times are up to 50 times faster using k-d tree compared with regular grid decomposition. Moreover, in the unbalanced data sets, decomposing the domain into a k-d tree is up to five times faster than decomposing it into a regular grid.

Morozov, Dmitriy↗

Bootstrap-based confidence interval estimation for thermal security region of bulk power grid

Thermal security region (TSR) is a powerful tool for monitoring and controlling the thermal security of bulk power grid with high penetration of renewable energy. One of the major challenges of TSR in practical application is to obtain the exact analytical expression of the TSR boundary (TSRB) because TSRB is a nonlinear hypersurface described by an implicit function. For this reason, the TSRB is usually approximated by hyperplane instead of getting the exact analytical expression. Traditionally, the coefficients of the hyperplane are estimated with a set of original TSRB points using least square estimation (LSE). However, LSE is a point estimation method, which is incapable of evaluating the quality of the estimation. In addition, the accuracy and computational efficiency of the hyperplane approximation are influenced by the number of TSRB points significantly. Here, a bootstrap based confidence interval estimation is proposed to estimate not only the coefficients of TSRB approximation hyperplane, but also the standard deviations and confidence intervals of the coefficients for evaluating the quality and reliability of the approximation results. First, empirical distribution functions (EDFs) of the coefficients of TSRB approximation hyperplane are approximated from a set of original TSRB points by using residual resampling bootstrap method. Then, the EDFs of the coefficients are employed to estimate the coefficients of the approximation hyperplane. Meanwhile, the standard deviations and confidence intervals of the estimated coefficients of the hyperplanes are also calculated for evaluating the quality and reliability of the approximation. The proposed approach is tested on the China Southern Power Grid (CSG). Results of simulations validate the accuracy and efficiency of the proposed approach in approximating the TSRB.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Frontier (HPE Cray EX) Exascale Supercomputer at the Oak Ridge Leadership Computing Facility

Frontier is the HPE Cray EX exascale supercomputer deployed and operated by the Oak Ridge Leadership Computing Facility (OLCF) at Oak Ridge National Laboratory (ORNL). Frontier is designed for large-scale modeling, simulation, and AI workloads and is built from HPE Cray EX system architecture with AMD CPUs and AMD Instinct GPU accelerators connected by the HPE Slingshot interconnect. System composition (representative production configuration): Frontier is composed of approximately 74 cabinets with 128 compute nodes per cabinet (~9,400 compute nodes total). Each compute node contains one 64-core AMD EPYC CPU and four AMD Instinct MI250X GPUs. Nodes are connected using HPE Slingshot (Slingshot-200 class) networking with multiple NIC ports per node providing high injection bandwidth. Frontier is connected to the Orion parallel file system (multi-tier Lustre) providing a large, center-wide high-performance storage namespace. Operational context: Frontier entered public prominence as the first system to reach No. 1 on the TOP500 list in May 2022 (HPL benchmark), establishing the first widely recognized exascale-era performance milestone. The system supports DOE Office of Science mission workloads and enables leadership-class computational science and AI for open science users.

AMD EPYC↗

Sparse, iterative simulation methods for one-dimensional laminar flames

Sparse, iterative simulation methods for one-dimensional laminar flames are proposed. The resulting steady and unsteady flame solvers exploit approximate Jacobians to greatly reduce the computational cost associated with matrix operations. The constant, non-unity Lewis number assumption is introduced to further reduce the computational cost. The solvers are also parallelized to reduce time-to-solution on distributed memory computer systems. Computed laminar flame speeds and species profiles for a range of chemical mechanisms (from 10 to 2878 species) are compared against a well-validated commercial code and are found to be consistent within solver tolerances. The computation times of both the unsteady and steady solutions increase only linearly with the number of species, which is a significant improvement over the quadratic or cubic scaling of existing steady-state flame solvers. For the largest mechanism tested, the steady-state flame solver is two orders of magnitude faster than commonly-used codes. The use of an approximate Jacobian is shown to reduce the rate of convergence for the steady-state solver, but does not significantly affect the domain of convergence. The steady-state solver with approximate Jacobian is thus well suited for computationally efficient laminar flame speed sweeps with large kinetic mechanisms.

42 ENGINEERING↗

Comparison of Capacity Value Methods for Photovoltaics in the Western United States

This report compares different capacity value estimation techniques applied to solar photovoltaics (PV). It compares more robust data and computationally intense reliability-based capacity valuation techniques to simpler approximation techniques at 14 different locations in the western United States. The capacity values at these locations are computed while holding the underlying power system characteristics fixed. This allows the effect of differences in solar availability patterns on the capacity value of PV to be directly ascertained, without differences in the power system confounding the results. Finally, it examines the effects of different PV configurations, including varying the orientation of a fixed-axis system and installing single- and double-axis tracking systems, on the capacity value. The capacity value estimations are done over an eight-year running from 1998 to 2005, and both long-term average capacity values and interannual capacity value differences (due to interannual differences in solar resource availability) are estimated. Overall, under the assumptions used in the analysis, we find that some approximation techniques can yield similar results to reliability-based methods such as effective load carrying capability.

14 SOLAR ENERGY↗

Further Examination of a Simplified Model for Positronium-Helium Scattering

While carrying out investigations on Ps-He scattering we realized that it would be possible to improve the results of a previous work on zero-energy scattering of ortho-positronium by helium atoms. The previous work used a model to account for exchange and also attempted to include the effect of short-range Coulomb interactions in the close-coupling approximation. The 3 terms that were then included did not produce a well-converged result but served to give some justification to the model. Now we improve the calculation by using a simple variational wave function, and derive a much better value of the scattering length. The new result is compared with other computed values, and when an approximate correction due to the van der Waals potential is included the total is consistent with an earlier conjecture.

DiRienzi, J.↗

Data-driven Distributed Learning of Multi-agent Systems: A Koopman Operator Approach

Koopman operator theory provides a model-free technique for studying nonlinear dynamical systems purely from data. Since the Koopman operator is infinite-dimensional, researchers have developed several methods that provide a finite-dimensional approximation of the Koopman operator so that it can be applied for practical use cases. One common thing with most of the methods is that their solutions are obtained by solving a centralized minimization problem. In this work, we treat the dynamical system to be a multi-agent system and propose an algorithm to compute the finite-dimensional approximation of the Koopman operator in a distributed manner using the knowledge of the topology of the underlying multi-agent system. The proposed distributed approach is shown to be equivalent to the centralized learning problem and results in a sparse Koopman whose block structure mimics the Laplacian of the multi-agent system. Extensive simulation studies illustrate the proposed framework on the network of oscillators and the IEEE 68 bus system.

Nandanoori, Sai Pushpak↗

Newton's method applied to finite-difference approximations for the steady-state compressible Navier-Stokes equations

Finite-difference approximations for steady-state compressible Navier-Stokes equations, whose two spatial dimensions are written in generalized curvilinear coordinates and strong conservation-law form, are presently solved by means of Newton's method in order to obtain a lifting-airfoil flow field under subsonic and transonnic conditions. In addition to ascertaining the computational requirements of an initial guess ensuring convergence and the degree of computational efficiency obtainable via the approximate Newton method's freezing of the Jacobian matrices, attention is given to the need for auxiliary methods assessing the temporal stability of steady-state solutions. It is demonstrated that nonunique solutions of the finite-difference equations are obtainable by Newton's method in conjunction with a continuation method.

Bailey, Harry E.↗

Conservative self-force correction to the innermost stable circular orbit: Comparison with multiple post-Newtonian-based methods

Barack and Sago [Phys. Rev. Lett. 102, 191101 (2009)] have recently computed the shift of the innermost stable circular orbit (ISCO) of the Schwarzschild spacetime due to the conservative self-force that arises from the finite-mass of an orbiting test-particle. This calculation of the ISCO shift is one of the first concrete results of the self-force program, and provides an exact (fully relativistic) point of comparison with approximate post-Newtonian (PN) computations of the ISCO. Here this exact ISCO shift is compared with nearly all known PN-based methods. These include both 'nonresummed' and 'resummed' approaches (the latter reproduce the test-particle limit by construction). The best agreement with the exact (Barack-Sago) result is found when the pseudo-4PN coefficient of the effective-one-body (EOB) metric is fit to numerical relativity simulations. However, if one considers uncalibrated methods based only on the currently known 3PN-order conservative dynamics, the best agreement is found from the gauge-invariant ISCO condition of Blanchet and Iyer [Classical Quantum Gravity 20, 755 (2003)], which relies only on the (nonresummed) 3PN equations of motion. This method reproduces the exact test-particle limit without any resummation. A comparison of PN methods with the ISCO in the equal-mass case (computed via sequences of numerical relativity initial-data sets) is also performed. Here a (different) nonresummed method also performs very well (as was previously shown). These results suggest that the EOB approach - while exactly incorporating the conservative test-particle dynamics and having several other important advantages - does not (in the absence of calibration) incorporate conservative self-force effects more accurately than standard PN methods. I also consider how the conservative self-force ISCO shift, combined in some cases with numerical relativity computations of the ISCO, can be used to constrain our knowledge of (1) the EOB effective metric, (2) phenomenological inspiral-merger-ringdown templates, and (3) 4PN- and 5PN-order terms in the PN orbital energy. These constraints could help in constructing better gravitational-wave templates. Lastly, I suggest a new method to calibrate unknown PN terms in inspiral templates using numerical-relativity calculations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

TTDFT: A GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations

We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses a localized Tucker tensor basis computed from an additive separable approximation to the Kohn-Sham Hamiltonian. The discrete Kohn-Sham problem is solved using Chebyshev filtered subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. In conclusion, the computational performance of the TTDFT code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms.

97 MATHEMATICS AND COMPUTING↗

Implementation of the Molecular Electrostatic Potential over Graphics Processing Units

The molecular electrostatic potential (MEP) generated by quantum chemistry methods and Gaussian functions is evaluated over graphics processing units (GPUs). This implementation is based on full-range Rys polynomials with nodes and weights obtained in each thread of a GPU. For high angular moments, the corresponding integral is solved using a one dimension vertical recurrence relation. Thus, we computed the MEP with minimal approximations. We show that this implementation is stable and very efficient since the time consumed over GPUs is quite small compared with similar implementations over CPUs. The implementation was done by using CUDA-C programming techniques within the Graphics Processing Units for Atoms and Molecules (GPUAM) project, which has been designed to analyze quantum chemistry fields over heterogeneous computational resources. With this new scalar field GPUAM is a useful application for the quantum chemistry community, in particular for people interested in chemical reactivity analysis.

Cruz-Monterrosas, Julio-Cesar↗

Allocation and Operation of A Hydropneumatic Energy Storage with Building Microgrid

Behind-meter application for a recently invented hydropneumatic Ground-Level Integrated Diverse Energy Storage (GLIDES) is focused in this research. Considering possible uncertainties from solar radiation and electricity load in a building microgrid, two-stage stochastic programming is adopted for 15-min operation and a mixed-integer nonlinear stochastic model is built with integrated energy systems of GLIDES, solar panel and power generating unit. In order to make the model computationally tractable, we use sample average approximate method to decrease associated complexity with sample size and improve solving efficiency. The experimental results in deterministic and stochastic operation indicate that best candidate solution from SAA are superior to the solution from expected value problem in terms of optimality gap and variance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Modeling composite and fluffy grains: The effects of porosity

Recent studies of interplanetary and interstellar dust provide evidence that cosmic dust grains are fluffy, composite objects, highlighting the need for models of the electromagnetic scattering by these grains. Effective medium theory (EMT) with Mie-type series solutions has been used to explore the effects of porosity which would be important in composite dust particles. While this indirect approach is both flexible and computationally efficient, it is not necessarily a good approximation. The need for EMT and its rather restrictive assumptions may be circumvented through a direct computation of the scattering properties via finite element methods, such as the discrete dipole approximation (DDA). Recently, the utility of the DDA method has been advanced significantly through improvements in theory, in numerical algorithms, and in computer hardware. Extensive calculations with the DDA method are used here to examine more directly the effects of porosity. A particular emphasis is placed upon developing a valid methodology. For both solid and porous targets we establish both numerical and physical convergence properties over the range of size parameter that is required for our study. DDA cross sections for grains with a range of porosity are compared to those computed by the EMT/series expansion technique to examine the applicability of several mixing rules, including two extensions of the Bruggeman rule. We show that for particles with Rayleigh vacuum inclusions, the extension proposed by Rouleau & Martin is quite successful. We also investigate the effects of larger, non-Rayleigh vacuum inclusions for various levels of porosity and find that they can be significant.

Wolff, Michael J.↗

Nonclassical Particle Transport in the 1-D Diffusive Limit

A nonclassical linear Boltzmann equation has been recently proposed to address nonexponential attenuation of the particle flux in certain inhomogeneous random media applications. In particular, this effect arises in Pebble Bed reactor cores, in which the locations of the pebbles are spatially correlated. In this paper, we investigate nonclassical particle transport taking place in a 1-D random periodic diffusive system. We provide computational results that validate the theoretical predictions, demonstrating for the first time that the solution of the nonclassical particle transport equation is well-approximated by the solution of the nonclassical diffusion equation. For simplicity, we consider the following assumptions: (i) transport occurs in rod geometry, in which particles can only move in the directions μ = ±1; (ii) transport is monoenergetic; and (iii) scattering is isotropic. This paper provides numerical results that demonstrate the validity of the nonclassical diffusion approximation to the nonclassical transport equation in certain 1-D diffusive systems. To our knowledge, this is the first time computational results that validate the predictions of the asymptotic theory for the nonclassical model are presented. This result provides a more solid foundation in which to improve this theory for relevant nuclear applications. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗