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 955 records · Page 53

GENERALIZATION OF THE LAST SCATTERING APPROXIMATION FOR THE SECOND SOLAR SPECTRUM MODELING: THE Ca I 4227 A LINE AS A CASE STUDY

To model the second solar spectrum (the linearly polarized spectrum of the Sun that is due to coherent scattering processes), one needs to solve the polarized radiative transfer (RT) equation. For strong resonance lines, partial frequency redistribution (PRD) effects must be accounted for, which make the problem computationally demanding. The 'last scattering approximation' (LSA) is a concept that has been introduced to make this highly complex problem more tractable. An earlier application of a simple LSA version could successfully model the wings of the strong Ca I 4227 A resonance line in Stokes Q/I (fractional linear polarization), but completely failed to reproduce the observed Q/I peak in the line core. Since the magnetic field signatures from the Hanle effect only occur in the line core, we need to generalize the existing LSA approach if it is to be useful for the diagnostics of chromospheric and turbulent magnetic fields. In this paper, we explore three different approximation levels for LSA and compare each of them with the benchmark represented by the solution of the full polarized RT, including PRD effects. The simplest approximation level is LSA-1, which uses the observed center-to-limb variation of the intensity profile to obtain the anisotropy of the radiation field at the surface, without solving any transfer equation. In contrast, the next two approximation levels use the solution of the unpolarized transfer equation to derive the anisotropy of the incident radiation field and use it as an input. In the case of LSA-2, the anisotropy at level {tau}{sub {lambda}} = {mu}, the atmospheric level from which an observed photon is most likely to originate, is used. LSA-3, on the other hand, makes use of the full depth dependence of the radiation anisotropy. The Q/I formula for LSA-3 is obtained by keeping the first term in a series expansion of the Q-source function in powers of the mean number of scattering events. Computationally, LSA-1 is 21 times faster than LSA-2, which is 5 times faster than the more general LSA-3, which itself is 8 times faster than the polarized RT approach. A comparison of the calculated Q/I spectra with the RT benchmark shows excellent agreement for LSA-3, including good modeling of the Q/I core region with its PRD effects. In contrast, both LSA-1 and LSA-2 fail to model the core region. The RT and LSA-3 approaches are then applied to model the recently observed Q/I profile of the Ca I 4227 A line in quiet regions of the Sun. Apart from a global scale factor both give a very good fit to the Q/I spectra for all the wavelengths, including the core peak and blend line depolarizations. We conclude that LSA-3 is an excellent substitute for the full polarized RT and can be used to interpret the second solar spectrum, including the Hanle effect with PRD. It also allows the techniques developed for unpolarized three-dimensional RT to be applied to the modeling of the second solar spectrum.

79 ASTRONOMY AND ASTROPHYSICS↗

Nonlinear elasticity with the Shifted Boundary Method

Here, we propose a new unfitted/immersed computational framework for nonlinear solid mechanics, which bypasses the complexities associated with the generation of CAD representations and subsequent body-fitted meshing. This approach allows to speed up the cycle of design and analysis in complex geometry and requires relatively simple computer graphics representations of the surface geometries to be simulated, such as the Standard Tessellation Language (STL format). Complex data structures and integration on cut elements are avoided by means of an approximate boundary representation and a modification (shifting) of the boundary conditions to maintain optimal accuracy. An extensive set of computational experiments in two and three dimensions is included.

97 MATHEMATICS AND COMPUTING↗

Randomized methods to characterize large-scale vortical flow networks

We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.

97 MATHEMATICS AND COMPUTING↗

Massively parallel and universal approximation of nonlinear functions using diffractive processors

