SEARCH · Engineering Papers

Results for “Recursion”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

All sources NASA NTRS DOE OSTI

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 OSTI2017

A note on NMHV form factors from the Graßmannian and the twistor string

In this note we investigate Graßmannian formulas for form factors of the chiral part of the stress-tensor multiplet in N = 4 superconformal Yang-Mills theory. We present an all-n contour for the G(3, n + 2) Graßmannian integral of NMHV form factors derived from on-shell diagrams and the BCFW recursion relation. In addition, we study other G(3, n + 2) formulas obtained from the connected prescription introduced recently. We find a recursive expression for all n and study its properties. For n ≥ 6, our formula has the same recursive structure as its amplitude counterpart, making its soft behaviour manifest. Finally, we explore the connection between the two Graßmannian formulations, using the global residue theorem, and find that it is much more intricate compared to scattering amplitudes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2012

Prognostic Indexes for Brain Metastases: Which Is the Most Powerful?

Purpose: The purpose of the present study was to compare the prognostic indexes (PIs) of patients with brain metastases (BMs) treated with whole brain radiotherapy (WBRT) using an artificial neural network. This analysis is important, because it evaluates the prognostic power of each PI to guide clinical decision-making and outcomes research. Methods and Materials: A retrospective prognostic study was conducted of 412 patients with BMs who underwent WBRT between April 1998 and March 2010. The eligibility criteria for patients included having undergone WBRT or WBRT plus neurosurgery. The data were analyzed using the artificial neural network. The input neural data consisted of all prognostic factors included in the 5 PIs (recursive partitioning analysis, graded prognostic assessment [GPA], basic score for BMs, Rotterdam score, and Germany score). The data set was randomly divided into 300 training and 112 testing examples for survival prediction. All 5 PIs were compared using our database of 412 patients with BMs. The sensibility of the 5 indexes to predict survival according to their input variables was determined statistically using receiver operating characteristic curves. The importance of each variable from each PI was subsequently evaluated. Results: The overall 1-, 2-, and 3-year survival rate was 22%, 10.2%, and 5.1%, respectively. All classes of PIs were significantly associated with survival (recursive partitioning analysis, P < .0001; GPA, P < .0001; basic score for BMs, P = .002; Rotterdam score, P = .001; and Germany score, P < .0001). Comparing the areas under the curves, the GPA was statistically most sensitive in predicting survival (GPA, 86%; recursive partitioning analysis, 81%; basic score for BMs, 79%; Rotterdam, 73%; and Germany score, 77%; P < .001). Among the variables included in each PI, the performance status and presence of extracranial metastases were the most important factors. Conclusion: A variety of prognostic models describe the survival of patients with BMs to a more or less satisfactory degree. Among the 5 PIs evaluated in the present study, GPA was the most powerful in predicting survival. Additional studies should include emerging biologic prognostic factors to improve the sensibility of these PIs.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

DOE OSTI2017

Multi-fidelity Gaussian process regression for prediction of random fields

We propose a new multi-fidelity Gaussian process regression (GPR) approach for prediction of random fields based on observations of surrogate models or hierarchies of surrogate models. Our method builds upon recent work on recursive Bayesian techniques, in particular recursive co-kriging, and extends it to vector-valued fields and various types of covariances, including separable and non-separable ones. The framework we propose is general and can be used to perform uncertainty propagation and quantification in model-based simulations, multi-fidelity data fusion, and surrogate-based optimization. We demonstrate the effectiveness of the proposed recursive GPR techniques through various examples. Specifically, we study the stochastic Burgers equation and the stochastic Oberbeck–Boussinesq equations describing natural convection within a square enclosure. In both cases we find that the standard deviation of the Gaussian predictors as well as the absolute errors relative to benchmark stochastic solutions are very small, suggesting that the proposed multi-fidelity GPR approaches can yield highly accurate results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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 OSTI2015

Generalized and efficient algorithm for computing multipole energies and gradients based on Cartesian tensors

Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green’s function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4–16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A software library based on this algorithm has been implemented in C++11 and has been released.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2015

CilkSpec: Optimistic Concurrency for Cilk

Recursive parallel programming models such as Cilk strive to simplify the task of parallel programming by enabling a simple divide-and-conquer model of programming. This model is effective in re- cursively partitioning work into smaller parts and combining their results. However, recursive work partitioning can impose additional constraints on concurrency than is implied by the true dependences in a program. In this paper, we present a speculation-based approach to alleviate the concurrency constraints imposed by such recursive parallel programs. We design a runtime infrastructure that supports speculative execution and a predictor to accurately learn and identify opportunities to relax extraneous concurrency constraints. Experimental evaluation demonstrates that speculative relaxation of concurrency constraints can deliver gains of up to 1.6× on 30 cores over baseline Cilk.

cilk↗

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 OSTI2019

Soft bootstrap and supersymmetry

