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 1,585 records · Page 88

Direct and inverse theorems of rational approximation in the Bergman space

For positive numbers p and {mu} let A{sub p,{mu}} denote the Bergman space of analytic functions in the half-plane {Pi}:={l_brace}z element of C:Imz>0{r_brace}. For f element of A{sub p,{mu}} let R{sub n} (f){sub p,{mu}} be the best approximation by rational functions of degree at most n. Also let {alpha} element of R and {tau}>0 be numbers such that {alpha}+{mu}=1/{tau}-1/p and 1/p+{mu} not element of N. Then the main result of the paper claims that the set of functions f element of A{sub p,{mu}} such that {Sigma}{sub n=1}{sup {infinity}} 1/n (n{sup {alpha}}+{mu}R{sub n} (f){sub p,{mu}}){sup {tau}}<{infinity} is precisely the Besov space B{sub {tau}}{sup {alpha}} of analytic functions in {Pi}. Bibliography: 23 titles.

97 MATHEMATICS AND COMPUTING↗

Estimating the Bias of Local Polynomial Approximation Methods Using the Peano Kernel

The determination of uncertainty of an estimate requires both the variance and the bias of the estimate. Calculating the variance of local polynomial approximation (LPA) estimates is straightforward. We present a method, using the Peano Kernel Theorem, to estimate the bias of LPA estimates and show how this can be used to optimize the LPA parameters in terms of the bias-variance tradeoff. Figures of merit are derived and values calculated for several common methods. The results in the literature are expanded by giving bias error bounds that are valid for all lengths of the smoothing interval, generalizing the currently available asymptotic results that are only valid in the limit as the length of this interval goes to zero.

97 MATHEMATICS AND COMPUTING↗

Wormholes and black hole microstates in AdS/CFT

It has long been known that the coarse-grained approximation to the black hole density of states can be computed using classical Euclidean gravity. In this work we argue for another entry in the dictionary between Euclidean gravity and black hole physics, namely that Euclidean wormholes describe a coarse-grained approximation to the energy level statistics of black hole microstates. To do so we use the method of constrained instantons to obtain an integral representation of wormhole amplitudes in Einstein gravity and in full-fledged AdS/CFT. These amplitudes are non-perturbative corrections to the two-boundary problem in AdS quantum gravity. The full amplitude is likely UV sensitive, dominated by small wormholes, but we show it admits an integral transformation with a macroscopic, weakly curved saddle-point approximation. The saddle is the “double cone” geometry of Saad, Shenker, and Stanford, with fixed moduli. In the boundary description this saddle appears to dominate a smeared version of the connected two-point function of the black hole density of states, and suggests level repulsion in the microstate spectrum. Using these methods we further study Euclidean wormholes in pure Einstein gravity and in IIB supergravity on Euclidean AdS 5 × S 5 . We address the perturbative stability of these backgrounds and study brane nucleation instabilities in 10d supergravity. In particular, brane nucleation instabilities of the Euclidean wormholes are lifted by the analytic continuation required to obtain the Lorentzian spectral form factor from gravity. Our results indicate a factorization paradox in AdS/CFT.

79 ASTRONOMY AND ASTROPHYSICS↗

Nonunitary Variational Quantum Eigensolver with the Localized Active Space Method and Cost Mitigation

