Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximant”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

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,↗
DOE OSTI2020

Completely Positive, Simple, and Possibly Highly Accurate Approximation of the Redfield Equation

Here we present a Lindblad master equation that approximates the Redfield equation, a well known master equation derived from first principles, without significantly compromising the range of applicability of the Redfield equation. Instead of full-scale coarse-graining, this approximation only truncates terms in the Redfield equation that average out over a time-scale typical of the quantum system. The first step in this approximation is to properly renormalize the system Hamiltonian, to symmetrize the gains and losses of the state due to the environmental coupling. In the second step, we swap out an arithmetic mean of the spectral density with a geometric one, in these gains and losses, thereby restoring complete positivity. This completely positive approximation, GAME (geometric-arithmetic master equation), is adaptable between its time-independent, time-dependent, and Floquet form. In the exactly solvable, three-level, Jaynes-Cummings model, we find that the error of the approximate state is almost an order of magnitude lower than that obtained by solving the coarse-grained stochastic master equation. As a test-bed, we use a ferromagnetic Heisenberg spin-chain with long-range dipole-dipole coupling between up to 25-spins, and study the differences between various master equations. We find that GAME has the highest accuracy per computational resource.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

The Effect of the Flux Separability Approximation on Multigroup Neutron Transport

The angular dependence of flux-weighted multigroup cross sections is commonly neglected when generating multigroup libraries. The error of this flux separability approximation is typically not isolated from other error sources due to a lack of availability of library generation and corresponding solvers that cannot relax this approximation. These errors can now be isolated and quantified with the availability of a multigroup Monte Carlo transport and multigroup library-generation capability in the OpenMC Monte Carlo transport code. This work will discuss relevant details of the OpenMC implementation, provide an example case useful for detailing the type of errors one can expect from making the flux separability approximation, and end with more realistic problems which show the impact of the approximation and highlight how it can strongly arise from an energy-dependent resonance absorption effect. Since the angle-dependence is intrinsically linked to the energy group structure, these examples also show that relaxing the flux separability approximation with angle-dependent cross sections could be used to reduce either the fine-tuning required to set a multigroup energy structure for a specific reactor type or the number of energy groups required to obtain a desired level of accuracy for a given problem. This trade-off could increase the costs of generating multigroup cross sections, and has the potential to require more memory for storing the multigroup library during the transport calculations, but it can significantly reduce the computational time required since the runtime of a discrete ordinates or method of characteristics neutron transport solver scales roughly linearly with the number of groups.

42 ENGINEERING↗
DOE OSTI2023

Finite-Time Analysis of Whittle Index based Q-Learning for Restless Multi-Armed Bandits with Neural Network Function Approximation

Whittle index policy is a heuristic to the intractable restless multi-armed bandits (RMAB) problem. Although it is provably asymptotically optimal, finding Whittle indices remains difficult. In this paper, we present Neural-Q-Whittle, a Whittle index based Q-learning algorithm for RMAB with neural network function approximation, which is an example of nonlinear two-timescale stochastic approximation with Q-function values updated on a faster timescale and Whittle indices on a slower timescale. Despite the empirical success of deep Q-learning, the non-asymptotic convergence rate of Neural-Q-Whittle, which couples neural networks with two-timescale Q-learning largely remains unclear. This paper provides a finite-time analysis of Neural-Q-Whittle, where data are generated from a Markov chain, and Q-function is approximated by a ReLU neural network. Our analysis leverages a Lyapunov drift approach to capture the evolution of two coupled parameters, and the nonlinearity in value function approximation further requires us to characterize the approximation error. Combing these provide Neural-Q-Whittle with convergence rate, where is the number of iterations.

reinforcement learning, structured learning, conve↗
DOE OSTI2021

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Empirical performance bounds for quantum approximate optimization