Nonlinear computation is essential for a wide range of information processing tasks, yet implementing nonlinear functions using optical systems remains a challenge due to the weak and power-intensive nature of optical nonlinearities. Overcoming this limitation without relying on nonlinear optical materials could unlock unprecedented opportunities for ultrafast and parallel optical computing systems. Here, we demonstrate that large-scale nonlinear computation can be performed using linear optics through optimized diffractive processors composed of passive phase-only surfaces. In this framework, the input variables of nonlinear functions are encoded into the phase of an optical wavefront—e.g., via a spatial light modulator (SLM)—and transformed by an optimized diffractive structure with spatially varying point-spread functions to yield output intensities that approximate a large set of unique nonlinear functions–all in parallel. We provide proof establishing that this architecture serves as a universal function approximator for an arbitrary set of bandlimited nonlinear functions, also covering wavelength-multiplexed nonlinear functions as well as multi-variate and complex-valued functions that are all-optically cascadable. Our analysis also indicates the successful approximation of typical nonlinear activation functions commonly used in neural networks, including the sigmoid, tanh, ReLU (rectified linear unit), and softplus. We numerically demonstrate the parallel computation of one million distinct nonlinear functions, accurately executed at wavelength-scale spatial density at the output of a diffractive optical processor. Furthermore, we experimentally validated this framework using in situ optical learning and approximated 35 unique nonlinear functions in a single shot using a compact setup consisting of an SLM and an image sensor. These results establish diffractive optical processors as a scalable platform for massively parallel universal nonlinear function approximation, paving the way for new capabilities in analog optical computing based on linear materials.

