Search NASA⌕ Search

SEARCH · Search NASA

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Progressive Failure Analysis of 3D Woven Composites via Multiscale Recursive Micromechanics

Multiscale progressive failure simulations have been performed for a 3D woven composite considering six length scales, spanning from the woven composite repeating unit cell to the matrix material containing voids. The Multiscale Recursive Micromechanics approach, which enables micromechanics models to call other micromechanics models (or themselves recursively) to consider finer and finer length scales, has been employed. The multiscale model uses both the generalized method of cells and Mori-Tanaka micromechanics theories and considers failure and damage at the lowest length scale. A simple subvolume elimination damage model, as well as the crack band model, are employed for the matrix and their predicted composite responses compared with and without a preexisting binder tow disbond. Results are also compared with experimental data for an AS4 carbon fiber/RTM6 epoxy matrix 3D orthogonal woven PMC, with good agreement in terms of global stiffness and global failure stress.

3D woven↗
DOE OSTI2018

Recursive integral method with Cayley transformation

Summary The recently developed RIM (recursive integral method) finds eigenvalues in a region of the complex plane. It computes an indicator to test if the region contains eigenvalues using an approximate spectral projection. If the indicator shows that the region contains eigenvalues, it is subdivided into smaller regions, which are then recursively tested and subdivided until any eigenvalues are isolated to a specified precision. We propose an enhancement to RIM that uses Cayley transformations and Arnoldi's method to greatly decrease the number of factorizations required to solve the linear systems that arise from a discretized contour integral to compute the indicator, which substantially reduces the computational cost. We demonstrate the efficacy of our method with numerical examples and compare with the implicitly restarted Arnoldi method, as implemented in eigs in MATLAB.

Huang, R.↗
DOE OSTI2019

Recursive representations of arbitrary Virasoro conformal blocks

We derive recursive representations in the internal weights of N-point Virasoro conformal blocks in the sphere linear channel and the torus necklace channel, and recursive representations in the central charge of arbitrary Virasoro conformal blocks on the sphere, the torus, and higher genus Riemann surfaces in the plumbing frame.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Recursion relations for 5-point conformal blocks

We consider 5-point functions in conformal field theories in d2 dimensions. Using weight-shifting operators, we derive recursion relations which allow for the computation of arbitrary conformal blocks appearing in 5-point functions of scalar operators, reducing them to a linear combination of blocks with scalars exchanged. We additionally derive recursion relations for the conformal blocks which appear when one of the external operators in the 5-point function has spin 1 or 2. Our results allow us to formulate positivity constraints using 5-point functions which describe the expectation value of the energy operator in bilocal states created by two scalars.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

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↗
DOE OSTI2018

Target tracking via recursive Bayesian state estimation in cognitive radar networks

To cope with complicated environments and stealthier targets, incorporating intelligence and cognition cycles into target tracking is of great importance in modern sensor network management. With remarkable advances in sensor techniques and deployable platforms, a sensing system has freedom to select a subset of available radars, plan their trajectories, and transmit designed waveforms. In this paper, we propose a general framework for single target tracking in cognitive networks of radars, including consideration of waveform design, path planning, and radar selection, which are separately but not jointly taken into account in existing work. The tracking procedure, built on the theories of dynamic graphical models (DGM) and recursive Bayesian state estimation (RBSE), is formulated as two iterative steps: (i) solving a combinatorial optimization problem to select the optimal subset of radars, waveforms, and locations for the next tracking instant, and (ii) acquiring the recursive Bayesian state estimation to accurately track the target. Further, an illustrative example introduces a specific scenario in 2-D space. Simulation results based on the scenario demonstrate that the proposed framework can accurately track the target under the management of the network of radars.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Subspace recursive Fermi-operator expansion strategies for large-scale DFT eigenvalue problems on HPC architectures

Quantum mechanical calculations for material modeling using Kohn–Sham density functional theory (DFT) involve the solution of a nonlinear eigenvalue problem for N smallest eigenvector-eigenvalue pairs, with N proportional to the number of electrons in the material system. Here, these calculations are computationally demanding and have asymptotic cubic scaling complexity with the number of electrons. Large-scale matrix eigenvalue problems arising from the discretization of the Kohn–Sham DFT equations employing a systematically convergent basis traditionally rely on iterative orthogonal projection methods, which are shown to be computationally efficient and scalable on massively parallel computing architectures. However, as the size of the material system increases, these methods are known to incur dominant computational costs through the Rayleigh–Ritz projection step of the discretized Kohn–Sham Hamiltonian matrix and the subsequent subspace diagonalization of the projected matrix. This work explores the potential of polynomial expansion approaches based on recursive Fermi-operator expansion as an alternative to the subspace diagonalization of the projected Hamiltonian matrix to reduce the computational cost. Subsequently, we perform a detailed comparison of various recursive polynomial expansion approaches to the traditional approach of explicit diagonalization on both multi-node central processing unit and graphics processing unit architectures and assess their relative performance in terms of accuracy, computational efficiency, scaling behavior, and energy efficiency.

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

