Search NASA⌕ Search

SEARCH · Search NASA

Results for “recursive”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping

We devise a deterministic quantum algorithm to produce antisymmetric states of single-particle orbitals in the first quantization mapping. Unlike sorting-based antisymmetrization algorithms, which require ordered input states and high Clifford-gate overhead, our approach initializes the state of each particle independently. For a system of $η$ particles and $N$ single-particle states, our algorithm prepares antisymmetrized states of non-trivial localized (e.g., Hartree-Fock) orbitals using $O(η^2\sqrt{N})$ $T$-gates, outperforming alternative algorithms when $η ≲ \sqrt{N}$. To achieve such scaling, we require $O(\sqrt{N})$ dirty ancilla qubits for intermediate calculations. Knowledge of the single-particle states to be antisymmetrized can be leveraged to further improve the efficiency of the circuit, and a measurement-based variant reduces gate cost by roughly a factor of two. We show example circuits for two- and three-particle systems and discuss the generalization to an arbitrary number of particles. For a specific three-particle example, we decompose the circuit into Clifford $+T$ gates and study the impact of noise on the prepared state.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Quantification of High-Temperature Transition Al2O3 and Their Phase Transformations

High temperature exposure of ?-Al2O3 can lead to a series of polymorphic transformations, including the formation of ?-Al2O3 and ?-Al2O3. Quantification of the microstructure in the ?/?-Al2O3 formation range represents a formidable challenge as both phases accommodate a high degree of structural disorder. In this work, we explore the use of XRD recursive stacking formalism for quantification of high temperature transition aluminas. We formulate the recursive stacking methodology for modelling of disorder in ?-Al2O3 and twinning in ?-Al2O3 and show that explicitly accounting for the disorder is necessary to reliably model the XRD patterns of high temperature transition alumina. In the second part, we use the recursive stacking approach to study phase transformation during high temperature (1050 ºC) treatment. We show that the two different intergrowth modes of ?-Al2O3 have different transformation characteristics, and that a significant portion of ?-Al2O3 is stabilized with ?-Al2O3 even after prolonged high-temperature exposures. In discussions, we outline the limitation of the current XRD approach and discuss a possible multimodal XRD and NMR approach which can improve analysis of complex transition aluminas. This work was performed in the Wiley Environmental Molecular Sciences Laboratory (EMSL), a national scientific user facility sponsored by DOEs Office of Biological and Environmental Research and located at PNNL. The work was supported by the U.S. Department of Energy (DOE), Office of Basic Energy Sciences, Division of Chemical Sciences, Geosciences, and Biosciences.

Kovarik, Libor↗
DOE OSTI2022

Neuromorphic Computing is Turing-Complete

Neuromorphic computing is a non-von Neumann computing paradigm that performs computation by emulating the human brain. Neuromorphic systems are extremely energy-efficient and known to consume thousands of times less power than CPUs and GPUs. They have the potential to drive critical use cases such as autonomous vehicles, edge computing and internet of things in the future. For this reason, they are sought to be an indispensable part of the future computing landscape. Neuromorphic systems are mainly used for spike-based machine learning applications, although there are some non-machine learning applications in graph theory, differential equations, and spike-based simulations. These applications suggest that neuromorphic computing might be capable of general-purpose computing. However, general-purpose computability of neuromorphic computing has not been established yet. In this work, we prove that neuromorphic computing is Turing-complete and therefore capable of general-purpose computing. Specifically, we present a model of neuromorphic computing, with just two neuron parameters (threshold and leak), and two synaptic parameters (weight and delay). We devise neuromorphic circuits for computing all the μ-recursive functions (i.e., constant, successor and projection functions) and all the μ-recursive operators (i.e., composition, primitive recursion and minimization operators). Given that the μ-recursive functions and operators are precisely the ones that can be computed using a Turing machine, this work establishes the Turing-completeness of neuromorphic computing.

Date, Prasanna↗
DOE OSTI2024

PANDORA: A Parallel Dendrogram Construction Algorithm for Single Linkage Clustering on GPU

