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 883 records · Page 49

Simulating noncontact atomic force microscopy images

A scanning probe with an atomically sharp tip is used in atomic force microscopy. As the probe is rastered over the specimen of interest, changes in its vibration mode can be ascribed to changes in the interatomic forces between the specimen and the tip. Various modes for implementing atomic force measures exist. One of the most successful modes is frequency-modulation noncontact atomic force microscopy. Here we address the role of replicating accurate forces on the probe tip to simulate images within this mode. In this work, we examine several approaches. One involves the use of classical force fields based on interatomic potentials, where the potentials are often fit to experiment. Other approaches center on the use of forces generated from quantum-based calculations. We consider the development of a “virtual tip” approximation wherein the probe tip senses electrostatic forces generated by the specimen. This approach treats the specimen quantum mechanically, while the tip is treated as a classical object. We also consider the use of an embedding approximation to avoid direct computations of the specimen in the presence of the tip. In this method, the tip and specimen are treated quantum mechanically. However, the electronic structure of the specimen is computed in the absence of the probe tip. The electronic density of the specimen is then fixed and the electronic structure of the tip is then computed in the presence of the fixed density. As a general approach, we outline new methods for the full computation of quantum forces between the tip and specimen. We note that quantum-based forces are particularly important as they directly contain the chemical nature of the forces present without the use of any adjustable parameters. We illustrate recent algorithmic developments to computing quantum forces that can produce accurate simulations of atomic force microscopy images for large and complex molecular species. We also suggest new pathways to overcome current challenges in this rapidly evolving field.

36 MATERIALS SCIENCE↗

Accuracy Guarantees and Quantum Advantage in Analog Open Quantum Simulation with and without Noise

Many-body open quantum systems, described by Lindbladian master equations, are a rich class of physical models that display complex equilibrium and out-of-equilibrium phenomena which remain to be understood. In this paper, we theoretically analyze noisy analog quantum simulation of geometrically local open quantum systems and provide evidence that this problem both is hard to simulate on classical computers and could be approximately solved on near-term quantum devices. First, given a noiseless quantum simulator, we show that the dynamics of local observables and the fixed-point expectation values of rapidly mixing local observables in geometrically local Lindbladians can be obtained to a precision of ϵ in time that is poly ( ϵ − 1 ) and uniform in system size. Furthermore, we establish that the quantum simulator would provide a superpolynomial advantage, in run-time scaling with respect to the target precision and either the evolution time (when simulating dynamics) or the Lindbladian’s decay rate (when simulating fixed points), over any classical algorithm for these problems, assuming BQP ≠ BPP . We then consider the presence of noise in the quantum simulator in the form of additional geometrically local Lindbladian terms. We show that the simulation tasks considered in this paper are stable to errors; i.e., they can be solved to a noise-limited, but system-size independent, precision. Finally, we establish that, assuming BQP ≠ BPP , there are stable geometrically local Lindbladian simulation problems such that, as the noise rate on the simulator is reduced, classical algorithms must take time superpolynomially longer in the inverse noise rate to attain the same precision as the analog quantum simulator. Published by the American Physical Society 2025

Kashyap, Vikram (ORCID:0000000208195207)↗

Scalable Prediction of Energy Consumption using Incremental Time Series Clustering

Time series datasets are a canonical form of high velocity Big Data, and often generated by pervasive sensors, such as found in smart infrastructure. Performing predictive analytics on time series data can be computationally complex, and requires approximation techniques. In this paper, we motivate this problem using a real application from the smart grid domain. We propose an incremental clustering technique, along with a novel affinity score for determining cluster similarity, which help reduce the prediction error for cumulative time series within a cluster. We evaluate this technique, along with optimizations, using real datasets from smart meters, totaling ~700,000 data points, and show the efficacy of our techniques in improving the prediction error of time series data within polynomial time.

Simmhan, Yogesh↗

Progressive Tree-Based Compression of Large-Scale Particle Data