The quantum approximate optimization algorithm (QAOA) has been put forth as a method for near-term quantum computers to solve optimization problems. However, assessments of QAOA performance have mostly focused on small structured problem instances while performance on more general instances is less clear. Here, we numerically simulate QAOA pure state dynamics for every instance of MaxCut on non-isomorphic unweighted graphs with nine or fewer vertices with depth parameters p ≤ 3. We find the approximation ratios and optimized circuit parameters concentrate across graphs of a given size and empirically show increases in concentration as graph size increases. The parameter concentration leads to two median-angle heuristics that overcome difficulties in QAOA parameter optimization and obtain mean approximation ratios within 3% and 0.2% of the optimal. We also analyze the probability to measure an optimal solution and find increasing variations between graphs as depth increases, in stark contrast to the approximation ratios which concentrate as depth increases. Furthermore, the resulting benchmark data set gives empirical bounds for on-going experimental realizations and lays groundwork for theoretical extensions to greater problem sizes and depths where QAOA may prove important for practically relevant problems.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

A Meta-Generalized Gradient Approximation for the Cavity-Dependent Exchange-Correlation Interaction in Strongly Coupled Light–Matter Systems

Strong light–matter coupling in optical cavities enables the manipulation of chemical and physical properties without altering molecular composition. Theoretical modeling of such phenomena requires exchange-correlation (XC) functionals that account for both electron–electron and electron–photon (ep) interactions within quantum electrodynamical density functional theory (QEDFT). In this work, we develop a meta-generalized gradient approximation (meta-GGA) specifically targeting the cavity-dependent XC interaction in strongly coupled light–matter systems. This novel approximation is built upon a new semilocal polarizability approximation, which draws from the jellium-with-a-gap model, and can be extended to a “global hybrid” variant that goes beyond the isotropic model from previous approximations. The polarizability model yields significantly improved dispersion coefficients and benchmark calculations with the cavity-dependent XC functional demonstrate improved agreement with QED Hartree–Fock (QED-HF) reference energies. Application to the regioselectivity of brominated nitrobenzene intermediates reveals the functional’s capacity to capture cavity-induced energetic shifts. In conclusion, our results advance the Jacob’s ladder of functionals for QEDFT and provide a practical tool for modeling polaritonic chemistry.

Approximation↗
DOE OSTI2022

Approximate bounds and temperature dependence of adiabatic connection integrands for the uniform electron gas

Thermal density functional theory is commonly used in simulations of warm dense matter, a highly energetic phase characterized by substantial thermal effects and by correlated electrons demanding quantum mechanical treatment. Methods that account for temperature dependence, such as Mermin–Kohn–Sham finite-temperature density functional theory and free energy density functional theory, are now employed with more regularity and available in many standard code packages. However, approximations from zero-temperature density functional theory are still often used in temperature-dependent simulations using thermally weighted electronic densities as an input to exchange–correlation functional approximations, a practice known to miss temperature-dependent effects in the exchange–correlation free energy of these systems. Here, in this work, the temperature-dependent adiabatic connection is demonstrated and analyzed using a well-known parameterization of the uniform electron gas free energy. Useful tools based on this formalism for analyzing and constraining approximations of the exchange–correlation at zero temperature are leveraged for the finite-temperature case. Inspired by the Lieb–Oxford inequality, which provides a lower bound for the ground-state exchange–correlation energy, bounds for the exchange–correlation at finite temperatures are approximated for various degrees of electronic correlation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Embedded random phase approximation for magnetic systems: H 2 dissociative adsorption on Fe(110)

