Engineering Papers⌕ Search

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.

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

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Simple recursion relations for general field theories

On-shell methods offer an alternative definition of quantum field theory at tree-level, replacing Feynman diagrams with recursion relations and interaction vertices with a handful of seed scattering amplitudes. In this paper we determine the simplest recursion relations needed to construct a general four-dimensional quantum field theory of massless particles. For this purpose we define a covering space of recursion relations which naturally generalizes all existing constructions, including those of BCFW and Risager. The validity of each recursion relation hinges on the large momentum behavior of an n-point scattering amplitude under an m-line momentum shift, which we determine solely from dimensional analysis, Lorentz invariance, and locality. We show that all amplitudes in a renormalizable theory are 5-line constructible. Amplitudes are 3-line constructible if an external particle carries spin or if the scalars in the theory carry equal charge under a global or gauge symmetry. Remarkably, this implies the 3-line constructibility of all gauge theories with fermions and complex scalars in arbitrary representations, all supersymmetric theories, and the standard model. Moreover, all amplitudes in non-renormalizable theories without derivative interactions are constructible; with derivative interactions, a subset of amplitudes is constructible. We illustrate our results with examples from both renormalizable and non-renormalizable theories. In conclusion, our study demonstrates both the power and limitations of recursion relations as a self-contained formulation of quantum field theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Recursive Soft Drop

We introduce a new jet substructure technique called Recursive Soft Drop, which generalizes the Soft Drop algorithm to have multiple grooming layers. Like the original Soft Drop method, this new recursive variant traverses a jet clustering tree to remove soft wide-angle contamination. By enforcing the Soft Drop condition N times, Recursive Soft Drop improves the jet mass resolution for boosted hadronic objects like W bosons, top quarks, and Higgs bosons. We further show that this improvement in mass resolution persists when including the effects of pileup, up to large pileup multiplicities. In the limit that N goes to infinity, the resulting groomed jets formally have zero catchment area. As an alternative approach, we present a bottom-up version of Recursive Soft Drop which, in its local form, is similar to Recursive Soft Drop and which, in its global form, can be used to perform event-wide grooming.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

An Ising Spin-2 Model on Generalized Recursive Lattice: a Monte Carlo Study

The magnetic properties of Ising spin-2 model on recursive p-polygonal structures are studied using Monte Carlo simulations. The thermal magnetization and magnetic susceptibility of recursive 1-, 2-, 3-, and 4-polygonal structures have been terminated. The variation of magnetization and magnetic susceptibility of recursive 2-polygonal structures for several external magnetic field and the variation of magnetization and magnetic susceptibility versus the crystal field and temperatures of recursive 1-, 2-, 3-, and 4-polygonal structures are given. Finally, the magnetic hysteresis cycle of recursive 1-, 2-, 3-, and 4-polygonal structures are obtained and for different temperatures with 2-polygonal structures. It is shown that the reduced transition temperature increases with increasing the p-polygonal structures and decreases with increasing the absolute value of crystal field. The magnetic coercive field increases with increasing the p-polygonal structures and decreases with increasing the temperature values. The superparamagnetism behavior is observed in our system at around reduced transition temperature.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Recursive Use of the Short-Time Fast Fourier Transform for Signature Analysis in Continuous Processes