Rahman, Md Sadman Sakib [University of California,↗

MCML: Combining physical constraints with experimental data for a multi-purpose meta-generalized gradient approximation

The predictive power of density functional theory for materials properties can be improved without increasing the overall computational complexity by extending the generalized gradient approximation (GGA) for electronic exchange and correlation to density functionals depending on the electronic kinetic energy density in addition to the charge density and its gradient, resulting in a meta-GGA. Here, we propose an empirical meta-GGA model that is based both on physical constraints and on experimental and quantum chemistry reference data. Overall, the resulting optimized meta-GGA MCML yields improved surface and gas phase reaction energetics without sacrificing the accuracy of bulk property predictions of existing meta-GGA approaches.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Provable bounds for noise-free expectation values computed from noisy samples

Quantum computing has emerged as a powerful computational paradigm capable of solving problems beyond the reach of classical computers. However, today’s quantum computers are noisy, posing challenges to obtaining accurate results. Here, we explore the impact of noise on quantum computing, focusing on the challenges in sampling bit strings from noisy quantum computers and the implications for optimization and machine learning. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the conditional value at risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on real quantum computers involving up to 127 qubits. The results show strong alignment with theoretical predictions.

97 MATHEMATICS AND COMPUTING↗

Quantum mechanical calculation of the collision-induced absorption spectra of N{sub 2}–N{sub 2} with anisotropic interactions

We present quantum mechanical calculations of the collision-induced absorption spectra of nitrogen molecules, using ab initio dipole moment and potential energy surfaces. Collision-induced spectra are first calculated using the isotropic interaction approximation. Then, we improve upon these results by considering the full anisotropic interaction potential. We also develop the computationally less expensive coupled-states approximation for calculating collision-induced spectra and validate this approximation by comparing the results to numerically exact close-coupling calculations for low energies. Angular localization of the scattering wave functions due to anisotropic interactions affects the line strength at low energies by two orders of magnitude. The effect of anisotropy decreases at higher energy, which validates the isotropic interaction approximation as a high-temperature approximation for calculating collision-induced spectra. Agreement with experimental data is reasonable in the isotropic interaction approximation, and improves when the full anisotropic potential is considered. Calculated absorption coefficients are tabulated for application in atmospheric modeling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithm to extract direction in 2D discrete distributions and a continuous Frobenius norm

In this study, we present a novel algorithm for determining directionality in 2D distributions of discrete data. We compare a reference dataset with a known direction to a measured dataset with an unknown direction by the Frobenius norm of the difference (FND) to find the unknown direction. To generalize this concept, we develop a continuous Frobenius norm of the difference (CFND) as a continuous analog of the FND and derive its analytical expression. By relating fitted and normalized 2D Gaussian distributions, we show that the CFND approximates the FND, and we validate this relationship with computer simulations. We find that a first-order approximation of the CFND between two similar Gaussian distributions takes the form of an absolute sine function, offering a simple analytical form with potential applications in specialized areas such as segmented inverse beta decay neutrino detectors, astronomy, machine learning, and more. Our methodology consists of modeling a 2D Gaussian distribution, binning the data into a histogram, and encoding it as a square matrix. Rotating this matrix around its geometric center and comparing it to a measured dataset using the FND gives us rotational data that we fit with an absolute sine function. The location of the minimum of this fit is the angle closest to the true angle of the direction in the measured dataset. We present the derivation and discuss initial applications of the CFND in our novel algorithm, demonstrating its success in approximating directionality in 2D distributions.

Physics↗

Algorithm to extract direction in 2D discrete distributions and a continuous Frobenius norm

In this study, we present a novel algorithm for determining directionality in 2D distributions of discrete data. We compare a reference dataset with a known direction to a measured dataset with an unknown direction by the Frobenius norm of the difference (FND) to find the unknown direction. To generalize this concept, we develop a continuous Frobenius norm of the difference (CFND) as a continuous analog of the FND and derive its analytical expression. By relating fitted and normalized 2D Gaussian distributions, we show that the CFND approximates the FND, and we validate this relationship with computer simulations. We find that a first-order approximation of the CFND between two similar Gaussian distributions takes the form of an absolute sine function, offering a simple analytical form with potential for specialized applications in segmented inverse beta decay (IBD) neutrino detectors, astronomy, machine learning, and more. Although this method may easily extend to 3D scalar fields, our focus here is on 2D real-valued fields as it directly applies to directionality. Our methodology consists of modeling a 2D Gaussian distribution, binning the data into a histogram, and encoding it as a square matrix. Rotating this matrix around its geometric center and comparing it to a measured dataset using the FND gives us rotational data that we fit with an absolute sine function. The location of the minimum of this fit is the angle closest to the true angle of the direction in the measured dataset. We present the derivation and discuss initial applications of the CFND in our novel algorithm, demonstrating its success in approximating directionality in 2D distributions.

Data Analysis, Statistics and Probability (physics↗

𝜂 and 𝜂′ meson production in 𝐽/𝜓 radiative decays from lattice QCD

We report on the computation of amplitudes describing the radiative decay processes 𝐽/𝜓 →𝛾⁢𝜂 and 𝐽/𝜓 →𝛾⁢𝜂′ from first principles via lattice quantum chromodynamics (QCD). Using lattices with two heavier than physical degenerate flavors of light quark where 𝑚 𝜋 ∼391 MeV, and a strange quark tuned to approximately the physical value, we compute three-point correlation functions using optimized meson operators with a range of momenta. The use of optimized operators allows access to the 𝜂′, even though it appears as an excited state, lying above the ground-state 𝜂 in the isoscalar pseudoscalar channel. Statistically precise signals are obtained in this disconnected process by averaging over large numbers of kinematically equivalent correlators. We determine transition form factors as a function of photon virtuality across the timelike region, which describe also the Dalitz processes 𝐽/𝜓 →𝑒 + ⁢𝑒 − ⁢𝜂 (′) . Significantly lower magnitudes of transition form factor for both the 𝜂 and 𝜂′ are found than those extracted from experimental data, and possible explanations for this observation are presented.

form factors↗

Intrusive analysis for NEK5000: development of intrusive uncertainty quantification for high-dimensional, high-fidelity codes.

We study the use of lower-fidelity training data for uncertainty quantification of complex simulation models. In our approach, computationally expensive full-model outputs are approximated applying proper orthogonal-decomposition-based dimensionality reduction to the full model. A Gaussian-processes-based machine learning approach is then used to model the difference (or, rather, the correspondence) between the higher-fidelity and the lower-fidelity data. This stochastic model can be constructed by using few additional full code evaluations; it is used to calibrate arbitrarily many lower-quality outputs in order to create additional training data for sampling-based analysis. In effect, an adequate approximation of the simulation model’s response to uncertainty can be constructed at a modest computational cost. In fact, we aim at the number of full-model evaluations comparable to that required for a linear approximation (as opposed to numbers traditionally associated with sampling in high-dimensional spaces). In this report, we explain the basic algorithm, suggest some performance tuning options, and give a first characterization for the class of simulation models of nuclear engineering for which the suggested report is effective.

Roderick, O.↗

Randomized algorithms for accelerating linear algebraic computations

The project supported the development of new methodologies for performing matrix computations that form key building blocks in modern scientific computing, such as low rank approximation of matrices, and efficient representations of global operators that arise in simulations of physical phenomena.

97 MATHEMATICS AND COMPUTING↗

Simulated combined abnormal environment fire calculations for aviation impacts.

Aircraft impacts at flight speeds are relevant environments for aircraft safety studies. This type of environment pertains to normal environments such as wildlife impacts and rough landings, but also the abnormal environment that has more recently been evidenced in cases such as the Pentagon and World Trade Center events of September 11, 2001, and the FBI building impact in Austin. For more severe impacts, the environment is combined because it involves not just the structural mechanics, but also the release of the fuel and the subsequent fire. Impacts normally last on the order of milliseconds to seconds, whereas the fire dynamics may last for minutes to hours, or longer. This presents a serious challenge for physical models that employ discrete time stepping to model the dynamics with accuracy. Another challenge is that the capabilities to model the fire and structural impact are seldom found in a common simulation tool. Sandia National Labs maintains two codes under a common architecture that have been used to model the dynamics of aircraft impact and fire scenarios. Only recently have these codes been coupled directly to provide a fire prediction that is better informed on the basis of a detailed structural calculation. To enable this technology, several facilitating models are necessary, as is a methodology for determining and executing the transfer of information from the structural code to the fire code. A methodology has been developed and implemented. Previous test programs at the Sandia National Labs sled track provide unique data for the dynamic response of an aluminum tank of liquid water impacting a barricade at flight speeds. These data are used to validate the modeling effort, and suggest reasonable accuracy for the dispersion of a non-combustible fluid in an impact environment. The capability is also demonstrated with a notional impact of a fuel-filled container at flight speed. Both of these scenarios are used to evaluate numeric approximations, and help provide an understanding of the quantitative accuracy of the modeling methods.

97 MATHEMATICS AND COMPUTING↗

Computational Power of Random Quantum Circuits in Arbitrary Geometries

Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of approximately 50 qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and, therefore, how much infidelity is suffered) in generating highly entangled states. Here, we describe recent hardware upgrades to Quantinuum’s H2 quantum computer, enabling it to operate on up to 56 qubits with arbitrary connectivity and 99.843(5)% two-qubit gate fidelity. We define a class of circuits with random geometries that become hard to classically simulate in very low depth and implement them utilizing the flexible connectivity of H2. A careful analysis demonstrating the fast saturation of classical simulation complexity with depth indicates that H2 can yield data well beyond the reach of state-of-the art classical simulation methods at unprecedented fidelities. We find that the considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the quantum charge-coupled device architecture as continued progress is made toward building larger machines. Published by the American Physical Society 2025

DeCross, M.↗

Improved pore network models to simulate single-phase flow in porous media by coupling with lattice Boltzmann method

In this paper, different pore network models to simulate single-phase flow in porous media are built and their accuracy is evaluated. In addition to the conventional pore network model (CPNM) which consists of regular pore bodies and throat bonds, three improved pore network models (IPNMs) are developed allowing to better describing the real pore and throat geometry. The first improved pore network model (IPNM1) replaces the regular throat bond with a throat bond showing the real throat cross section. The second improvement (IPNM2) uses a series of sub-throat bonds with varying cross sections to better describe the real throat geometry, which is firstly proposed in this paper. The third model (IPNM3) extracts the real pore-throat-pore geometry without simplification. The conductance of fluid flow through these more realistic throat bonds is calculated by the lattice Boltzmann method (LBM). The accuracy and computational efficiency of the different pore network models are evaluated taking the LBM simulation over the whole porous medium as reference solution. The global permeability and detailed pressure distributions in the pores for the different pore network models are validated. The results show that the accuracy of the pore network model increases from CPNM to IPNM3, but at the expense of increasing computational cost. This study suggests that IPNM3 can replace a whole-domain LBM simulation with similar accuracy but much lower computational cost. As a first-order approximation the newly proposed IPNM2 is suggested as good compromise between accuracy and computational cost.

42 ENGINEERING↗

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↗