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 991 records · Page 55

An Adaptive Derivative-based Method for Function Approximation

To alleviate the high computational cost of large-scale multi-physics simulations to study the relationships between the model parameters and the outputs of interest, response surfaces are often used in place of the exact functional relationships. This report explores a method for response surface construction using adaptive sampling guided by derivative information at each selected sample point. This method is especially suitable for applications that can readily provide added information such as gradients and Hessian with respect to the input parameters under study. When higher order terms (third and above) in the Taylor series are negligible, the approximation error for this method can be controlled. We present details of the adaptive algorithm and numerical results on a few test problems.

99 GENERAL AND MISCELLANEOUS↗

Wedge sampling for computing clustering coefficients and triangle counts on large graphs

Graphs are used to model interactions in a variety of contexts, and there is a growing need to quickly assess the structure of such graphs. Some of the most useful graph metrics are based on triangles, such as those measuring social cohesion. Despite the importance of these triadic measures, algorithms to compute them can be extremely expensive. We discuss the method of wedge sampling. This versatile technique allows for the fast and accurate approximation of various types of clustering coefficients and triangle counts. Furthermore, these techniques are extensible to counting directed triangles in digraphs. Our methods come with provable and practical time-approximation tradeoffs for all computations. We provide extensive results that show our methods are orders of magnitude faster than the state of the art, while providing nearly the accuracy of full enumeration.

97 MATHEMATICS AND COMPUTING↗

Advanced Computing Annual Report 2023

In 2023, advanced computing saw the arrival of Kestrel, the National Renewable Energy Laboratory's (NREL's) newest high-performance computing (HPC) system. Kestrel will accelerate clean energy research at a pace and scale more than five times greater than Eagle, with approximately 44 petaflops of computing power. Kestrel's heterogeneous architecture - which includes both CPU-only and GPU-accelerated nodes - is designed to bring a much greater GPU capacity to EERE workloads compared to Eagle, enabling rapidly advancing applications in artificial intelligence and expanding research in new directions for computing. In Fiscal Year (FY) 2023, 333 projects utilized NREL's HPC system, advancing the U.S. Department of Energy's (DOE's) Office of Energy Efficiency and Renewable Energy (EERE) mission across 13 funding areas. Cross-disciplinary collaboration among researchers yielded more than 800 technical outputs, including 177 peer-reviewed journal articles in FY 2023. All this great work continues to advance the science of energy efficiency and renewable energy. This report highlights research that utilized HPC resources in FY 2023.

advanced computing↗

Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted sum optimization problems in data processing and machine learning and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance, and identify the most effective approximation depths for quantum add and quantum multiply within the given context. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze performance trends in our results and speculate on possible future development within this computational paradigm.

97 MATHEMATICS AND COMPUTING↗

Batch sequential designs for computer experiments

Computer models simulating a physical process are used in many areas of science. Due to the complex nature of these codes it is often necessary to approximate the code, which is typically done using a Gaussian process. In many situations the number of code runs available to build the Guassian process approximation is limited. When the initial design is small or the underlying response surface is complicated this can lead to poor approximations of the code output. In order to improve the fit of the model, sequential design strategies must be employed. In this paper we introduce two simple distance based metrics that can be used to augment an initial design in a batch sequential manner. In addition we propose a sequential updating strategy to an orthogonal array based Latin hypercube sample. We show via various real and simulated examples that the distance metrics and the extension of the orthogonal array based Latin hypercubes work well in practice.

97 MATHEMATICS AND COMPUTING↗

Use of a computer model in the understanding of erythropoietic control mechanisms

During an eight-week visit approximately 200 simulations using the computer model for the regulation of erythopoiesis were carries out in four general areas: with the human model simulating hypoxia and dehydration, evaluation of the simulation of dehydration using the mouse model. The experiments led to two considerations for the models. Firstly, a direct relationship between erythropoietin concentration and bone marrow sensitivity to the hormone and, secondly, a partial correction of tissue hypoxia prior to compensation by an increased hematocrit. This latter change in particular produced a better simuation of the effects of hypoxia on plasma erythropoietin concentrations.

Dunn, C. D. R.↗

MHRDRing Z-Pinches and Related Geometries: Four Decades of Computational Modeling Using Still Unconventional Methods

For approximately four decades, Z-pinches and related geometries have been computationally modeled using unique Alternating Direction Implicit (ADI) numerical methods. Computational results have provided illuminating and often provocative interpretations of experimental results. A number of past and continuing applications are reviewed and discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DIF3D-VARIANT 11.0: A Decade of Updates