Accurately describing strongly correlated systems with affordable quantum resources remains a central challenge for quantum chemistry applications on near and intermediate term quantum computers. The localized active space self-consistent field (LASSCF) approximates the complete active space self-consistent field (CASSCF) by generating active space-based wave functions within specific fragments while treating interfragment correlation with mean-field approach, hence is computationally less expensive. Hardware-efficient ansatzes (HEA) offer affordable and shallower circuits, yet they often fail to capture the necessary correlation. Previously, Jastrow-factor-inspired nonunitary qubit operators were proposed to use with HEA for variational quantum eigensolver (VQE) calculations (so-called nuVQE), as they do not increase circuit depths and recover correlation beyond the mean-field level for Hartree–Fock initial states. Here, in this study, we explore running nuVQE with LASSCF as the initial state. The method, named LAS-nuVQE, is shown to recover interfragment correlations, reach chemical accuracy with a small number of gates (<70) in both H 4 and square cyclobutadiene (C 4 H 4 ), and produces more accurate energetics than its HEA counterparts at all circuit depths. To further address the inherent symmetry-breaking in HEA, we implemented spin-constrained LAS-nuVQE to extend the capabilities of HEA further and show spin-pure results for square cyclobutadiene. We also mitigate the increased measurement overhead of nuVQE via Pauli grouping and shot-frugal sampling, reducing measurement costs by up to 2 orders of magnitude compared to ungrouped operator, and show that one can achieve better accuracy with a small number of shots (10 3–4 ) per one expectation value calculation compared to noiseless simulations with one or two orders of magnitude more shots. Finally, wall clock time estimates show that, with our measurement mitigation protocols, nuVQE becomes a cheaper and more accurate alternative than vanilla VQE with HEA. Taken together, these developments illustrate a practical pathway toward performing multireference chemical simulations with accuracy and affordable resources on today’s quantum hardware, achieving both accuracy and affordability in challenging correlated systems.

