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
NASA NTRS1992

Experiments with recursive estimation in astronomical image processing

Recursive estimation concepts were applied to image enhancement problems since the 70's. However, very few applications in the particular area of astronomical image processing are known. These concepts were derived, for 2-dimensional images, from the well-known theory of Kalman filtering in one dimension. The historic reasons for application of these techniques to digital images are related to the images' scanned nature, in which the temporal output of a scanner device can be processed on-line by techniques borrowed directly from 1-dimensional recursive signal analysis. However, recursive estimation has particular properties that make it attractive even in modern days, when big computer memories make the full scanned image available to the processor at any given time. One particularly important aspect is the ability of recursive techniques to deal with non-stationary phenomena, that is, phenomena which have their statistical properties variable in time (or position in a 2-D image). Many image processing methods make underlying stationary assumptions either for the stochastic field being imaged, for the imaging system properties, or both. They will underperform, or even fail, when applied to images that deviate significantly from stationarity. Recursive methods, on the contrary, make it feasible to perform adaptive processing, that is, to process the image by a processor with properties tuned to the image's local statistical properties. Recursive estimation can be used to build estimates of images degraded by such phenomena as noise and blur. We show examples of recursive adaptive processing of astronomical images, using several local statistical properties to drive the adaptive processor, as average signal intensity, signal-to-noise and autocorrelation function. Software was developed under IRAF, and as such will be made available to interested users.

Busko, I.↗
NASA NTRS2005

Method for implementation of recursive hierarchical segmentation on parallel computers

A method, computer readable storage, and apparatus for implementing a recursive hierarchical segmentation algorithm on a parallel computing platform. The method includes setting a bottom level of recursion that defines where a recursive division of an image into sections stops dividing, and setting an intermediate level of recursion where the recursive division changes from a parallel implementation into a serial implementation. The segmentation algorithm is implemented according to the set levels. The method can also include setting a convergence check level of recursion with which the first level of recursion communicates with when performing a convergence check.

Tilton, James C.↗
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 ↗
NASA NTRS1988

Recursive mass matrix factorization and inversion: An operator approach to open- and closed-chain multibody dynamics

This report advances a linear operator approach for analyzing the dynamics of systems of joint-connected rigid bodies.It is established that the mass matrix M for such a system can be factored as M=(I+H phi L)D(I+H phi L) sup T. This yields an immediate inversion M sup -1=(I-H psi L) sup T D sup -1 (I-H psi L), where H and phi are given by known link geometric parameters, and L, psi and D are obtained recursively by a spatial discrete-step Kalman filter and by the corresponding Riccati equation associated with this filter. The factors (I+H phi L) and (I-H psi L) are lower triangular matrices which are inverses of each other, and D is a diagonal matrix. This factorization and inversion of the mass matrix leads to recursive algortihms for forward dynamics based on spatially recursive filtering and smoothing. The primary motivation for advancing the operator approach is to provide a better means to formulate, analyze and understand spatial recursions in multibody dynamics. This is achieved because the linear operator notation allows manipulation of the equations of motion using a very high-level analytical framework (a spatial operator algebra) that is easy to understand and use. Detailed lower-level recursive algorithms can readily be obtained for inspection from the expressions involving spatial operators. The report consists of two main sections. In Part 1, the problem of serial chain manipulators is analyzed and solved. Extensions to a closed-chain system formed by multiple manipulators moving a common task object are contained in Part 2. To retain ease of exposition in the report, only these two types of multibody systems are considered. However, the same methods can be easily applied to arbitrary multibody systems formed by a collection of joint-connected regid bodies.

Rodriguez, G.↗
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↗
NASA NTRS1986

Kalman filtering, smoothing and recursive robot arm forward and inverse dynamics

The inverse and forward dynamics problems for multi-link serial manipulators are solved by using recursive techniques from linear filtering and smoothing theory. The pivotal step is to cast the system dynamics and kinematics as a two-point boundary-value problem. Solution of this problem leads to filtering and smoothing techniques identical to the equations of Kalman filtering and Bryson-Frazier fixed time-interval smoothing. The solutions prescribe an inward filtering recursion to compute a sequence of constraint moments and forces followed by an outward recursion to determine a corresponding sequence of angular and linear accelerations. In addition to providing techniques to compute joint accelerations from applied joint moments (and vice versa), the report provides an approach to evaluate recursively the composite multi-link system inertia matrix and its inverse. The report lays the foundation for the potential use of filtering and smoothing techniques in robot inverse and forward dynamics and in robot control design.

Rodriguez, G.↗
NASA NTRS1987

Recursive inverse kinematics for robot arms via Kalman filtering and Bryson-Frazier smoothing

This paper applies linear filtering and smoothing theory to solve recursively the inverse kinematics problem for serial multilink manipulators. This problem is to find a set of joint angles that achieve a prescribed tip position and/or orientation. A widely applicable numerical search solution is presented. The approach finds the minimum of a generalized distance between the desired and the actual manipulator tip position and/or orientation. Both a first-order steepest-descent gradient search and a second-order Newton-Raphson search are developed. The optimal relaxation factor required for the steepest descent method is computed recursively using an outward/inward procedure similar to those used typically for recursive inverse dynamics calculations. The second-order search requires evaluation of a gradient and an approximate Hessian. A Gauss-Markov approach is used to approximate the Hessian matrix in terms of products of first-order derivatives. This matrix is inverted recursively using a two-stage process of inward Kalman filtering followed by outward smoothing. This two-stage process is analogous to that recently developed by the author to solve by means of spatial filtering and smoothing the forward dynamics problem for serial manipulators.

Rodriguez, G.↗
NASA NTRS1994

Recursive heuristic classification

The author will describe a new problem-solving approach called recursive heuristic classification, whereby a subproblem of heuristic classification is itself formulated and solved by heuristic classification. This allows the construction of more knowledge-intensive classification programs in a way that yields a clean organization. Further, standard knowledge acquisition and learning techniques for heuristic classification can be used to create, refine, and maintain the knowledge base associated with the recursively called classification expert system. The method of recursive heuristic classification was used in the Minerva blackboard shell for heuristic classification. Minerva recursively calls itself every problem-solving cycle to solve the important blackboard scheduler task, which involves assigning a desirability rating to alternative problem-solving actions. Knowing these ratings is critical to the use of an expert system as a component of a critiquing or apprenticeship tutoring system. One innovation of this research is a method called dynamic heuristic classification, which allows selection among dynamically generated classification categories instead of requiring them to be prenumerated.

Wilkins, David C.↗
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↗