Although a nuclear reactor is a hostile environment for sensing and electrical communications, the reactor core is amenable to acoustic communication. An acoustic measurement infrastructure (AMI) has been installed in the Advanced Test Reactor (ATR) to record acoustic signals that can capture its different operating regimes. AMI uses coolant pumps as continuous signal sources, coolant and structural components as transmission lines, and accelerometers to capture system motion. A recursive signal processing technique based on the short-time fast Fourier transform (STFFT) for continuous processes provides unique signatures for diagnostic and prognostic analyses from the system motion data. Here this article presents a recursive STFFT methodology that processes acoustic signals from continuous industrial processes. The article first discusses the initial STFFT use with simulated data to elucidate the basic principles necessary to understand and interpret the STFFT results from actual pump vibration data. Each repetitive use of the STFFT on pump vibration data using the results from the prior STFFT processing will generate additional complimentary time-frequency-based signatures. These signatures are generated by the coolant pumps operating under different process conditions. After each use of the STFFT, the resulting signatures provide exemplary examples of the diversity and intuitive nature of recursively using the STFFT. This article focuses on recursively using the STFFT to provide numerous complimentary and diverse signatures that will ultimately be inputs for machine learning algorithms that provide predictive data analytics. The intuitive nature of the information and signatures from recursive STFFT processing will also bring intuitive interpretation capabilities to machine learning and predictive data analytic techniques.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2017

One-particle many-body Green’s function theory: Algebraic recursive definitions, linked-diagram theorem, irreducible-diagram theorem, and general-order algorithms

A thorough analytical and numerical characterization of the whole perturbation series of one-particle many-body Green’s function (MBGF) theory is presented in a pedagogical manner. Three distinct but equivalent algebraic (first-quantized) recursive definitions of the perturbation series of the Green’s function are derived, which can be combined with the well-known recursion for the self-energy. Six general-order algorithms of MBGF are developed, each implementing one of the three recursions, the ΔMPn method (where n is the perturbation order) [S. Hirata et al., J. Chem. Theory Comput. 11, 1595 (2015)], the automatic generation and interpretation of diagrams, or the numerical differentiation of the exact Green’s function with a perturbation-scaled Hamiltonian. They all display the identical, nondivergent perturbation series except ΔMPn, which agrees with MBGF in the diagonal and frequency-independent approximations at 1 ≤ n ≤ 3 but converges at the full-configuration-interaction (FCI) limit at n=∞ (unless it diverges). Numerical data of the perturbation series are presented for Koopmans and non-Koopmans states to quantify the rate of convergence towards the FCI limit and the impact of the diagonal, frequency-independent, or ΔMPn approximation. The diagrammatic linkedness and thus size-consistency of the one-particle Green’s function and self-energy are demonstrated at any perturbation order on the basis of the algebraic recursions in an entirely time-independent (frequency-domain) framework. The trimming of external lines in a one-particle Green’s function to expose a self-energy diagram and the removal of reducible diagrams are also justified mathematically using the factorization theorem of Frantz and Mills. Equivalence of ΔMPn and MBGF in the diagonal and frequency-independent approximations at 1 ≤ n ≤ 3 is algebraically proven, also ascribing the differences at n = 4 to the so-called semi-reducible and linked-disconnected diagrams

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

Composite fermions in Fock space: Operator algebra, recursion relations, and order parameters

We develop recursion relations, in particle number, for all (unprojected) Jain composite fermion (CF) wave functions. These recursions generalize a similar recursion originally written down by Read for Laughlin states, in mixed first-second quantized notation. In contrast, our approach is purely second-quantized, giving rise to an algebraic, “pure guiding center” definition of CF states that de-emphasizes first quantized many-body wave functions. Key to the construction is a second-quantized representation of the flux attachment operator that maps any given fermion state to its CF counterpart. An algebra of generators of edge excitations is identified. In particular, in those cases where a well-studied parent Hamiltonian exists, its properties can be entirely understood in the present framework, and the identification of edge state generators can be understood as an instance of “microscopic bosonization.” Here, the intimate connection of Read's original recursion with “nonlocal order parameters” generalizes to the present situation, and we are able to give explicit second-quantized formulas for nonlocal order parameters associated with CF states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2016

On Fusing Recursive Traversals of K-d Trees