Structured Prompt Interrogation and Recursive Extraction of Semantics (SPIRES): a method for populating knowledge bases using zero-shot learning

Abstract Motivation Creating knowledge bases and ontologies is a time consuming task that relies on manual curation. AI/NLP approaches can assist expert curators in populating these knowledge bases, but current approaches rely on extensive training data, and are not able to populate arbitrarily complex nested knowledge schemas. Results Here we present Structured Prompt Interrogation and Recursive Extraction of Semantics (SPIRES), a Knowledge Extraction approach that relies on the ability of Large Language Models (LLMs) to perform zero-shot learning and general-purpose query answering from flexible prompts and return information conforming to a specified schema. Given a detailed, user-defined knowledge schema and an input text, SPIRES recursively performs prompt interrogation against an LLM to obtain a set of responses matching the provided schema. SPIRES uses existing ontologies and vocabularies to provide identifiers for matched elements. We present examples of applying SPIRES in different domains, including extraction of food recipes, multi-species cellular signaling pathways, disease treatments, multi-step drug mechanisms, and chemical to disease relationships. Current SPIRES accuracy is comparable to the mid-range of existing Relation Extraction methods, but greatly surpasses an LLM’s native capability of grounding entities with unique identifiers. SPIRES has the advantage of easy customization, flexibility, and, crucially, the ability to perform new tasks in the absence of any new training data. This method supports a general strategy of leveraging the language interpreting capabilities of LLMs to assemble knowledge bases, assisting manual knowledge curation and acquisition while supporting validation with publicly-available databases and ontologies external to the LLM. Availability and implementation SPIRES is available as part of the open source OntoGPT package: https://github.com/monarch-initiative/ontogpt.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Momentum shift and on-shell recursion relation for electroweak theory

We study the all-line transverse (ALT) shift which we developed for on-shell recursion of amplitudes for particles of any mass. We discuss the validity of the shift for general theories of spin ≤1, and illustrate the connection between Ward identity and constructibility for massive spin-1 amplitude under the ALT shift. We apply the shift to the electroweak theory, and various four-point scattering amplitudes among electroweak gauge bosons and fermions are constructed. We show explicitly that the four-point gauge boson contact terms in massive electroweak theory automatically arise after recursive construction, independent of UV completion, and they automatically cancel the terms growing as (energy) 4 at high energy. We explore UV completion of the electroweak theory that cancels the remaining (energy) 2 terms and impose unitarity requirements to constrain additional couplings. The ALT shift framework allows consistent treatment in dealing with contact term ambiguities for renormalizable massive and massless theories, which we show can be useful in studying real-world amplitudes with massive spinors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Recursive Dynamic Compressive Sensing in Smart Distribution Systems