The random phase approximation (RPA), a method for treating electron correlation, has been shown to be superior to standard density functional theory (DFT) approximations in numerous cases. However, the RPA’s computational cost is substantially higher than that of DFT, particularly restricting its application to extended surfaces. The recently introduced embedded RPA (emb-RPA) approach [Wei et al., J. Chem. Phys. 159(19), 194108 (2023)] reduces this computational cost by approximately two orders of magnitude. While previous applications of emb-RPA focused on non-spin-polarized systems, here we extend the approach to ferromagnetic ones. Unlike other embedded correlated wavefunction methods, such as embedded complete active space self-consistent field theory, emb-RPA is advantageous for spin-polarized systems because the RPA is compatible with unrestricted DFT solutions, which are eigenfunctions of the spin angular momentum operator S z but not the total spin-squared operator S 2 . By applying emb-RPA with specific magnetization constraints, we achieved a speedup of two to three orders of magnitude (one order when accounting for the one-time embedding potential optimization cost) with only small errors (∼50 meV) compared to full periodic RPA. Moreover, emb-RPA significantly reduces the over-binding errors of DFT approximations. In conclusion, we anticipate that the acceleration enabled by the spin-polarized emb-RPA approach will broaden the applicability of RPA to magnetic materials.

Density functional theory↗
DOE OSTI2021

Ensemble Learning Based Convex Approximation of Three-Phase Power Flow

Though the convex optimization has been widely used in power systems, it still cannot guarantee to yield a tight (accurate) solution to some problems. To mitigate this issue, this paper proposes an ensemble learning based convex approximation for alternating current (AC) power flow equations that differs from the existing convex relaxations. The proposed approach is based on three-phase quadratic power flow equations in rectangular coordinates. To develop this data-driven convex approximation of power flows, the polynomial regression (PR) is first deployed as a basic learner to fit convex relationships between the independent and dependent variables. Then, ensemble learning algorithms such as gradient boosting (GB) and bagging are introduced to combine learners to boost model performance. Based on the learned convex approximation of power flow, optimal power flow (OPF) is formulated as a convex quadratic programming problem. The simulation results on IEEE standard cases of both balanced and unbalanced systems show that, in the context of solving OPF, the proposed data-driven convex approximation outperforms the conventional semi-definite programming (SDP) relaxation in both accuracy and computational efficiency, especially in the cases that the conventional SDP relaxation fails

Convex approximation↗
DOE OSTI2024

Adaptive Power Flow Approximations With Second-Order Sensitivity Insights

The power flow equations are fundamental to power system planning, analysis, and control. However, the inherent non-linearity and non-convexity of these equations present formidable obstacles in problem-solving processes. To mitigate these challenges, recent research has proposed adaptive power flow linearizations that aim to achieve accuracy over wide operating ranges. The accuracy of these approximations inherently depends on the curvature of the power flow equations within these ranges, which necessitates considering second-order sensitivities. In this paper, we leverage second-order sensitivities to both analyze and improve power flow approximations. We evaluate the curvature across broad operational ranges and subsequently utilize this information to inform the computation of various sample-based power flow approximation techniques. Additionally, we leverage second-order sensitivities to guide the development of rational approximations that yield linear constraints in optimization problems. In conclusion, this approach is extended to enhance accuracy beyond the limitations of linear functions across varied operational scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Performance improvements of the windowed multipole formalism using a rational fraction approximation of the Faddeeva function

The windowed multipole (WMP) formalism was introduced as a way to calculate Doppler broadened cross sections on the fly during Monte Carlo simulations. While more arithmetic is needed compared to point-wise cross section look-ups, performance remained competitive from the large memory reductions and sequential data access. The single most expensive function call in a depleted fuel assembly problem using WMP comes from the evaluation of the Faddeeva function, which previously relied on a highly accurate, highly-branching algorithm. This paper explores the use of rational fraction approximations tailored to the domain interest of reactor physics applications and the development of lower accuracy approximations sufficient for our application. The rational approximations were implemented and tested in OpenMC on an infinite medium problem to stress the cross section calculation routine and a PWR assembly problem. In both cases, the rational approximation nearly eliminated the ∼ 20% penalty previously observed when comparing to point-wise libraries. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Quantum Control Landscapes Beyond the Dipole Approximation: Controllability, Singular Controls, and Resources