Loop fusion is a key program transformation for data locality optimization that is implemented in production compilers. But optimizing compilers currently cannot exploit fusion opportunities across a set of recursive tree traversal computations with producer-consumer relationships. In this paper, we develop a compile-time approach to dependence characterization and program transformation to enable fusion across recursively specified traversals over k-ary trees. We present the FuseT source-to-source code transformation framework to automatically generate fused composite recursive operators from an input program containing a sequence of primitive recursive operators. We use our framework to implement fused operators for MADNESS, Multiresolution Adaptive Numerical Environment for Scientific Simulation. We show that locality optimization through fusion can offer more than an order of magnitude performance improvement.

data locality↗
DOE OSTI2014

Haydock’s recursive solution of self-adjoint problems. Discrete spectrum

Haydock’s recursive solution is shown to underline a number of different concepts such as (i) quasi-exactly solvable models, (ii) exactly solvable models, (iii) three-term recurrence solutions based on Schweber’s quantization criterion in Hilbert spaces of entire analytic functions, and (iv) a discrete quantum mechanics of Odake and Sasaki. A recurrent theme of Haydock’s recursive solution is that the spectral properties of any self-adjoint problem can be mapped onto a corresponding sequence of polynomials (p{sub n}(E)) in energy variable E. The polynomials (p{sub n}(E)) are orthonormal with respect to the density of states n{sub 0}(E) and energy eigenstate |E〉 is the generating function of (p{sub n}(E)). The generality of Haydock’s recursive solution enables one to see the different concepts from a unified perspective and mutually benefiting from each other. Some results obtained within the particular framework of any of (i) to (iv) may have much broader significance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Casimir recursion relations for general conformal blocks

We study the structure of series expansions of general spinning conformal blocks. We find that the terms in these expansions are naturally expressed by means of special functions related to matrix elements of Spin(d) representations in Gelfand-Tsetlin basis, of which the Gegenbauer polynomials are a special case. We study the properties of these functions and explain how they can be computed in practice. We show how the Casimir equation in Dolan-Osborn coordinates leads to a simple one-step recursion relation for the coefficients of the series expansion of general spinning conformal block. The form of this recursion relation is determined by 6j symbols of Spin(d – 1). In particular, it can be written down in closed form in d = 3, d = 4, for seed blocks in general dimensions, or in any other situation when the required 6j symbols can be computed. As a result, we work out several explicit examples and briefly discuss how our recursion relation can be used for efficient numerical computation of general conformal blocks.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Gauged soft recursion: on-shell construction of Goldstone-gauge amplitudes

We present a new on-shell recursion relation for scattering amplitudes involving Nambu-Goldstone bosons with a gauged unbroken symmetry. A central challenge is that gauge interactions break Adler’s zero condition for charged scalars, invalidating the standard soft recursion. To overcome this, we introduce a “gauged soft recursion” that leverages the soft theorems of the gauge bosons themselves, combined with a novel decomposition of amplitudes into gauge-invariant components where Adler’s zero is partially restored. The formalism, which also incorporates internal gauge bosons via angular momentum constraints, enables the systematic construction of tree-level amplitudes with arbitrary numbers of Goldstone bosons and gauge bosons in both Abelian and non-Abelian theories, as we demonstrate with explicit examples.

Chiral Lagrangian↗
DOE OSTI2025

Smooth splitting and zeros from on-shell recursion

We describe a new approach to understanding the origins of recently discovered “hidden zeros” and “smooth splitting” of tree-level amplitudes in Tr ϕ 3 , Non-Linear Sigma Model (NLSM), Yang-Mill-Scalar (YMS) and the special Galileon. Introducing a new type of linear shift in kinematic space we demonstrate that the mysterious splitting formulae follow from a simple contour integration argument in the style of on-shell recursion. The argument makes use of only standard notions of tree-level factorization on propagators, but assumes improved UV behavior in the form of the absence of a residue at infinity. In the case of Tr ϕ 3 and NLSM this is proven by identifying our shift as a special case of a more general construction called a g-vector shift; in the case of YMS it remains an unproven conjecture. This recursive perspective leads to numerous new results: we derive generalizations of the splitting formulae on more relaxed near-zero kinematics, including interesting new kinematic limits in which the amplitude splits into a triple-product; we also demonstrate that the uncolored special Galileon model has improved UV scaling and hence also splits. We also investigate the possible realization of hidden zeros in four dimensions. The conditions under which the dimensionality constraints are compatible with zero kinematics is investigated in detail for Tr ϕ 3 and YMS; for the latter we find they can be realized only with certain restrictions on external helicity states. The realizable 4d zeros are proven by a similar recursive argument based on BCFW and is found to generalize to a new class of intrinsically 4d “helicity zeros” present in all sectors of YM and also gravity.

