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.

570 records · Page 32
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Estimating and Forecasting Time-Varying Groundwater Recharge in Fractured Rock: A State-Space Formulation with Preferential and Diffuse Flow to the Water Table

Rapid infiltration following precipitation may result in groundwater contamination from surface contaminants or pathogens. In fractured rock, contaminants can migrate rapidly to points of groundwater withdrawals. In contrast to the temporal availability of groundwater quality chemical indicators, meteorological and groundwater level observations are available in real-time to estimate time-varying recharge, which can act as a surrogate to identify periods of rapid infiltration that may indicate contamination susceptibility. Estimating recharge using methods, such as base-flow recession, unsaturated infiltration models, or Water-Table Fluctuations (WTF), cannot capitalize on currently available technologies and telecommunication infrastructure to conduct real-time recharge estimation at scales relevant to characterizing rapid infiltration. We present a linear, physics-based State-Space (SS) model of one-dimensional infiltration to estimate recharge, which includes preferential and diffuse-flow to the water table. The model can take advantage of real-time data for water-table altitude, precipitation, and evapotranspiration. Model parameters are calibrated over an observation period, and the Kalman Filter (KF) is subsequently applied to continuously update the observed (water-table altitude) and unobserved (groundwater recharge) system states and predict future states as new data become available. The SS/KF algorithm is demonstrated at the Masser Groundwater Recharge Site in Pennsylvania, USA and comparisons are made with recharge estimates from WTF methods. Model results indicate that the frequency of observations (daily versus sub-daily) dictates the allocation between preferential and diffuse flow. Additionally, because infiltration processes encompass many nonlinearities, model parameters estimated from observation periods need to be updated at least seasonally to account for changing recharge conditions.

groundwater, Recharge, infiltration, recursive est↗
DOE OSTI2013

Nonadiabatic anharmonic electron transfer

The effect of an inner sphere, local mode vibration on an electron transfer is modeled using the nonadiabatic transition probability (rate) expression together with both the anharmonic Morse and the harmonic oscillator potential. For an anharmonic inner sphere mode, a variational analysis uses harmonic oscillator basis functions to overcome the difficulties evaluating Morse-model Franck-Condon overlap factors. Individual matrix elements are computed with the use of new, fast, robust, and flexible recurrence relations. The analysis therefore readily addresses changes in frequency and/or displacement of oscillator minimums in the different electron transfer states. Direct summation of the individual Boltzmann weighted Franck-Condon contributions avoids the limitations inherent in the use of the familiar high-temperature, Gaussian form of the rate constant. The effect of harmonic versus anharmonic inner sphere modes on the electron transfer is readily seen, especially in the exoergic, inverted region. The behavior of the transition probability can also be displayed as a surface for all temperatures and values of the driving force/exoergicity {Delta}=-{Delta}G. The temperature insensitivity of the transfer rate is clearly seen when the exoergicity equals the collective reorganization energy ({Delta}={Lambda}{sub s}) along a maximum ln (w) vs. {Delta} ridge of the surface. The surface also reveals additional regions for {Delta} where ln (w) appears to be insensitive to temperature, or effectively activationless, for some kinds of inner sphere contributions.

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

Purely non-local Hamiltonian formalism, Kohno connections and ∨-systems

In this paper, we extend purely non-local Hamiltonian formalism to a class of Riemannian F-manifolds, without assumptions on the semisimplicity of the product ○ or on the flatness of the connection ∇. In the flat case, we show that the recurrence relations for the principal hierarchy can be re-interpreted using a local and purely non-local Hamiltonian operators and in this case they split into two Lenard-Magri chains, one involving the even terms, the other involving the odd terms. Furthermore, we give an elementary proof that the Kohno property and the ∨-system condition are equivalent under suitable assumptions and we show how to associate a purely non-local Hamiltonian structure to any ∨-system, including degenerate ones.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Some new surprises in chaos

A brief review is presented of some recent findings in the theory of chaotic dynamics. We also prove a statement that could be naturally considered as a dual one to the Poincaré theorem on recurrences. Numerical results demonstrate that some parts of the phase space of chaotic systems are more likely to be visited earlier than other parts. A new class of chaotic focusing billiards is discussed that clearly violates the main condition considered to be necessary for chaos in focusing billiards.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Accompanying coordinate expansion and recurrence relation method using a transfer relation scheme for electron repulsion integrals with high angular momenta and long contractions

An efficient algorithm for the rapid evaluation of electron repulsion integrals is proposed. The present method, denoted by accompanying coordinate expansion and transferred recurrence relation (ACE-TRR), is constructed using a transfer relation scheme based on the accompanying coordinate expansion and recurrence relation method. Furthermore, the ACE-TRR algorithm is extended for the general-contraction basis sets. Numerical assessments clarify the efficiency of the ACE-TRR method for the systems including heavy elements, whose orbitals have long contractions and high angular momenta, such as f- and g-orbitals.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Algebraic solutions of shape-invariant position-dependent effective mass systems