This paper introduces Pandora, a parallel algorithm for computing dendrograms, the hierarchical cluster trees for single linkage clustering (SLC). Current parallel approaches construct dendrograms by partitioning a minimum spanning tree and removing edges. However, they struggle with skewed, hard-to-parallelize real-world dendrograms. Consequently, computing dendrograms is the sequential bottleneck in HDBSCAN*[21], a popular SLC variant. Pandora uses recursive tree contraction to address this limitation. Pandora contracts nodes to construct progressively smaller trees. It computes the smallest contracted dendrogram and expands it by inserting contracted edges. This recursive strategy is highly parallel, skew-independent, work-optimal, and well-suited for GPUs and multicores. We develop a performance portable implementation of Pandora in Kokkos[31] and evaluate its performance on multicore CPUs and multi-vendor GPUs (e.g., Nvidia, AMD) for dendrogram construction in HDBSCAN*. Multithreaded Pandora is 2.2x faster than the current best-multithreaded implementation. Our GPU version achieves 6-20x speedup on AMD GPUs and 10-37x on NVIDIA GPUs over multithreaded Pandora. Pandora removes HDBSCAN*’s sequential bottleneck, greatly boosting efficiency, particularly with GPUs.

Sao, Piyush↗
DOE OSTI2020

Mobile Sensing for Wind Field Estimation in Wind Farms: Preprint

This paper introduces a novel approach for estimating the wind field over an entire wind farm using a mobile sensor to collect limited amounts of data. The proposed method estimates the boundary conditions of a simplified turbine wake model by computing the model sensitivity matrix and using a recursive least-squares algorithm to recover the model parameters from the wind field measurements. To address the fact that it is not practical to take measurements across the entire wind farm, the proposed method classifies each area on the map based on its sensitivity to parameter variations. This classification is then used to generate a suitable path for a mobile sensor, which is charged with collecting data for the recursive least-squares algorithm. The proposed framework can successfully estimate the model boundary conditions using just the measurements collected along the path of the mobile sensor. This preliminary result paves the way for using real-time wind field estimates for the coordinated control of all the turbines within a wind farm.

estimation↗
DOE OSTI2021

Renewable energy integration and system operation challenge: control and optimization of millions of devices

The electric power infrastructure, originally designed and built on large-scale power plants, is evolving into a more resilient power generation and delivery system in which millions of smaller units of distributed energy generation resources units will be installed in sub-transmission and distribution networks. In order to control, manage and optimize the future grid, a hierarchical design is presented in this chapter which enables the distributed control on grid edge while inheriting the existing centralized control structure. This layered design of large-scale power system operation and control uses the following principle: reactive power control is treated as a primary control for voltage stability, and the real power control is primarily a grid-level control but can also be a supplementary control for voltage support in the case of insufficient reactive power control capacity. For the purpose of active control and operation at the distribution level, a recursive power network model is derived from nodal injection and branch power flow models. Based on the model, the proposed algorithms of hierarchical control, grid-edge inference and dynamic hosting allowance are developed and presented for multi-level controlled operation. And, a co-simulation architecture of integrated T&D system is presented to validate and demonstrate the feasibility and scalability of proposed algorithms.

Xu, Ying↗
DOE OSTI2020

Quantification of High‐Temperature Transition Al 2 O 3 and Their Phase Transformations**

Abstract High‐temperature treatment of γ‐Al 2 O 3 can lead to a series of polymorphic transformations, including the formation of δ‐Al 2 O 3 and θ‐Al 2 O 3 . Quantification of the microstructure in the range where δ‐ and θ‐Al 2 O 3 are formed represents a formidable challenge, as both phases accommodate a high degree of structural disorder. In this work, we explore the use of an XRD recursive‐stacking formalism for the quantification of high‐temperature transition aluminas. We formulate the recursive‐stacking methodology for modelling of disorder in δ‐Al 2 O 3 and twinning in θ‐Al 2 O 3 and show that explicitly accounting for the disorder is necessary to reliably model the XRD patterns of high‐temperature transition alumina. We also use the recursive stacking approach to study phase transformation during high‐temperature (1050 °C) treatment. We show that the two different intergrowth modes of δ‐Al 2 O 3 have different transformation characteristics and that a significant portion of δ‐Al 2 O 3 is stabilized with θ‐Al 2 O 3 even after prolonged high‐temperature exposures.

Kovarik, Libor↗
DOE OSTI2021

Mixed Precision Fermi-Operator Expansion on Tensor Cores from a Machine Learning Perspective