Scientific simulations and observations using particles have been creating large datasets that require effective and efficient data reduction to store, transfer, and analyze. However, current approaches either compress only small data well while being inefficient for large data, or handle large data but with insufficient compression. Toward effective and scalable compression/decompression of particle positions, we introduce new kinds of particle hierarchies and corresponding traversal orders that quickly reduce reconstruction error while being fast and low in memory footprint. Our solution to compression of large-scale particle data is a flexible block-based hierarchy that supports progressive, random-access, and error-driven decoding, where error estimation heuristics can be supplied by the user. For low-level node encoding, we introduce new schemes that effectively compress both uniform and densely structured particle distributions. Our proposed methods thus target all three phases of a tree-based particle compression pipeline, namely tree construction, tree traversal, and node encoding. In conclusion, the improved efficacy and flexibility of these methods over existing compressors are demonstrated through extensive experimentation, using a wide range of scientific particle datasets.

97 MATHEMATICS AND COMPUTING↗

MO-C-17A-03: A GPU-Based Method for Validating Deformable Image Registration in Head and Neck Radiotherapy Using Biomechanical Modeling

Purpose: Deformable image registration (DIR) plays a pivotal role in head and neck adaptive radiotherapy but a systematic validation of DIR algorithms has been limited by a lack of quantitative high-resolution groundtruth. We address this limitation by developing a GPU-based framework that provides a systematic DIR validation by generating (a) model-guided synthetic CTs representing posture and physiological changes, and (b) model-guided landmark-based validation. Method: The GPU-based framework was developed to generate massive mass-spring biomechanical models from patient simulation CTs and contoured structures. The biomechanical model represented soft tissue deformations for known rigid skeletal motion. Posture changes were simulated by articulating skeletal anatomy, which subsequently applied elastic corrective forces upon the soft tissue. Physiological changes such as tumor regression and weight loss were simulated in a biomechanically precise manner. Synthetic CT data was then generated from the deformed anatomy. The initial and final positions for one hundred randomly-chosen mass elements inside each of the internal contoured structures were recorded as ground truth data. The process was automated to create 45 synthetic CT datasets for a given patient CT. For instance, the head rotation was varied between +/− 4 degrees along each axis, and tumor volumes were systematically reduced up to 30%. Finally, the original CT and deformed synthetic CT were registered using an optical flow based DIR. Results: Each synthetic data creation took approximately 28 seconds of computation time. The number of landmarks per data set varied between two and three thousand. The validation method is able to perform sub-voxel analysis of the DIR, and report the results by structure, giving a much more in depth investigation of the error. Conclusions: We presented a GPU based high-resolution biomechanical head and neck model to validate DIR algorithms by generating CT equivalent 3D volumes with simulated posture changes and physiological regression.

60 APPLIED LIFE SCIENCES↗

LiMnO2 polymorphs

Energies of LiMnO2 polymorphs computed within various DFT approximations

36 MATERIALS SCIENCE↗

GLUE Code: A framework handling communication and interfaces between scales

Many scientific applications are inherently multiscale in nature. Such complex physical phenomena often require simultaneous execution and coordination of simulations spanning multiple time and length scales. This is possible by combining expensive small-scale simulations (such as molecular dynamics simulations) with larger scale simulations (such continuum limit/hydro solvers) to allow for considerably larger systems using task and data parallelism. However, the granularity of the tasks can be very large and often leads to load imbalance. Traditionally, we use approximations to streamline the computation of the more costly interactions and this introduces trade-offs between simulation cost and accuracy. In recent years, the available computational power and the advances in machine learning have made computing these scale-bridging interactions and multiscale simulations more feasible. One driving application has been plasma modeling in inertial confinement fusion (ICF), which is fundamentally multiscale in nature. This requires deep understanding of how to extrapolate microscopic information into macroscopically relevant scales. For example, in ICF one needs an accurate understanding of the connection between experimental observables and the underlying microphysics. The properties of the larger scales are often affected by the microscale behavior incorporated usually into the equations of state and ionic and electronic transport coefficients (Liboff, 1959; Rinderknecht et al., 2014; Rosenberg et al., 2015; Ross et al., 2017). Instead of incorporating this information using reliable molecular dynamics (MD) simulations, one often needs to use theoretical models, due to the inability of MD to reach engineering scales (Glosli et al., 2007; Marinak et al., 1998). One approach to resolve this issue is by coupling two MD simulations of different scales via force interpolation, e.g., the AdResS method (Krekeler et al., 2018; Nagarajan et al., 2013). Another approach, which we will pursue in the scope of this work, is by enabling scale bridging between MD simulations and meso/macro-scale models through the development and support of application programming interfaces that these different applications can interact through.