The soft bootstrap is an on-shell method to constrain the landscape of effective field theories (EFTs) of massless particles via the consistency of the low-energy S-matrix. Given assumptions on the on-shell data (particle spectra, linear symmetries, and low-energy theorems), the soft bootstrap is an efficient algorithm for determining the possible consistency of an EFT with those properties. The implementation of the soft bootstrap uses the recently discovered method of soft subtracted recursion. We derive a precise criterion for the validity of these recursion relations and show that they fail exactly when the assumed symmetries can be trivially realized by independent operators in the effective action. We use this to show that the possible pure (real and complex) scalar, fermion, and vector exceptional EFTs are highly constrained. Next, we prove how the soft behavior of states in a supermultiplet must be related and illustrate the results in extended supergravity. We demonstrate the power of the soft bootstrap in two applications. First, for the $ \mathcal{N} $ = 1 and $ \mathcal{N} $ = 2 C P 1 nonlinear sigma models, we show that on-shell constructibility establishes the emergence of accidental IR symmetries. This includes a new on-shell perspective on the interplay between $ \mathcal{N} $ = 2 supersymmetry, low-energy theorems, and electromagnetic duality. We also show that $ \mathcal{N} $ = 2 supersymmetry requires 3-point interactions with the photon that make the soft behavior of the scalar O (1) instead of vanishing, despite the underlying symmetric coset. Second, we study Galileon theories, including aspects of supersymmetrization, the possibility of a vector-scalar Galileon EFT, and the existence of higher-derivative corrections preserving the enhanced special Galileon symmetry. The latter is addressed both by soft bootstrap and by application of double-copy/KLT relations applied to higher-derivative corrections of chiral perturbation theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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 OSTI2018

The AdS 3 propagator and the fate of locality

We recently used Virasoro symmetry considerations to propose an exact formula for a bulk proto-field φ in AdS 3 . In this paper we study the propagator <φφ>. We show that many techniques from the study of conformal blocks can be generalized to compute it, including the semiclassical monodromy method and both forms of the Zamolodchikov recursion relations. When the results from recursion are expanded at large central charge, they match gravitational perturbation theory for a free scalar field coupled to gravity in our chosen gauge. We find that although the propagator is finite and well-defined at long distances, its perturbative expansion in G N = 3 2 c exhibits UV/IR mixing effects. If we nevertheless interpret <φφ> as a probe of bulk locality, then when G N m ϕ ≪ 1 locality breaks down at the new short-distance scale σ ∗ ∼ G N R A d S 3 4 . For φ with very large bulk mass, or at small central charge, bulk locality fails at the AdS length scale. In all cases, locality ‘breakdown’ manifests as singularities or branch cuts at spacelike separation arising from non-perturbative quantum gravitational effects.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2016

Hawking from Catalan

The Virasoro algebra determines all ‘graviton’ matrix elements in AdS 3 /CFT 2 . We study the explicit exchange of any number of Virasoro gravitons between heavy and light CFT 2 operators at large central charge. These graviton exchanges can be written in terms of new on-shell tree diagrams, organized in a perturbative expansion in h H /c, the heavy operator dimension divided by the central charge. The Virasoro vacuum conformal block, which is the sum of all the tree diagrams, obeys a differential recursion relation generalizing that of the Catalan numbers. Here, we use this recursion relation to sum the on-shell diagrams to all orders, computing the Virasoro vacuum block. Extrapolating to large h H /c determines the Hawking temperature of a BTZ black hole in dual AdS 3 theories.

1/N expansion↗

DOE OSTI2019

Constructing N$$ \mathcal{N} $$ = 4 Coulomb branch superamplitudes

We study scattering amplitudes of massive BPS states on the Coulomb branch of 4dN = 4 super-Yang-Mills, utilising a little group covariant on-shell superspace for massive particles. Super-BCFW recursion for massive amplitudes is constructed and its validity is proven for all Coulomb branch superamplitudes. We then determine the exact three-particle superamplitudes for massive states. These ingredients allow us to explicitly compute the four- and five-particle superamplitudes, which is the first non-trivial usage of BCFW recursion for amplitudes with entirely massive external states. The manifest little group covariance helps clarify both the role of special kinematic properties of BPS states and the organizational structures of the superamplitudes.

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↗

DOE OSTI2023

Pileup and Infrared Radiation Annihilation (PIRANHA): a paradigm for continuous jet grooming

Jet grooming is an important strategy for analyzing relativistic particle collisions in the presence of contaminating radiation. Most jet grooming techniques introduce hard cutoffs to remove soft radiation, leading to discontinuous behavior and associated experimental and theoretical challenges. In this paper, we introduce Pileup and Infrared Radiation Annihilation (Piranha), a paradigm for continuous jet grooming that overcomes the discontinuity and infrared sensitivity of hard-cutoff grooming procedures. We motivate Piranha from the perspective of optimal transport and the Energy Mover’s Distance and review Apollonius Subtraction and Iterated Voronoi Subtraction as examples of Piranha-style grooming. We then introduce a new tree-based implementation of Piranha, Recursive Subtraction, with reduced computational costs. Finally, we demonstrate the performance of Recursive Subtraction in mitigating sensitivity to soft distortions from hadronization and detector effects, and additive contamination from pileup and the underlying event.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2018

Jet charge and machine learning

Modern machine learning techniques, such as convolutional, recurrent and recursive neural networks, have shown promise for jet substructure at the Large Hadron Collider. For example, they have demonstrated effectiveness at boosted top or W boson identification or for quark/gluon discrimination. We explore these methods for the purpose of classifying jets according to their electric charge. We find that both neural networks that incorporate distance within the jet as an input and boosted decision trees including radial distance information can provide significant improvement in jet charge extraction over current methods. Specifically, convolutional, recurrent, and recursive networks can provide the largest improvement over traditional methods, in part by effectively utilizing distance within the jet or clustering history. Furthermore, the advantages of using a fixed-size input representation (as with the CNN) or a small input representation (as with the RNN) suggest that both convolutional and recurrent networks will be essential to the future of modern machine learning at colliders.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