Wang, Qiaohong [Univ. of Chicago, IL (United State↗

Estimating anisotropic diffusion of neutrons near the boundary of a pebble bed random system

Due to the arrangement of the pebbles in a Pebble Bed Reactor (PBR) core, if a neutron is located close to a boundary wall, its path length probability distribution function in directions of flight parallel to the wall is significantly different than in other directions. Hence, anisotropic diffusion of neutrons near the boundaries arises. We describe an analysis of neutron transport in a simplified 3-D pebble bed random system, in which we investigate the anisotropic diffusion of neutrons born near one of the system's boundary walls. While this simplified system does not model the actual physical process that takes place near the boundaries of a PBR core, the present work paves the road to a formulation that may enable more accurate diffusion simulations of such problems to be performed in the future. Monte Carlo codes have been developed for (i) deriving realizations of the 3-D random system, and (ii) performing 3-D neutron transport inside the heterogeneous model; numerical results are presented for three different choices of parameters. These numerical results are used to assess the accuracy of estimates for the mean-squared displacement of neutrons obtained with the diffusion approximations of the Atomic Mix Model and of the recently introduced [1] Non-Classical Theory with angular-dependent path length distribution. The Non-Classical Theory makes use of a Generalized Linear Boltzmann Equation in which the locations of the scattering centers in the system are correlated and the distance to collision is not exponentially distributed. We show that the results predicted using the Non-Classical Theory successfully model the anisotropic behavior of the neutrons in the random system, and more closely agree with experiment than the results predicted by the Atomic Mix Model. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Revisiting the ODE Method for Recursive Algorithms: Fast Convergence Using Quasi Stochastic Approximation

Several decades ago, Profs. Sean Meyn and Lei Guo were postdoctoral fellows at ANU, where they shared interest in recursive algorithms. It seems fitting to celebrate Lei Guo's 60th birthday with a review of the ODE Method and its recent evolution. The method has been regarded as a technique for algorithm analysis. It is argued that this viewpoint is backwards: The original stochastic approximation method was surely motivated by an ODE, and tools for analysis came much later (based on establishing robustness of Euler approximations). The paper presents a brief survey of recent research in machine learning that shows the power of algorithm design in continuous time, following by careful approximation to obtain a practical recursive algorithm. While these methods are usually presented in a stochastic setting, this is not a prerequisite. In fact, recent theory shows that rates of convergence can be dramatically accelerated by applying techniques inspired by quasi Monte-Carlo. Subject to conditions, the optimal rate of convergence can be obtained by applying the averaging technique of Polyak and Ruppert. The conditions are not universal, but theory suggests alternatives to achieve acceleration. The theory is illustrated with applications to gradient-free optimization, and policy gradient algorithms for reinforcement learning.

learning and adaptive systems in artificial intell↗

Static Subspace Approximation for Random Phase Approximation Correlation Energies: Applications to Materials for Catalysis and Electrochemistry

Modeling complex materials using high-fidelity, ab initio methods at low cost is a fundamental goal for quantum chemical software packages. The GW approximation and random phase approximation (RPA) provide a unified description of both electronic structure and total energies using the same physics in a many-body perturbative approach that can be more accurate than generalized-gradient density functional theory (DFT) methods. However, GW/RPA implementations have historically been limited to either specific materials classes or application toward small chemical systems. Here, the static subspace approximation allows for reduced cost full-frequency GW/RPA calculations and has previously been benchmarked thoroughly for GW calculations. Here, we describe our approach to including partial occupations of electronic orbitals in full-frequency GW and RPA calculations for the study of electrocatalysts. We benchmarked RPA total energy calculations using the subspace approximation across a diverse test suite of materials for a variety of computational parameters. The benchmarking quantifies the impact of different extrapolation procedures for representing the static polarizability at infinite screened cutoff, and shows that using screened cutoffs above 20-25 Ryd result in diminishing accuracy returns for predicting RPA total energies. Additionally, for moderately sized electrocatalytic models, 2-3 times fewer computational resources are used to compute RPA total energies by representing the static polarizability with 20-30% of the static subspace basis, with an error of approximately 0.01 eV or better in RPA adsorption energy calculations. Finally, we show that for these electrochemical models RPA can shift DFT adsorption energy shifts by up to 0.5 eV and that GW can frequently shift DFT eigenvalues of surface and adsorbate states by approximately 0.5-1 eV.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Comment on three-point function in AdS(3)/CFT(2)

Recently, exact agreement has been found between bulk and boundary three-point functions in AdS{sub 3}xS{sup 3}xT{sup 4} with Neveu-Schwarz-Neveu-Schwarz (NSNS) fluxes. This represents a nontrivial check of AdS/CFT correspondence beyond the supergravity approximation as it corresponds to an exact worldsheet computation. When taking a closer look at this computation, one notices that a crucial point for the bulk-boundary agreement to hold is an intriguing mutual cancellation between worldsheet contributions corresponding to the AdS{sub 3} and to the S{sup 3} pieces of the geometry, that results in a simple factorized form for the final three-point function. In this note we review this cancellation and clarify some points about the analytic relation between the SU(2) and the SL(2,R) structure constants. In particular, we dicuss the connection to the Coulomb gas representation. We also make some comments on the four-point function.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Approximate l-Fold Cross-Validation with Least Squares SVM and Kernel Ridge Regression

Kernel methods have difficulties scaling to large modern data sets. The scalability issues are based on computational and memory requirements for working with a large matrix. These requirements have been addressed over the years by using low-rank kernel approximations or by improving the solvers' scalability. However, Least Squares Support Vector Machines (LS-SVM), a popular SVM variant, and Kernel Ridge Regression still have several scalability issues. In particular, the O(n^3) computational complexity for solving a single model, and the overall computational complexity associated with tuning hyper parameters are still major problems. We address these problems by introducing an O(nlog n) approximate l-fold cross-validation method that uses a multi-level circulant matrix to approximate the kernel. In addition, we prove our algorithm's computational complexity and present empirical runtimes on data sets with approximately one million data points. We also validate our approximate method's effectiveness at selecting hyper parameters on real world and standard benchmark data sets. Lastly, we provide experimental results on using a multi level circulant kernel approximation to solve LS-SVM problems with hyper parameters selected using our method.

Computer Science↗

A least-squares approximation of partial differential equations with high-dimensional random inputs

Uncertainty quantification schemes based on stochastic Galerkin projections, with global or local basis functions, and also stochastic collocation methods in their conventional form, suffer from the so called curse of dimensionality: the associated computational cost grows exponentially as a function of the number of random variables defining the underlying probability space of the problem. In this paper, to overcome the curse of dimensionality, a low-rank separated approximation of the solution of a stochastic partial differential (SPDE) with high-dimensional random input data is obtained using an alternating least-squares (ALS) scheme. It will be shown that, in theory, the computational cost of the proposed algorithm grows linearly with respect to the dimension of the underlying probability space of the system. For the case of an elliptic SPDE, an a priori error analysis of the algorithm is derived. Finally, different aspects of the proposed methodology are explored through its application to some numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Virtual element approximations of the time-fractional nonlinear convection-diffusion equation on polygonal meshes

We extend the Virtual Element Method to a two-dimensional unsteady nonlinear convection-diffusion equation characterized by a fractional-order derivative with respect to the time variable. Our methodology is based on three fundamental technical components: a fractional version of the Grunwald-Letnikov approximation, discrete maximal regularity, and the regularity theory associated with non-linearity. We prove the method's well-posedness, i.e., the approximate solution's existence and uniqueness to the time-fractional convection-diffusion equation with a Lipschitz nonlinear source term. The fully discrete scheme inherently maintains stability and consistency by leveraging the discrete maximal regularity and the energy projection operator. The convergence in the L 2 -norm and H 1 -norm to various mesh configurations is validated by numerical results, underlining the practical effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗

A full-dimensional quantum dynamical study of H{sub 2}+H{sub 2} collisions: Coupled-states versus close-coupling formulation

Collision-induced energy transfer involving H{sub 2} molecules plays an important role in many areas of physics. Kinetic models often require a complete set of state-to-state rate coefficients for H{sub 2}+H{sub 2} collisions in order to interpret results from spectroscopic observations or to make quantitative predictions. Recent progress in full-dimensional quantum dynamics using the numerically exact close-coupling (CC) formulation has provided good agreement with existing experimental data for low-lying states of H{sub 2} and increased the number of state-to-state cross sections that may be reliably determined over a broad range of energies. Nevertheless, there exist many possible initial states (e.g., states with high rotational excitation) that still remain elusive from a computational standpoint even at relatively low collision energies. In these cases, the coupled-states (CS) approximation offers an alternative full-dimensional formulation. We assess the accuracy of the CS approximation for H{sub 2}+H{sub 2} collisions by comparison with benchmark results obtained using the CC formulation. The results are used to provide insight into the orientation effects of the various internal energy transfer mechanisms. A statistical CS approximation is also investigated and cross sections are reported for transitions which would otherwise be impractical to compute.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SolarPILOT: A power tower solar field layout and characterization tool

This paper develops and demonstrates a new SolarPower tower Integrated Layout and Optimization Tool (SolarPILOT). The tool uses the analytical flux image Hermite series approximation originally implemented in the DELSOL3 software developed by Sandia National Laboratory in the early 1980s. By applying the analytical model to individual heliostat images rather than large groups or zones of heliostats, SolarPILOT can characterize a wide variety of heliostat field layouts. The individual heliostat modeling approach increases computational expense in comparison with DELSOL3, so SolarPILOT implements a number of improvements to the analytical approximation method to improve model accuracy and computational efficiency. This paper discusses several of these methods, including dynamic heliostat grouping to reduce the expense of intercept factor evaluation, approximation of annual productivity with a subset of time steps throughout the year, polygon clipping to accurately calculate inter-heliostat shadowing and blocking, receiver and tower geometry optimization, and a trigonometric image transformation technique that ensures model accuracy for small heliostats. SolarPILOT also integrates a Monte-Carlo ray tracing engine (SolTrace), providing improved receiver optical modeling capability, a user-friendly front end for geometry definition, and side-by-side validation of the analytical algorithms.

14 SOLAR ENERGY↗

Computational Algorithms for Unit Commitment with AC Power Flows (Final Report)

Security-constrained unit commitment (SCUC) is a key component in power system operations. When AC power flow constraints are considered in the SCUC model (AC-SCUC), the problem becomes extremely difficult due to its discrete and non-convex nature, as described in “Grid Optimization Competition Challenge 3 Problem Formulation (GOCC)”. There are four main challenges: (i) Discrete decisions regarding unit online/offline status and start-up/shut-down procedures for every single unit. The number of discrete decision variables increases considerably when a system integrates multiple generators; (ii) Configuration-based combined-cycle formulations, and multi-commodity models that include ramping products, spin/non-spin products, and regulation up/down products. The combined-cycle units introduce additional discrete decision variables and auxiliary service products further complicate the model by connecting multi-commodity products’ continuous and discrete variables; (iii) SCUC models with AC power flow constraints are far more complex due to massive bilinear terms in the large-scale nonlinear power balance equations. The nonlinear power balance equations are further complicated by the discrete step control variables of shunts; (iv) N − 1 contingency analysis. The size of the model increases linearly with the number of contingencies considered, greatly increasing the size of the optimization model. Accordingly, there is an emergent need to develop a robust algorithm capable of deriving a high-quality solution in a short time and passing through contingency tests simultaneously. In this project, we explore innovative techniques to address this challenging problem by integrating advanced polyhedral theory, approximation methods, relaxation strategies, decomposition techniques, and parallel computing. Each technique approaches the problem from a different perspective, leveraging its specific strengths to tackle distinct challenges. Each individual method has demonstrated its effectiveness in the PI’s previous research. Their integration is expected to significantly reduce the computational time required to solve the proposed complex problem. Successful completion of this project has the potential to transform the industry by enhancing optimization solvers capable of handling large-scale day-ahead energy market clearing models within strict time constraints, while incorporating AC power flow constraints. This advancement will lead to reduced overall generation costs and, consequently, increased social welfare.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Solvers for $\mathcal{O} (N)$ Electronic Structure in the Strong Scaling Limit

Here we present a hybrid OpenMP/Charm\tt++ framework for solving the $\mathcal{O} (N)$ self-consistent-field eigenvalue problem with parallelism in the strong scaling regime, $P\gg{N}$, where $P$ is the number of cores, and $N$ is a measure of system size, i.e., the number of matrix rows/columns, basis functions, atoms, molecules, etc. This result is achieved with a nested approach to spectral projection and the sparse approximate matrix multiply [Bock and Challacombe, SIAM J. Sci. Comput., 35 (2013), pp. C72--C98], and involves a recursive, task-parallel algorithm, often employed by generalized $N$-Body solvers, to occlusion and culling of negligible products in the case of matrices with decay. Lastly, employing classic technologies associated with generalized $N$-Body solvers, including overdecomposition, recursive task parallelism, orderings that preserve locality, and persistence-based load balancing, we obtain scaling beyond hundreds of cores per molecule for small water clusters ([H${}_2$O]${}_N$, $N \in \{ 30, 90, 150 \}$, $P/N \approx \{ 819, 273, 164 \}$) and find support for an increasingly strong scalability with increasing system size $N$.

97 MATHEMATICS AND COMPUTING↗

A variable-order time-dependent neutron transport method for nuclear reactor kinetics using analytically-integrated space-time characteristics

A new time-dependent neutron transport method based on the method of characteristics (MOC) has been developed. Whereas most spatial kinetics methods treat time dependence through temporal discretization, this new method treats time dependence by defining the characteristics to span space and time. In this implementation regions are defined in space-time where the thickness of the region in time fulfills an analogous role to the time step in discretized methods. The time dependence of the local source is approximated using a truncated Taylor series expansion with high order derivatives approximated using backward differences, permitting the solution of the resulting space-time characteristic equation. To avoid a drastic increase in computational expense and memory requirements due to solving many discrete characteristics in the space-time planes, the temporal variation of the boundary source is similarly approximated. This allows the characteristics in the space-time plane to be represented analytically rather than discretely, resulting in an algorithm comparable in implementation and expense to one that arises from conventional time integration techniques. Furthermore, by defining the boundary flux time derivative in terms of the preceding local source time derivative and boundary flux time derivative, the need to store angularly-dependent data is avoided without approximating the angular dependence of the angular flux time derivative. The accuracy of this method is assessed through implementation in the neutron transport code DeCART. The method is employed with variable-order local source representation to model a TWIGL transient. The results demonstrate that this method is accurate and more efficient than the discretized method. (authors)

97 MATHEMATICS AND COMPUTING↗

Introduction of a valence space in QRPA: Impact on vibrational mass parameters and spectroscopy

For the first time, using a unique finite range interaction (D1M Gogny force), a fully coherent and time-feasible calculation of the Bohr Hamiltonian vibrational mass is envisioned in a Hartree-Fock-Bogoliubov + Quasiparticle Random Phase Approximation (QRPA) framework. In order to reach handable computation time, we evaluate the feasibility of this method by considering the insertion of a valence space for QRPA. We validate our approach in the even-even tin isotopes comparing the convergence scheme of the mass parameter with those of built-in QRPA outputs: excited state energy and reduced transition probability. The seeming convergence of these intrinsic quantities is shown to be misleading and the difference with the theoretical expected value is quantified. This work is a primary step towards the systematic calculation of mass parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