54 ENVIRONMENTAL SCIENCES↗

Adaptive multi-index collocation for uncertainty quantification and sensitivity analysis

In this paper, we present an adaptive algorithm to construct response surface approximations of high-fidelity models using a hierarchy of lower fidelity models. Our algorithm is based on multiindex stochastic collocation and automatically balances physical discretization error and response surface error to construct an approximation of model outputs. This surrogate can be used for uncertainty quantification (UQ) and sensitivity analysis (SA) at a fraction of the cost of a purely high-fidelity approach. We demonstrate the effectiveness of our algorithm on a canonical test problem from the UQ literature and a complex multi-physics model that simulates the performance of an integrated nozzle for an unmanned aerospace vehicle. We find that when the input-output response is sufficiently smooth our algorithm produces approximations that can be up to orders of magnitude more accurate than single fidelity approximations for a fixed computational budget.

97 MATHEMATICS AND COMPUTING↗

Phase-curve Pollution of Exoplanet Transit Depths

The next generation of space telescopes will enable transformative science to understand the nature and origin of exoplanets. In particular, transit spectroscopy will reveal the chemical composition of the exoplanet atmospheres with unprecedented detail thanks to precise measurements of the visible-to-infrared transit depths down to 10 parts per million. Such a level of instrumental precision raises the challenge to obtain even more precise astrophysical models so as not to significantly influence the interpretation of the observed data. We must therefore critically revisit some of the commonly accepted assumptions that were adequate for analyzing past and current observations. A common approximation in the analysis of exoplanetary primary transits is that the planet does not contribute to the recorded flux, so-called dark planet hypothesis. In this paper, we investigate the impact of the dark planet hypothesis on the parameters obtained from the analysis of transits with particular attention to the transit depth. We develop mathematical formulae and release new software to estimate the magnitude of the potential bias. These tools will be useful in the preparation of observing proposals, as well as within the scientific consortia of the James Webb Space Telescope (JWST) and the Atmospheric Remote-sensing Infrared Exoplanet Large-survey (ARIEL) missions. We probe the accuracy of the mathematical formulae through the analysis of synthetic observations with the JWST Mid-InfraRed Instrument. We find that self-blending from nightside emission attenuates the transit depth by >3σ for some of the known exoplanet systems, in agreement with previous work. An additional unreported effect caused by the nightside rotating into view can also impart a significant effect, but in the opposite direction (increasing the transit depth); this effect can largely be removed with conventional detrending practices, at the expense of a slight increase in noise, and mixing astrophysical variations and instrumental drifts.

79 ASTRONOMY AND ASTROPHYSICS↗

Constraints on the Emission of Gamma-Rays from M31 with HAWC

Cosmic rays, along with stellar radiation and magnetic fields, are known to make up a significant fraction of the energy density of galaxies such as the Milky Way. When cosmic rays interact in the interstellar medium, they produce gamma-ray emission which provides an important indication of how the cosmic rays propagate. Gamma rays from the Andromeda Galaxy (M31), located 785 kpc away, provide a unique opportunity to study cosmic-ray acceleration and diffusion in a galaxy with a structure and evolution very similar to the Milky Way. Using 33 months of data from the High Altitude Water Cherenkov Observatory, we search for TeV gamma rays from the galactic plane of M31. We also investigate past and present evidence of galactic activity in M31 by searching for Fermi Bubble-like structures above and below the galactic nucleus. No significant gamma-ray emission is observed, so we use the null result to compute upper limits on the energy density of cosmic rays $>10$ TeV in M31. In conclusion, the computed upper limits are approximately ten times higher than expected from the extrapolation of the Fermi LAT results.

79 ASTRONOMY AND ASTROPHYSICS↗

Threshold progressions in covering and packing contexts