The DIF3D code has been a workhorse of fast reactor analysis work at Argonne National Laboratory for over 30 years. In 1995, a transport option called VARIANT was added to DIF3D to improve the flux solutions for fast reactor problems. VARIANT performs nodal neutron transport calculations using PN or SPN theory in Cartesian and hexagonal two- and threedimensional geometries. Because of the computing capabilities at that time, VARIANT was restricted to 33 group P3 flux approximations with P1 scattering. Clearly computer memory capabilities have increased since then and thus large space-angle-energy approximations are possible. This manuscript serves as an update to the theory section of the original manual and details more than a decade worth of changes made to DIF3D to make DIF3D 11.0.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A vectorization of the Hess McDonnell Douglas potential flow program NUED for the STAR-100 computer

The computer program NUED for analyzing potential flow about arbitrary three dimensional lifting bodies using the panel method was modified to use vector operations and run on the STAR-100 computer. A high speed of computation and ability to approximate the body surface with a large number of panels are characteristics of NUEDV. The new program shows that vector operations can be readily implemented in programs of this type to increase the computational speed on the STAR-100 computer. The virtual memory architecture of the STAR-100 facilitates the use of large numbers of panels to approximate the body surface.

Boney, L. R.↗

Application of adaptive hierarchical sparse grid collocation to the uncertainty quantification of nuclear reactor simulators

Recent efforts in the application of uncertainty quantification to nuclear systems have utilized methods based on generalized perturbation theory and stochastic sampling. While these methods have proven to be effective they both have major drawbacks that may impede further progress. A relatively new approach based on spectral elements for uncertainty quantification is applied in this paper to several problems in reactor simulation. Spectral methods based on collocation attempt to couple the approximation free nature of stochastic sampling methods with the determinism of generalized perturbation theory. The specific spectral method used in this paper employs both the Smolyak algorithm and adaptivity by using Newton-Cotes collocation points along with linear hat basis functions. Using this approach, a surrogate model for the outputs of a computer code is constructed hierarchically by adaptively refining the collocation grid until the interpolant is converged to a user-defined threshold. The method inherently fits into the framework of parallel computing and allows for the extraction of meaningful statistics and data that are not within reach of stochastic sampling and generalized perturbation theory. This paper aims to demonstrate the advantages of spectral methods-especially when compared to current methods used in reactor physics for uncertainty quantification-and to illustrate their full potential. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Minimum fuel trajectories for round trip lunar missions

In this work, a study about minimum fuel trajectories in a round trip journey to the Moon is presented. It is assumed that the velocity changes are instantaneous, that is, the propulsion system is capable of delivering impulses such that the fuel consumption is represented by the total velocity increment applied to the space vehicle. It is also assumed that the velocity increments are applied tangentially to the terminal orbits, and, the outgoing trip and the return trip are analyzed separately such that the whole mission is performed with four impulses (two impulses in each trip). The mathematical models used to describe the motion of the space vehicle are three: the lunar patched-conic approximation; the classic planar circular restricted three-body problem, and, the planar bi-circular restricted four-body problem (PBR4BP). For computing the optimal trajectories, the Sequential Gradient-Restoration Algorithm with constraints is used. The influence of the Sun on round trip lunar missions is analyzed through the PBR4BP model. For all models, the trajectories studied are direct ascent maneuvers, and, both the outgoing and return trips are considered. The results obtained through the different models are compared with each other. The optimal results for the PBR4BP model show that a small reduction of the fuel consumption can be achieved if the initial phase angle of the Sun is chosen properly.

79 ASTRONOMY AND ASTROPHYSICS↗

Three-dimensional inelastic approximate analysis code (MOMM)

The Mechanics of Materials Model (MOMM) is one of a series of new stand-alone three dimensional nonlinear structural analysis codes. Incorporation of a general purpose finite element computer code into the hot section design process was severely limited by the high costs involved. MOMM is a stiffness method finite element code that uses an internally generated network of beams to characterize hot section component behavior. The method was proposed as a fast, easy to use, computationally efficient tool for approximate analyses. MOMM incorporates a wide variety of analysis capabilities, material models, and load type specifiers instrumental for the analysis of hot section components.

Meister, Jeffrey P.↗

Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition

This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Digital quantum magnetism on a trapped-ion quantum computer

Digital quantum matter—realized when discrete quantum gates approximate continuous time evolution—is susceptible to heating into chaotic, structureless states. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviours observed in equilibrium systems, ranging from the non-trivial microscopic origins of thermalization itself to the stabilization of effective models hosting exotic emergent properties. Here we use Quantinuum’s H2 quantum computer to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics owing to approximate energy conservation and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration. Furthermore, our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of 99.94(1)%) and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.

Information theory and computation↗

The compressed state Kalman filter for nonlinear state estimation: Application to large-scale reservoir monitoring