Here we present a second-order recursive Fermi-operator expansion scheme using mixed precision floating point operations to perform electronic structure calculations using tensor core units. A performance of over 100 teraFLOPs is achieved for half-precision floating point operations on Nvidia’s A100 tensor core units. The second-order recursive Fermi-operator scheme is formulated in terms of a generalized, differentiable deep neural network structure, which solves the quantum mechanical electronic structure problem. We demonstrate how this network can be accelerated by optimizing the weight and bias values to substantially reduce the number of layers required for convergence. We also show how this machine learning approach can be used to optimize the coefficients of the recursive Fermi-operator expansion to accurately represent the fractional occupation numbers of the electronic states at finite temperatures.

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

On amplitudes and field redefinitions

We derive an off-shell recursion relation for correlators that holds at all loop orders. This allows us to prove how generalized amplitudes transform under generic field redefinitions, starting from an assumed behavior of the one-particle-irreducible effective action. The form of the recursion relation resembles the operation of raising the rank of a tensor by acting with a covariant derivative. This inspires a geometric interpretation, whose features and flaws we investigate.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Adaptive Urban Traffic Signal Control for Multiple Intersections: An LQR Approach

Traffic congestion leads to severe problems especially in urban traffic networks. It increases the chance of accidents, energy waste, and social costs. In order to address these problems, an adaptive linear quadratic regulator (LQR) approach is developed for traffic signal control at multiple intersections in an urban area. The proposed method controls the green time of the traffic signals to reduce traffic congestion and smooth traffic flow. Real-world data from vision-based traffic sensors are used to build the traffic network model, which mimics the real-world traffic behavior. In addition, the proposed control utilizes recursive least square parameter estimation, which is capable of tracking dynamic changes in traffic conditions. Simulation of Urban MObility (SUMO) is used to analyze the efficacy of the proposed method. Results of the simulation show that the proposed method outperforms pretimed control in various aspects.

adaptive LQR control↗
DOE OSTI2021

Local Power-Voltage Sensitivity and Thevenin Impedance Estimation from Phasor Measurements

This paper describes how to use voltage phasor measurements to produce a sensitivity matrix that describes how real and reactive power injections at a node on a distribution network affect the local voltage magnitude and angle. Rather than estimating the sensitivity directly, the voltage phasor measurements and power commands/measurements are used to estimate the unbalanced, three-phase Thevenin impedance. The Thevenin impedance estimation is conducted using recursive least squares on temporal difference measurements. The Thevenin impedance and voltage phasor measurement are then used to build the local power-voltage sensitivity matrix with the closed form expression for the Jacobian of the power flow manifold. Hardware-in-the-loop simulations with phasor measurement units providing real phasor measurements are used to evaluate the recursive temporal difference Thevenin impedance estimation and Thevenin-based power-voltage sensitivity methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Scattering amplitudes and simple canonical forms for simple polytopes

We provide an efficient recursive formula to compute the canonical forms of arbitrary d-dimensional simple polytopes, which are convex polytopes such that every vertex lies precisely on d facets. For illustration purposes, we explicitly derive recursive formulae for the canonical forms of Stokes polytopes, which play a similar role for a theory with quartic interaction as the Associahedron does in planar bi-adjoint φ 3 theory. As a by-product, our formula also suggests a new way to obtain the full planar amplitude in φ 4 theory by taking suitable limits of the canonical forms of constituent Stokes polytopes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Linking the singularities of cosmological correlators

Much of the structure of cosmological correlators is controlled by their singularities, which in turn are fixed in terms of flat-space scattering amplitudes. An important challenge is to interpolate between the singular limits to determine the full correlators at arbitrary kinematics. This is particularly relevant because the singularities of correlators are not directly observable, but can only be accessed by analytic continuation. In this paper, we study rational correlators — including those of gauge fields, gravitons, and the inflaton — whose only singularities at tree level are poles and whose behavior away from these poles is strongly constrained by unitarity and locality. We describe how unitarity translates into a set of cutting rules that consistent correlators must satisfy, and explain how this can be used to bootstrap correlators given information about their singularities. We also derive recursion relations that allow the iterative construction of more complicated correlators from simpler building blocks. In flat space, all energy singularities are simple poles, so that the combination of unitarity constraints and recursion relations provides an efficient way to bootstrap the full correlators. In many cases, these flat-space correlators can then be transformed into their more complex de Sitter counterparts. As an example of this procedure, we derive the correlator associated to graviton Compton scattering in de Sitter space, though the methods are much more widely applicable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