Here, using standard methods (due to Janson, Stein–Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a family of objects $\mathcal{A}$ being “covered” by at most one object in a random collection $\mathcal{C}$, to being covered at most λ times, to being covered at least once, to being covered at least λ times, a hierarchy of thresholds emerge. We will use examples from extremal set theory, combinatorics, and additive number theory to see how these results vary according to the context, and level of dependence introduced.

97 MATHEMATICS AND COMPUTING↗

Evader Interdiction and Collateral Damage

In network interdiction problems, evaders (hostile agents or data packets) are moving through a network towards their targets and we wish to choose sensor placement locations in order to intercept them before they reach their destinations. Sensor locations should be chosen economically, balancing security gains with cost, including the inconvenience sensors inflict upon innocent travelers. We give optimal sensor allocation algorithms for several classes of special graphs and hardness and optimal approximation results for general graphs, including for deterministic or Markov chain-based and oblivious or reactive evaders. In a similar-sounding but much different problem setting posed by [10] where the innocent travelers can also be reactive, we again give optimal algorithms for special cases and hardness and (essentially) optimal approximation results on general graphs.

ALGORITHMS↗

Pedestal Fueling Simulations with a Coupled Kinetic-kinetic Plasma-neutral Transport Code

A Monte Carlo neutral transport routine, based on DEGAS2, has been coupled to the guiding center ion-electron-neutral neoclassical PIC code XGC0 to provide a realistic treatment of neutral atoms and molecules in the tokamak edge plasma. The DEGAS2 routine allows detailed atomic physics and plasma-material interaction processes to be incorporated into these simulations. The spatial pro le of the neutral particle source used in the DEGAS2 routine is determined from the uxes of XGC0 ions to the material surfaces. The kinetic-kinetic plasma-neutral transport capability is demonstrated with example pedestal fueling simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimization of Depletion Modeling and Simulation for the High Flux Isotope Reactor

Monte Carlo based depletion tools used for the high-fidelity modeling and simulation of the High Flux Isotope Reactor (HFIR) come at a great computational cost; finding sufficient approximations is necessary to make the use of these tools feasible. The optimization of the neutronics and depletion model for the HFIR is based on two factors: (i) the explicit representation of the involute fuel plates with sets of polyhedra and (ii) the treatment of depletion mixtures and control element position during depletion calculations. A very fine representation (i.e., more polyhedra in the involute plate approximation) does not significantly improve simulation accuracy. The recommended representation closely represents the physical plates and ensures sufficient fidelity in regions with high flux gradients. Including the fissile targets in the central flux trap of the reactor as depletion mixtures has the greatest effect on the calculated cycle length, while localized effects (e.g., the burnup of specific isotopes or the power distribution evolution over the cycle) are more noticeable consequences of including a critical control element search or depleting burnable absorbers outside the fuel region.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Parameter distribution mapping in a gas turbine engine

A profile map of parameter values in a region is determined based on average values along linear paths through the region. In one example, a temperature map of a region of a gas turbine engine is created based on time-of-flight measurements from acoustic transceiver pairs arranged circumferentially around the region. A speed of sound for each transceiver pair is determined based on the time-of-flight measurements. An average temperature along each path is estimated from the time of flight, and the profile map is computed from the average temperatures. The profile map may be computed using a polynomial approximation technique, a grid optimization technique or a basis function technique.

42 ENGINEERING↗

Impact of Spatial Discretization on Reactivity Biases in Depleted TRIGA Fuel

Ongoing work at Kansas State University (KSU) and the University of Wisconsin involves the determination of fuel compositions in TRIGA reactors. Modeling of depletion requires a number of approximations to be made, which often includes selection of an appropriate spatial discretization for tracking material evolution in time. Incorporation of temperature feedback also requires such spatial zoning. Any approximation made leads to computational biases, i.e., differences between computed and accurate values of some parameter of interest. The objective of this study is to understand the potential magnitude of biases introduced by the selected spatial discretization. Specifically, biases in the reactivity of a square-pitch unit cell representative of a typical TRIGA fuel element were studied as a function of burnup for different radial and axial discretizations. Temperature effects were also studied by introducing a fixed, radial temperature profile. The results indicate a very fine radial discretization (> 10 radial regions) may be needed to eliminate biases (of statistical significance) from temperature feedback effects, while an axial discretization of {approx_equal}7 regions may be sufficient to eliminate biases due to evolution of the fuel composition. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