SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,729 records · Page 96

All sources NASA NTRS DOE OSTI

NASA NTRS2006

Approximations of distant retrograde orbits for mission design

Distant retrograde orbits (DROs) are stable periodic orbit solutions of the equations of motion in the circular restricted three body problem. Since no closed form expressions for DROs are known, we present methods for approximating a family of planar DROs for an arbitrary, fixed mass ratio. Furthermore we give methods for computing the first and second derivatives of the position and velocity with respect to the variables that parameterize the family. The approximation and derivative methods described allow a mission designer to target specific DROs or a range of DROs with no regard to phasing in contrast to the more limited case of targeting a six-state only.

Distant Retrograde Orbits (DRO)↗

NASA NTRS2010

A Test of Thick-Target Nonuniform Ionization as an Explanation for Breaks in Solar Flare Hard X-Ray Spectra

Solar nonthermal hard X-ray (HXR) flare spectra often cannot be fitted by a single power law, but rather require a downward break in the photon spectrum. A possible explanation for this spectral break is nonuniform ionization in the emission region. We have developed a computer code to calculate the photon spectrum from electrons with a power-law distribution injected into a thick-target in which the ionization decreases linearly from 100% to zero. We use the bremsstrahlung cross-section from Haug (1997), which closely approximates the full relativistic Bethe-Heitler cross-section, and compare photon spectra computed from this model with those obtained by Kontar, Brown and McArthur (2002), who used a step-function ionization model and the Kramers approximation to the cross-section. We find that for HXR spectra from a target with nonuniform ionization, the difference (Delta-gamma) between the power-law indexes above and below the break has an upper limit between approx.0.2 and 0.7 that depends on the power-law index delta of the injected electron distribution. A broken power-law spectrum with a. higher value of Delta-gamma cannot result from nonuniform ionization alone. The model is applied to spectra obtained around the peak times of 20 flares observed by the Ramaty High Energy Solar Spectroscopic Imager (RHESSI from 2002 to 2004 to determine whether thick-target nonuniform ionization can explain the measured spectral breaks. A Monte Carlo method is used to determine the uncertainties of the best-fit parameters, especially on Delta-gamma. We find that 15 of the 20 flare spectra require a downward spectral break and that at least 6 of these could not be explained by nonuniform ionization alone because they had values of Delta-gamma with less than a 2.5% probability of being consistent with the computed upper limits from the model. The remaining 9 flare spectra, based on this criterion, are consistent with the nonuniform ionization model.

Holman, gordon↗

DOE OSTI2026

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Iterative Stability Enforcement in Adaptive Antoulas–Anderson Algorithms for ${\boldsymbol{\mathcal{H}_2}}$ Model Reduction

This paper presents an extension of the Adaptive-Antoulas-Anderson (AAA) algorithm for rational modelling. Specifically, our new stable multi-input multi-output AAA (smiAAA) algorithm builds rational approximations of multi-input signals with a common set of stable poles. A new methodology is presented for iteratively enforcing stability constraints on the poles. We demonstrate the strengths of this approach compared to the stability enforcement in the FastAAA algorithm. Results using the smiAAA algorithm are compared with the commonly used Vector Fitting algorithm and the more recently published RKFIT algorithm. Vector Fitting and RKFIT both require the user to input the number of poles to use in the approximations. If the final approximation is not accurate enough, the user must re-start Vector Fitting or RKFIT with a larger number of poles and/or a new starting location for the poles. In contrast, the smiAAA algorithm is designed to allow the user to simply input the desired accuracy of the approximations, and the necessary number of poles is detected automatically. This permits users to produce approximations of a desired accuracy with no knowledge about the underlying order of the system being approximated, preventing the algorithm from ever needing to be rerun. An additional feature for preventing extraneous poles from being returned by AAA is also discussed. The cause of these extraneous poles is efficiently detected and removed by our presented methodology. In conclusion, the examples presented demonstrate that smiAAA can efficiently produce approximations of similar or better accuracy than Vector Fitting and RKFIT while requiring less input from the user.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Customizable adaptive regularization techniques for B-spline modeling

B-spline models are a powerful way to represent scientific data sets with a functional approximation. However, these models can suffer from spurious oscillations when the data to be approximated are not uniformly distributed. Model regularization (i.e., smoothing) has traditionally been used to minimize these oscillations; unfortunately, it is sometimes impossible to sufficiently remove unwanted artifacts without smoothing away key features of the data set. In this article, we present a method of model regularization that preserves significant features of a data set while minimizing artificial oscillations. Our method varies the strength of a smoothing parameter throughout the domain automatically, removing artifacts in poorly-constrained regions while leaving other regions unchanged. Further, the proposed method selectively incorporates regularization terms based on first and second derivatives to maintain model accuracy while minimizing numerical artifacts. The behavior of our method is validated on a collection of two- and three-dimensional data sets produced by scientific simulations. In addition, a key tuning parameter is highlighted and the effects of this parameter are presented in detail. This paper is an extension of our previous conference paper at the 2022 International Conference on Computational Science (ICCS) (Lenz et al., 2022).

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm

The trading of fidelity for scale enables approximate classical simulators such as matrix product states (MPSs) to run quantum circuits beyond exact methods. A control parameter, the so-called bond dimension $\mathcal{χ}$ for MPSs, governs the allocated computational resources and the output fidelity. Here, we characterize the fidelity for the quantum approximate optimization algorithm by the expectation value of the cost function that it seeks to minimize and find that it follows a scaling law $\mathscr{F}$(ln $\mathcal{χ}$/N), where N is the number of qubits. With ln $\mathcal{χ}$ amounting to the entanglement that a MPS can encode, we show that the relevant variable for investigating the fidelity is the entanglement per qubit. Importantly, our results calibrate the classical computational power required to achieve the desired fidelity and benchmark the performance of quantum hardware in a realistic setup. For instance, we quantify the hardness of performing better classically than a noisy superconducting quantum processor by readily matching its output to the scaling function. Moreover, we relate the global fidelity to that of individual operations and establish its relationship with $\mathcal{χ}$ and N. We sharpen the requirements for noisy quantum computers to outperform classical techniques at running a quantum optimization algorithm in speed, size, and fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1972

The employment of a spoken language computer applied to an air traffic control task.

Assessment of the merits of a limited spoken language (56 words) computer in a simulated air traffic control (ATC) task. An airport zone approximately 60 miles in diameter with a traffic flow simulation ranging from single-engine to commercial jet aircraft provided the workload for the controllers. This research determined that, under the circumstances of the experiments carried out, the use of a spoken-language computer would not improve the controller performance.

Laveson, J. I.↗

DOE OSTI2023

Even Faster Exact Exchange for Solids via Tensor Hypercontraction

Hybrid density functional theory (DFT) remains intractable for large periodic systems due to the demanding computational cost of exact exchange. We apply the tensor hypercontraction (THC) (or interpolative separable density fitting) approximation to periodic hybrid DFT calculations with Gaussian-type orbitals using the Gaussian plane wave approach. This is done to lower the computational scaling with respect to the number of basis functions (N) and k-points (N k ) at a fixed system size. Additionally, we propose an algorithm to fit only occupied orbital products via THC (i.e., a set of points, N ISDF ) to further reduce computation time and memory usage. This algorithm has linear scaling cost with k-points, no explicit dependence of N ISDF on basis set size, and overall cubic scaling with unit cell size. Significant speedups and reduced memory usage may be obtained for moderately sized k-point meshes, with additional gains for large k-point meshes. Adequate accuracy can be obtained using THC-oo-K for self-consistent calculations. In conclusion, we perform illustrative hybrid density function theory calculations on the benzene crystal in the basis set and thermodynamic limits to highlight the utility of this algorithm.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Accelerated steady-state electrostatic particle-in-cell simulation of Langmuir probes

First-principles particle-in-cell (PIC) simulation is a powerful tool for understanding plasma behavior, but this power often comes at great computational expense. Artificially reducing the ion/electron mass ratio is a time-honored practice to reduce simulation costs. Usually, this is a severe approximation. However, for steady-state collisionless, electrostatic (Vlasov–Poisson) systems, the solution with reduced mass ratio can be scaled to the solution for the real mass ratio, with no approximation. This “scaled mass” method, which works with already-existing PIC codes, can reduce the computation time for a large class of electrostatic PIC simulations by the square root of the mass ratio. The particle distributions of the resulting steady state must be trivially rescaled to yield the true distributions, but the self-consistent electrostatic field is independent of the mass ratio. This method is equivalent to “numerical timestepping,” an approach that evolves electron and ion populations with different time steps. Numerical timestepping can be viewed as a special case of the speed-limited PIC (SLPIC) method, which is not restricted to steady-state phenomena. Although the scaled-mass approach is simplest, numerical timestepping and SLPIC more easily generalize to include other effects, such as collisions. The equivalence of these new approaches is demonstrated by applying them to simulate a cylindrical Langmuir probe in electron–argon plasma, speeding up simulation by two orders of magnitude. Methods such as SLPIC can therefore play an invaluable role in interpreting probe measurements by including geometric effects, collisions, secondary emission, and non-Maxwellian distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Tomographic Sparse View Selection Using the View Covariance Loss

Standard computed tomography (CT) reconstruction algorithms such as filtered back projection (FBP) and Feldkamp-Davis-Kress (FDK) require many views for producing high-quality reconstructions, which can slow image acquisition and increase cost in non-destructive evaluation (NDE) applications. Over the past 20 years, a variety of methods have been developed for computing high-quality CT reconstructions from sparse views. However, the problem of how to select the best views for CT reconstruction remains open. In this paper, we present a novel view covariance loss (VCL) function that measures the joint information of a set of views by approximating the normalized mean squared error (NMSE) of the reconstruction. We present fast algorithms for computing the VCL along with an algorithm for selecting a subset of views that approximately minimizes its value. Our experiments on simulated and measured data indicate that for a fixed number of views our proposed view covariance loss selection (VCLS) algorithm results in reconstructions with lower NRMSE, fewer artifacts, and greater accuracy than current alternative approaches.

Lin, Jingsong [Purdue University]↗

DOE OSTI2023

Multilevel-in-width training for deep neural network regression

A common challenge in regression is that for many problems, the degrees of freedom required for a high-quality solution also allows for overfitting. Regularization is a class of strategies that seek to restrict the range of possible solutions so as to discourage overfitting while still enabling good solutions, and different regularization strategies impose different types of restrictions. In this paper, we present a multilevel regularization strategy that constructs and trains a hierarchy of neural networks, each of which has layers that are wider versions of the previous network's layers. Here, we draw intuition and techniques from the field of Algebraic Multigrid (AMG), traditionally used for solving linear and nonlinear systems of equations, and specifically adapt the Full Approximation Scheme (FAS) for nonlinear systems of equations to the problem of deep learning. Training through V-cycles then encourage the neural networks to build a hierarchical understanding of the problem. We refer to this approach as multilevel-in-width to distinguish from prior multilevel works which hierarchically alter the depth of neural networks. The resulting approach is a highly flexible framework that can be applied to a variety of layer types, which we demonstrate with both fully connected and convolutional layers. We experimentally show with PDE regression problems that our multilevel training approach is an effective regularizer, improving the generalize performance of the neural networks studied.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2022

Computing Sensitivities in Evolutionary Systems: A Real-time Reduced Order Modeling Strategy

We present a new methodology for computing sensitivities in evolutionary systems using a model-driven low-rank approximation. To this end, we formulate a variational principle that seeks to minimize the distance between the time derivative of the reduced approximation and sensitivity dynamics. The first order optimality condition of the variational principle leads to a system of closed form evolution equations for an orthonormal basis and corresponding sensitivity coefficients. This approach allows for the computation of sensitivities with respect to a large number of parameters in an accurate and tractable manner by extracting correlations between different sensitivities on the fly. The presented method requires solving forward evolution equations, sidestepping the restrictions imposed by the forward/backward workflow of adjoint sensitivities. For example, the presented method, unlike the adjoint equation, does not impose any input/output load and can be used in applications in which real-time sensitivities are of interest. We demonstrate the utility of the method for three test cases: (1) computing sensitivity with respect to model parameters in the Rössler system, (2) computing sensitivity with respect to an infinite-dimensional forcing parameter in the chaotic Kuramoto--Sivashinsky equation, and (3) computing sensitivity with respect to reaction parameters for species transport in a turbulent reacting flow.

Reduced order model↗

DOE OSTI2024

Three-dimensional simulations of magneto-inertial Magnetic-Direct-Drive targets

For the cylindrically symmetric targets that are normally fielded on the Z machine, two dimensional axisymmetric MHD simulations provide the backbone of our target design capability. These simulations capture the essential operation of the target and allow for a wide range of physics to be addressed at a substantially lower computational cost than 3D simulations. This approach, however, makes some approximations that may impact its ability to accurately provide insight into target operation. As an example, in 2D simulations, targets are able to stagnate directly to the axis in a way that is not entirely physical, leading to uncertainty in the impact of the dynamical instabilities that are an important source of degradation for ICF concepts. In this report, we have performed a series of 3D calculations in order to assess the importance of this higher fidelity treatment on MagLIF target performance.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2020

Analysis of Sample Acquisition Dynamics Using Discrete Element Method

The analysis presented in this paper is conducted in the framework of the Ocean Worlds Autonomy Testbed for Exploration Research and Simulation (OceanWATERS) project, currently under development at NASA Ames Research Center. OceanWATERS aims at designing a simulation environment which allows for testing autonomy of scientific lander missions to the icy moons of our solar system. Mainly focused on reproducing the end effector interaction with the inherent terrain, this paper introduces a novel discrete element method (DEM)-based approach to determine forces and torques acting on the lander’s scoop during the sample acquisition process. An accurate force feedback from the terrain on the scoop is required by fault-detection and autonomous decision-making algorithms to identify when the requested torque on the robotic arm’s joints exceeds the maximum available torque. Knowledge of the terrain force feedback significantly helps evaluating the arm’s links structural properties and properly selecting actuators for the joints. Models available in literature constitute a partial representation of the dynamics of the interaction. As an example, Balovnev derived an analytical expression of the vertical and horizontal force acting on a bucket while collecting a sample as a function of its geometry and velocity, soil parameters and reached depth. Although the model represents an adequate approximation of the two force components, it ignores the direction orthogonal to the scoop motion and neglects the torque. This work relies on DEM analysis to compensate for analytical models’ deficiencies and inaccuracies, i. e. provide force and torque 3D vectors, defined in the moving reference (body) frame attached to the scoop, at each instant of the sample collection process. Results from the first presented analysis relate to the specific OceanWATERS sampling strategy, which consists of collecting the sample through five consecutive passes with increasing depth, each pass following the same circularlinear- circular trajectory. Data is collected given a specific scoop design interacting with two types of bulk materials, which may characterize the surface of icy planetary bodies: snow and ice. Although specifically concerned with the OceanWATERS design, this first analysis provides the expected force trends for similar sampling strategies and allows to deduce phenomenological information about the general scooping process. In order to further instruct the community on the use of DEM tools as a solution to the sampling collection problem, two more analyses have been carried out, mainly focused on reducing the DEM computation time, which increases with a decrease in particle size. After running a set of identical simulations, where the only changing parameter is the size of the spherical particle, it is observed that the resulting force trajectories, starting from a given particle size, converge to the true trend. It is deducible that a further decrease in size yields negligible improvements in the accuracy, while it sensibly increases computation time. A final analysis aims at discussing limitations of approximating bulk material particles having a complex shape, e. g. ice fragments, with spheres, by comparing force trends resulting in the two cases for the same simulation scenario.

Catanoso, Damiana↗

NASA NTRS2002

Thermophysics Characterization of Multiply Ionized Air Plasma Absorption of Laser Radiation

The impact of multiple ionization of air plasma on the inverse Bremsstrahlung absorption of laser radiation is investigated for air breathing laser propulsion. Thermochemical properties of multiply ionized air plasma species are computed for temperatures up to 200,000 deg K, using hydrogenic approximation of the electronic partition function; And those for neutral air molecules are also updated for temperatures up to 50,000 deg K, using available literature data. Three formulas for absorption are calculated and a general formula is recommended for multiple ionization absorption calculation. The plasma composition required for absorption calculation is obtained by increasing the degree of ionization sequentially, up to quadruple ionization, with a series of thermal equilibrium computations. The calculated second ionization absorption coefficient agrees reasonably well with that of available data. The importance of multiple ionization modeling is demonstrated with the finding that area under the quadruple ionization curve of absorption is found to be twice that of single ionization. The effort of this work is beneficial to the computational plasma aerodynamics modeling of laser lightcraft performance.

Wang, Ten-See↗

DOE OSTI2022

Beyond quantum cluster theories: multiscale approaches for strongly correlated systems

The degrees of freedom that confer to strongly correlated systems their many intriguing properties also render them fairly intractable through typical perturbative treatments. For this reason, the mechanisms responsible for their technologically promising properties remain mostly elusive. Computational approaches have played a major role in efforts to fill this void. In particular, dynamical mean field theory and its cluster extension, the dynamical cluster approximation have allowed significant progress. However, despite all the insightful results of these embedding schemes, computational constraints, such as the minus sign problem in quantum Monte Carlo (QMC), and the exponential growth of the Hilbert space in exact diagonalization (ED) methods, still limit the length scale within which correlations can be treated exactly in the formalism. A recent advance aiming to overcome these difficulties is the development of multiscale many body approaches whereby this challenge is addressed by introducing an intermediate length scale between the short length scale where correlations are treated exactly using a cluster solver such QMC or ED, and the long length scale where correlations are treated in a mean field manner. At this intermediate length scale correlations can be treated perturbatively. This is the essence of multiscale many-body methods. Furthermore, we will review various implementations of these multiscale many-body approaches, the results they have produced, and the outstanding challenges that should be addressed for further advances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1990

Calculation of the binomial survivor function

A method is presented for calculating the binomial SF (cumulative binomial distribution), binfc(k;p,n), especially for a large n, beyond the range of existing tables, where conventional computer programs fail because of underflow and overflow, and Gaussian or Poisson approximations yield insufficient accuracy for the purpose at hand. This method is used to calculate and sum the individual binomial terms while using multiplication factors to avoid underflow; the factors are then divided out of the partial sum whenever it has the potential to overflow. A computer program uses this technique to calculate the binomial SF for arbitrary inputs of k, p, and n. Two other algorithms are presented to determine the value of p needed to yield a specified SF for given values of k and n and calculate the value where p = SF for a given k and n. Reliability applications of each algorithm/program are given, e.g., the value of p needed to achieve a stated k-out-of-n:G system reliability and the value of p for which k-out-of-n:G system reliability equals p.

Bowerman, Paul N.↗

DOE OSTI2022

Modelling and computational improvements to the simulation of single vector-boson plus jet processes for the ATLAS experiment

This paper presents updated Monte Carlo configurations used to model the production of single electroweak vector bosons (W, Z/γ$^{∗}$) in association with jets in proton-proton collisions for the ATLAS experiment at the Large Hadron Collider. Improvements pertaining to the electroweak input scheme, parton-shower splitting kernels and scale-setting scheme are shown for multi-jet merged configurations accurate to next-to-leading order in the strong and electroweak couplings. The computational resources required for these set-ups are assessed, and approximations are introduced resulting in a factor three reduction of the per-event CPU time without affecting the physics modelling performance. Continuous statistical enhancement techniques are introduced by ATLAS in order to populate low cross-section regions of phase space and are shown to match or exceed the generated effective luminosity. This, together with the lower per-event CPU time, results in a 50% reduction in the required computing resources compared to a legacy set-up previously used by the ATLAS collaboration. The set-ups described in this paper will be used for future ATLAS analyses and lay the foundation for the next generation of Monte Carlo predictions for single vector-boson plus jets production.[graphic not available: see fulltext]

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