effective field theories↗
DOE OSTI2023

All-order celestial OPE from on-shell recursion

We determine tree level, all-order celestial operator product expansions (OPEs) of gluons and gravitons in the maximally helicity violating (MHV) sector. We start by obtaining the all-order collinear expansions of MHV amplitudes using the inverse soft recursion relations that they satisfy. These collinear expansions are recast as celestial OPE expansions in bases of momentum as well as boost eigenstates. This shows that inverse soft recursion for MHV amplitudes is dual to OPE recursion in celestial conformal field theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Finite-temperature many-body perturbation theory for electrons: Algebraic recursive definitions, second-quantized derivation, linked-diagram theorem, general-order algorithms, and grand canonical and canonical ensembles

A comprehensive and detailed account is presented for the finite-temperature many-body perturbation theory for electrons that expands in power series all thermodynamic functions on an equal footing. Algebraic recursions in the style of the Rayleigh–Schrödinger perturbation theory are derived for the grand potential, chemical potential, internal energy, and entropy in the grand canonical ensemble and for the Helmholtz energy, internal energy, and entropy in the canonical ensemble, leading to their sum-over-states analytical formulas at any arbitrary order. For the grand canonical ensemble, these sum-over-states formulas are systematically transformed to sum-over-orbitals reduced analytical formulas by the quantum-field-theoretical techniques of normal-ordered second quantization and Feynman diagrams extended to finite temperature. It is found that the perturbation corrections to energies entering the recursions have to be treated as a nondiagonal matrix, whose off-diagonal elements are generally nonzero within a subspace spanned by degenerate Slater determinants. They give rise to a unique set of linked diagrams—renormalization diagrams—whose resolvent lines are displaced upward, which are distinct from the well-known anomalous diagrams of which one or more resolvent lines are erased. A linked-diagram theorem is introduced that proves the size-consistency of the finite-temperature many-body perturbation theory at any order. General-order algorithms implementing the recursions establish the convergence of the perturbation series toward the finite-temperature full-configuration-interaction limit unless the series diverges. As a result, the normal-ordered Hamiltonian at finite temperature sheds light on the relationship between the finite-temperature Hartree–Fock and first-order many-body perturbation theories.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2017

Cache Locality Optimization for Recursive Programs

We present an approach to optimize the cache locality for recursive programs by dynamically splicing--recursively interleaving--the execution of distinct function invocations. By utilizing data effect annotations, we identify concurrency and data reuse opportunities across function invocations and interleave them to reduce reuse distance. We present algorithms that efficiently track effects in recursive programs, detect interference and dependencies, and interleave execution of function invocations using user-level (non-kernel) lightweight threads. To enable multi-core execution, a program is parallelized using a nested fork/join programming model. Our cache optimization strategy is designed to work in the context of a random work stealing scheduler. We present an implementation using the MIT Cilk framework that demonstrates significant improvements in sequential and parallel performance, competitive with a state-of-the-art compile-time optimizer for loop programs and a domain- specific optimizer for stencil programs.

Lifflander, Jonathan↗
DOE OSTI2018

On Defense Strategies for Recursive System of Systems Using Aggregated Correlations