Keeping in view the ordering ambiguity that arises due to the presence of position-dependent effective mass in the kinetic energy term of the Hamiltonian, a general scheme for obtaining algebraic solutions of quantum mechanical systems with position-dependent effective mass is discussed. We quantize the Hamiltonian of the pertaining system by using symmetric ordering of the operators concerning momentum and the spatially varying mass, initially proposed by von Roos and Lévy-Leblond. The algebraic method, used to obtain the solutions, is based on the concepts of supersymmetric quantum mechanics and shape invariance. In order to exemplify the general formalism a class of non-linear oscillators has been considered. This class includes the particular example of a one-dimensional oscillator with different position-dependent effective mass profiles. Explicit expressions for the eigenenergies and eigenfunctions in terms of generalized Hermite polynomials are presented. Moreover, properties of these modified Hermite polynomials, like existence of generating function and recurrence relations among the polynomials have also been studied. Furthermore, it has been shown that in the harmonic limit, all the results for the linear harmonic oscillator are recovered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

The leading term of the Plancherel-Rotach asymptotic formula for solutions of recurrence relations

Recurrence relations generating Padé and Hermite-Padé polynomials are considered. Their coefficients increase with the index of the relation, but after dividing by an appropriate power of the scaling function they tend to a finite limit. As a result, after scaling the polynomials 'stabilize' for large indices; this type of asymptotic behaviour is called Plancherel-Rotach asymptotics. An explicit expression for the leading term of the asymptotic formula, which is valid outside sets containing the zeros of the polynomials, is obtained for wide classes of three- and four-term relations. For three-term recurrence relations this result generalizes a theorem Van Assche obtained for recurrence relations with 'regularly' growing coefficients. Bibliography: 19 titles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Geometric Mapping of Tasks to Processors on Parallel Computers with Mesh or Torus Networks

We present a new method for reducing parallel applications' communication time by mapping their MPI tasks to processors in a way that lowers the distance messages travel and the amount of congestion in the network. Assuming geometric proximity among the tasks is a good approximation of their communication interdependence, we use a geometric partitioning algorithm to order both the tasks and the processors, assigning task parts to the corresponding processor parts. In this way, interdependent tasks are assigned to “nearby” cores in the network. We also present a number of algorithmic optimizations that exploit specific features of the network or application to further improve the quality of the mapping. We specifically address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network. Furthermore, our methods generalize to contiguous allocations as well, and results are shown for both contiguous and non-contiguous allocations. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75% relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 16K cores of an IBM BlueGene/Q with contiguous allocation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Raynal–Revai coefficients for a general kinematic rotation

In a three-body system, transitions between different sets of normalized Jacobi coordinates are described as general kinematic transformations that include an orthogonal or a pseudoorthogonal rotation. For such rotations, the Raynal–Revai coefficients execute a unitary transformation between three-body hyperspherical functions. Recurrence relations that make it possible to calculate the Raynal–Revai coefficients for arbitrary angular momenta are derived on the basis of linearized representations of products of hyperspherical functions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2017

A finite quantum oscillator model related to special sets of Racah polynomials

In [R. Oste and J. Van der Jeugt, arXiv: 1507.01821 [math-ph]] we classified all pairs of recurrence relations in which two (dual) Hahn polynomials with different parameters appear. Such pairs are referred to as (dual) Hahn doubles, and the same technique was then applied to obtain all Racah doubles. We now consider a special case concerning the doubles related to Racah polynomials. This gives rise to an interesting class of two-diagonal matrices with closed form expressions for the eigenvalues. Just as it was the case for (dual) Hahn doubles, the resulting two-diagonal matrix can be used to construct a finite oscillator model. We discuss some properties of this oscillator model, give its (discrete) position wavefunctions explicitly, and illustrate their behavior by means of some plots.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Exploiting Geometric Partitioning in Task Mapping for Parallel Computes

We present a new method for mapping applications' MPI tasks to cores of a parallel computer such that applications' communication time is reduced. We address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network, although our methods generalize to contiguous allocations as well. The goal is to assign tasks to cores so that interdependent tasks are performed by "nearby' cores, thus lowering the distance messages must travel, the amount of congestion in the network, and the overall cost of communication. Our new method applies a geometric partitioning algorithm to both the tasks and the processors, and assigns task parts to the corresponding processor parts. We also present a number of algorithmic optimizations that exploit specific features of the network or application. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75% relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 32K cores of an IBM BlueGene/Q with contiguous allocation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2012

The solution of the point kinetics equations via converged accelerated Taylor series (CATS)

This paper deals with finding accurate solutions of the point kinetics equations including non-linear feedback, in a fast, efficient and straightforward way. A truncated Taylor series is coupled to continuous analytical continuation to provide the recurrence relations to solve the ordinary differential equations of point kinetics. Non-linear (Wynn-epsilon) and linear (Romberg) convergence accelerations are employed to provide highly accurate results for the evaluation of Taylor series expansions and extrapolated values of neutron and precursor densities at desired edits. The proposed Converged Accelerated Taylor Series, or CATS, algorithm automatically performs successive mesh refinements until the desired accuracy is obtained, making use of the intermediate results for converged initial values at each interval. Numerical performance is evaluated using case studies available from the literature. Nearly perfect agreement is found with the literature results generally considered most accurate. Benchmark quality results are reported for several cases of interest including step, ramp, zigzag and sinusoidal prescribed insertions and insertions with adiabatic Doppler feedback. A larger than usual (9) number of digits is included to encourage honest benchmarking. The benchmark is then applied to the enhanced piecewise constant algorithm (EPCA) currently being developed by the second author. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