With a transition to a smarter grid, we are witnessing a significant growth in smart metering infrastructure and sensor deployment in the distribution system. The underlying communication infrastructure is stressed due to the large volume of data that is generated by the smart meters/sensors. Furthermore, real time operations such as state estimation and control are impaired due to the lack of reliable aggregation of the data. In this paper, we exploit the underlying sparsity in grid data to implement two recursive dynamic compressive sensing (CS) approaches-streaming modified weighted-`1 CS and Kalman filtered CS. These approaches aim to reconstruct the sparse signal using the current underdetermined measurements and the prior information about the sparse signal and its support set. Slow signal and support change is in distribution grid data is validated using Pecan Street data. Both the IEEE 34 node test feeder system and PecanStreet data are considered as two examples to validate the superior performance of the two recursive CS techniques relative to classic CS.

Karimi, Hazhar Sufi↗
DOE OSTI2020

Optimizing the Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems of Equations

The need to solve block tridiagonal systems with hundreds or thousands of right-hand sides for the same block tridiagonal matrix is common in a variety of disciplines. To meet this need, the Accelerated Recursive Doubling Algorithm was developed. After a right-hand side independent phase, the algorithm allows for the quick, online calculation of solutions for different right-hand sides. In this work, we present methods to optimize the Accelerated Recursive Doubling Algorithm in memory usage and computation time in a hybrid parallelization model. The right-hand side independent phase of the naïve implementation takes ≥ 11/3 the amount of memory required to store the tridiagonal matrix, while our implementation reduces the fraction to ≈ 5/3 . The right-hand side dependent phase of the naïve implementation takes ≥ 6 times the amount of memory required to store the right-hand side, while our implementation reduces the fraction to ≈ 3. The computation time for the independent phase is reduced to ≈ 2/3 times that of the naïve implementation, while the computation time for the dependent phase is reduced to ≈ 5/9 . With increasing numbers of shared-memory threads q on every distributed processing element, we have O(q) theoretical speedup.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1972

Baysian recursive image estimation.

Discussion of a statistical procedure for treatment of noise-affected images to recover unaffected images by recursive processing with noise background elimination. The feasibility of the application of a recursive linear Kalman filtering technique to image processing is demonstrated. The procedure is applicable to images which are characterized statistically by mean and correlation functions. A time invariant dynamic model is proposed to provide stationary statistics for the scanner output.

Nahi, N. E.↗
NASA NTRS1977

A recursively formulated first-order semianalytic artificial satellite theory based on the generalized method of averaging. Volume 1: The generalized method of averaging applied to the artificial satellite problem

A recursively formulated, first-order, semianalytic artificial satellite theory, based on the generalized method of averaging is presented in two volumes. Volume I comprehensively discusses the theory of the generalized method of averaging applied to the artificial satellite problem. Volume II presents the explicit development in the nonsingular equinoctial elements of the first-order average equations of motion. The recursive algorithms used to evaluate the first-order averaged equations of motion are also presented in Volume II. This semianalytic theory is, in principle, valid for a term of arbitrary degree in the expansion of the third-body disturbing function (nonresonant cases only) and for a term of arbitrary degree and order in the expansion of the nonspherical gravitational potential function.

Mcclain, W. D.↗
NASA NTRS1977

Recursive analytical solution describing artificial satellite motion perturbed by an arbitrary number of zonal terms

An analytical first order solution has been developed which describes the motion of an artificial satellite perturbed by an arbitrary number of zonal harmonics of the geopotential. A set of recursive relations for the solution, which was deduced from recursive relations of the geopotential, was derived. The method of solution is based on Von-Zeipel's technique applied to a canonical set of two-body elements in the extended phase space which incorporates the true anomaly as a canonical element. The elements are of Poincare type, that is, they are regular for vanishing eccentricities and inclinations. Numerical results show that this solution is accurate to within a few meters after 500 revolutions.

Mueller, A. C.↗
NASA NTRS1981

Geomagnetic modeling by optimal recursive filtering

The results of a preliminary study to determine the feasibility of using Kalman filter techniques for geomagnetic field modeling are given. Specifically, five separate field models were computed using observatory annual means, satellite, survey and airborne data for the years 1950 to 1976. Each of the individual field models used approximately five years of data. These five models were combined using a recursive information filter (a Kalman filter written in terms of information matrices rather than covariance matrices.) The resulting estimate of the geomagnetic field and its secular variation was propogated four years past the data to the time of the MAGSAT data. The accuracy with which this field model matched the MAGSAT data was evaluated by comparisons with predictions from other pre-MAGSAT field models. The field estimate obtained by recursive estimation was found to be superior to all other models.

Gibbs, B. P.↗
NASA NTRS1982

A recursive algorithm for Zernike polynomials

The analysis of a function defined on a rotationally symmetric system, with either a circular or annular pupil is discussed. In order to numerically analyze such systems it is typical to expand the given function in terms of a class of orthogonal polynomials. Because of their particular properties, the Zernike polynomials are especially suited for numerical calculations. Developed is a recursive algorithm that can be used to generate the Zernike polynomials up to a given order. The algorithm is recursively defined over J where R(J,N) is the Zernike polynomial of degree N obtained by orthogonalizing the sequence R(J), R(J+2), ..., R(J+2N) over (epsilon, 1). The terms in the preceding row - the (J-1) row - up to the N+1 term is needed for generating the (J,N)th term. Thus, the algorith generates an upper left-triangular table. This algorithm was placed in the computer with the necessary support program also included.

Davenport, J. W.↗
NASA NTRS1982

Application of a recursive distortion estimator to the geodetic correction of thematic mapper imagery

It is pointed out that the higher resolution provided by the Thematic Mapper increases the demands on the accuracy needed by the ground processing in correcting for geodetic errors deriving from internal misalignments and uncertainties in the knowledge of spacecraft ephemeris and attitude. In addition, the Thematic Mapper will also process longer imagery intervals than previous missions. The recursive distortion estimator to be used is a Kalman filter. Here, a minimum variance spacecraft state error vector is estimated for known initial covariance of the elements of that vector and known image noise. Tests of the recursive distortion estimator with various spacecraft models carried out using a simulation of real world state vector dynamics are described. A determination is made of the density of control points needed to meet specified geometric correction requirements; it is expressed as a function of imagery interval length and control point measurement error.

Arnold, P.↗
NASA NTRS1986

Parallel scheduling of recursively defined arrays

A new method of automatic generation of concurrent programs which constructs arrays defined by sets of recursive equations is described. It is assumed that the time of computation of an array element is a linear combination of its indices, and integer programming is used to seek a succession of hyperplanes along which array elements can be computed concurrently. The method can be used to schedule equations involving variable length dependency vectors and mutually recursive arrays. Portions of the work reported here have been implemented in the PS automatic program generation system.

Myers, T. J.↗