Reservoir monitoring aims to provide snapshots of reservoir conditions and their uncertainties to assist operation management and risk analysis. These snapshots may contain millions of state variables, e.g., pressures and saturations, which can be estimated by assimilating data in real time using the Kalman filter (KF). However, the KF has a computational cost that scales quadratically with the number of unknowns, m, due to the cost of computing and storing the covariance and Jacobian matrices, along with their prod-ucts. The compressed state Kalman filter (CSKF) adapts the KF for solving large-scale monitoring problems. The CSKF uses N preselected orthogonal bases to compute an accurate rank-N approximation of the covari-ance that is close to the optimal spectral approximation given by SVD. The CSKF has a computational cost that scales linearly in m and uses an efficient matrix-free approach that propagates uncertainties using N + 1 forward model evaluations, where N << m. Here in this paper we present a generalized CSKF algorithm for nonlin-ear state estimation problems such as CO 2 monitoring. For simultaneous estimation of multiple types of state variables, the algorithm allows selecting bases that represent the variability of each state type. Through synthetic numerical experiments of CO 2 monitoring, we show that the CSKF can reproduce the Kal-man gain accurately even for large compression ratios (m/N). For a given computational cost, the CSKF uses a robust and flexible compression scheme that gives more reliable uncertainty estimates than the ensemble Kalman filter, which may display loss of ensemble variability leading to suboptimal uncertainty estimates.

97 MATHEMATICS AND COMPUTING↗

Parameterization of the Stoner-Wohlfarth model of magnetic hysteresis

The Stoner-Wohlfarth (SW) is the most used model of magnetic hysteresis, but its computation is time-consuming. We approximate piecewise this model by easy-to-compute analytic functions. Overall, our parametrization is suitable for fast quantitative evaluations and fitting experimental data, which we exemplify. Applicability of this parametrization is as broad as that of the SW model, which can be extended to include more parameters.

36 MATERIALS SCIENCE↗

Analysis of picosecond coherent anti-Stokes Raman spectra for gas-phase diagnostics

We present a hybrid frequency- and time-domain solution, applicable to the case of picosecond coherent anti-Stokes Raman scattering (CARS), for gas-phase diagnostics. A solution has been derived based on both physical arguments and four-wave mixing equations for picosecond CARS, with pulse durations that are comparable to the dephasing time scale for gas-phase Raman coherence—a regime where commonly employed solutions for impulsive (femtosecond) or cw (nanosecond) pump/Stokes forcing are not strictly valid. We present the ps-CARS spectrum in the form of incoherent sums of CARS intensity spectra, calculated from the fundamental solution for impulsive pump/Stokes Raman preparation. The solution was examined for temperatures from 1000–3000 K, for four plausible experimental configurations, with laser pulse durations of 50–150 ps, and probe pulse delays from −20 to 240 ps. Approximations based on cw and impulsive pump/Stokes preparation to fit picosecond CARS spectra at atmospheric pressure were examined and the relative thermometric accuracy and computational cost of these approximations were quantified for the case of a zero nonresonant CARS contribution, and a nonresonant susceptibility equal to 10% of the Raman-resonant value at the N 2 bandhead. The nanosecond CARS approximation can result in large fitting errors when the probe pulse time delay is less than the probe pulse duration. Errors as large as 10–20% are observed in the fit temperatures for a zero picosecond probe pulse delay, when the nonresonant background is neglected, largely due to an inability of the time-independent cw model to capture transient frequency spread dephasing effects at the Q -branch bandhead. The inclusion of a nonresonant background results in 40–60% thermometry errors with a nanosecond model at a zero-probe delay. Time-dependent impulsive calculations used for femtosecond CARS better approximate the structure of the N 2 bandhead, reducing temperature fitting errors to 5–10% at a short probe pulse delay. The impulsive approximation results in errors up to 10% at intermediate probe pulse delays, where the coherence of the pump and probe pulses leads to multiple terms in the picosecond CARS solution. Both approximations improve as the probe pulse delay exceeds the probe duration. The nanosecond approximation results in a 2–3% error, while the impulsive model results in differences of less than 1% in some cases. Fits to experimental data obtained using short, ∼60ps pulses at a zero probe time delay and longer 100 ps pulses at a substantial 200 ps delay are presented with accuracies of 1–3% in the fit temperature.

Kearney, Sean P.↗

Fission Matrix Capability for MCNP Monte Carlo

In a Monte Carlo criticality calculation, before the tallying of quantities can begin, a converged fission source (the fundamental eigenvector of the fission kernel) is required. Tallies of interest may include powers, absorption rates, leakage rates, or the multiplication factor (the fundamental eigenvalue of the fission kernel, k eff ). Just as in the power iteration method of linear algebra, if the dominance ratio (the ratio of the first and zeroth eigenvalues) is high, many iterations of neutron history simulations are required to isolate the fundamental mode of the problem. Optically large systems have large dominance ratios, and systems containing poor neutron communication between regions are also slow to converge. The fission matrix method, implemented into MCNP, addresses these problems.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