We investigate the control landscapes of closed n-level quantum systems beyond the dipole approximation by including a polarizability term in the Hamiltonian. The latter term is quadratic in the control field. Theoretical analysis of singular controls is presented, which are candidates for producing landscape traps. The results for considering the presence of singular controls are compared to their counterparts in the dipole approximation (i.e., without polarizability). A numerical analysis of the existence of traps in control landscapes for generating unitary transformations beyond the dipole approximation is made upon including the polarizability term. An extensive exploration of these control landscapes is achieved by creating many random Hamiltonians which include terms linear and quadratic in a single control field. The discovered singular controls are all found not to be local optima. This result extends a great body of recent work on typical landscapes of quantum systems where the dipole approximation is made. We further investigate the relationship between the magnitude of the polarizability and the fluence of the control resulting from optimization. It is also shown that including a polarizability term in an otherwise uncontrollable dipole coupled system removes traps from the corresponding control landscape by restoring controllability. We numerically assess the effect of a polarizability term on a known example of a particular three-level Λ-system with a second order trap in its control landscape. It is found that the addition of the polarizability removes the trap from the landscape. The general practical control implications of these simulations are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Photoionization of Atomic Systems Using the Random-Phase Approximation Including Relativistic Interactions

Approximation methods are unavoidable in solving a many-electron problem. One of the most successful approximations is the random-phase approximation (RPA). Miron Amusia showed that it can be used successfully to describe atomic photoionization processes of many-electron atomic systems. In this article, the historical reasons behind the term “random-phase approximation” are revisited. A brief introduction to the relativistic RPA (RRPA) developed by Walter Johnson and colleagues is provided and some of its illustrative applications are presented.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2019

Quasi-Stochastic Approximation and Off-Policy Reinforcement Learning: Preprint

The Robbins-Monro stochastic approximation algorithm is a foundation of many algorithmic frameworks for reinforcement learning and often an efficient approach to solving (or approximating the solution to) complex optimal control problems. In many cases, however, practitioners are unable to apply these techniques because of an inherent high variance. This paper aims to provide a general foundation for 'quasi-stochastic approximation,' in which all of the processes under consideration are deterministic, much like quasi-Monte Carlo for variance reduction in simulation. The variance reduction can be substantial, subject to tuning of pertinent parameters in the algorithm. This paper introduces a new coupling argument to establish the optimal rate of convergence provided the gain is sufficiently large. These results are established for linear models and tested also in nonideal settings. A major application of these general results is a new class of reinforcement learning algorithms for deterministic state space models. In this setting, the main contribution is a class of algorithms for approximating the value function for a given policy, using a different policy designed to introduce exploration.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Approximate CFTs and random tensor models

Abstract A key issue in both the field of quantum chaos and quantum gravity is an effective description of chaotic conformal field theories (CFTs), that is CFTs that have a quantum ergodic limit. We develop a framework incorporating the constraints of conformal symmetry and locality, allowing the definition of ensembles of ‘CFT data’. These ensembles take on the same role as the ensembles of random Hamiltonians in more conventional quantum ergodic phases of many-body quantum systems. To describe individual members of the ensembles, we introduce the notion of approximate CFT, defined as a collection of ‘CFT data’ satisfying the usual CFT constraints approximately, i.e. up to small deviations. We show that they generically exist by providing concrete examples. Ensembles of approximate CFTs are very natural in holography, as every member of the ensemble is indistinguishable from a true CFT for low-energy probes that only have access to information from semi-classical gravity. To specify these ensembles, we impose successively higher moments of the CFT constraints. Lastly, we propose a theory of pure gravity in AdS 3 as a random matrix/tensor model implementing approximate CFT constraints. This tensor model is the maximum ignorance ensemble compatible with conformal symmetry, crossing invariance, and a primary gap to the black-hole threshold. The resulting theory is a random matrix/tensor model governed by the Virasoro 6j-symbol.

Physics↗