We consider a class of Recursive System of Systems (RSoS), wherein systems are recursively defined and the basic systems at finest level are composed of discrete cyber and physical components. This formulation captures the models of systems that are adaptively refined to account for their varied structure, such as sites of a heterogenous distributed computing infrastructure. The components can be disrupted by cyber of physical means, and can also be suitably reinforced to survive the attacks. We characterize the disruptions at each level of recursion using aggregate failure correlation functions that specify the conditional failure probability of RSoS given the failure of an individual system at that level. At finest levels, the survival probabilities of basic systems satisfy simple product-form, first order differential conditions using the multiplier functions, which generalize conditions based on contest success functions and statistical independence of component survival probabilities. We formulate the problem of ensuring the performance of RSoS as a game between an attacker and a provider, each with a utility function composed of a survival probability term and a cost term, both expressed in terms of the number of basic system components attacked and reinforced. We derive sensitivity functions at Nash Equilibrium that highlight the dependence of survival probabilities of systems on cost terms, correlation functions, and their partial derivatives. We apply these results to a simplified model of distributed high-performance computing infrastructures.

Rao, Nageswara↗
DOE OSTI2014

An Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems

Block tridiagonal systems of linear equations arise in a wide variety of scientific and engineering applications. Recursive doubling algorithm is a well-known prefix computation-based numerical algorithm that requires O(M^3(N/P + log P)) work to compute the solution of a block tridiagonal system with N block rows and block size M on P processors. In real-world applications, solutions of tridiagonal systems are most often sought with multiple, often hundreds and thousands, of different right hand sides but with the same tridiagonal matrix. Here, we show that a recursive doubling algorithm is sub-optimal when computing solutions of block tridiagonal systems with multiple right hand sides and present a novel algorithm, called the accelerated recursive doubling algorithm, that delivers O(R) improvement when solving block tridiagonal systems with R distinct right hand sides. Since R is typically about 100 1000, this improvement translates to very significant speedups in practice. Detailed complexity analyses of the new algorithm with empirical confirmation of runtime improvements are presented. To the best of our knowledge, this algorithm has not been reported before in the literature.

Seal, Sudip K↗
DOE OSTI2022

Application of Recursive Estimation to Heat Tracing for Groundwater/Surface‐Water Exchange

Abstract We present and demonstrate a recursive‐estimation framework to infer groundwater/surface‐water exchange based on temperature time series collected at different vertical depths below the sediment/water interface. We formulate the heat‐transport problem as a state‐space model (SSM), in which the spatial derivatives in the convection/conduction equation are approximated using finite differences. The SSM is calibrated to estimate time‐varying specific discharge using the Extended Kalman Filter (EKF) and Extended Rauch‐Tung‐Striebel Smoother (ERTSS). Whereas the EKF is suited to real‐time (“online”) applications and uses only the past and current measurements for estimation (filtering), the ERTSS is intended for near‐real time or batch‐processing (“offline”) applications and uses a window of data for batch estimation (smoothing). The two algorithms are demonstrated with synthetic and field‐experimental data and are shown to be efficient and rapid for the estimation of time‐varying flux over seasonal periods; further, the recursive approaches are effective in the presence of rapidly changing flux and (or) nonperiodic thermal boundary conditions, both of which are problematic for existing approaches to heat tracing of time‐varying groundwater/surface‐water exchange.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2012

The recursion relation in Lagrangian perturbation theory

We derive a recursion relation in the framework of Lagrangian perturbation theory, appropriate for studying the inhomogeneities of the large scale structure of the universe. We use the fact that the perturbative expansion of the matter density contrast is in one-to-one correspondence with standard perturbation theory (SPT) at any order. This correspondence has been recently shown to be valid up to fourth order for a non-relativistic, irrotational and dust-like component. Assuming it to be valid at arbitrary (higher) order, we express the Lagrangian displacement field in terms of the perturbative kernels of SPT, which are itself given by their own and well-known recursion relation. We argue that the Lagrangian solution always contains more non-linear information in comparison with the SPT solution, (mainly) if the non-perturbative density contrast is restored after the displacement field is obtained.

79 ASTRONOMY AND ASTROPHYSICS↗