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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

First order formulation of the Yang–Mills theory in a background field

The background gauge renormalization of the first order formulation of the Yang–Mills theory is studied by using the BRST identities. Together with the background symmetry, these identities allow for an iterative proof of renormalizability to all orders in perturbation theory. However, due to the fact that certain improper diagrams which violate the BRST symmetry should be removed, the renormalizability must be deduced indirectly. The recursive method involves rescalings and mixings of the fields, which lead to a renormalized effective action for the background field theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

Applications of the worldline Monte Carlo formalism in quantum mechanics

Highlights: Universal approach to the numerical computation of the Euclidean path integral. Inspired by recent work in relativistic quantum field theory. Here adapted to non-relativistic quantum mechanics. Worked out for the computation of propagators and ground-state energies. Special smoothing procedure for singular potentials. -- Abstract: In recent years efficient algorithms have been developed for the numerical computation of relativistic single-particle path integrals in quantum field theory. Here, we adapt this “worldline Monte Carlo” approach to the standard problem of the numerical approximation of the non-relativistic path integral, resulting in a formalism whose characteristic feature is the fast, non-recursive generation of an ensemble of trajectories that is independent of the potential, and is thus universally applicable. The numerical implementation discretises the trajectories with respect to their time parametrisation but maintains a continuous spatial domain. In the case of singular potentials, the discretised action gets adapted to the singularity through a “smoothing” procedure. We show for a variety of examples (the harmonic oscillator in various dimensions, the modified Pöschl–Teller potential, delta-function potentials, the Coulomb and Yukawa potentials) that the method allows one to obtain fast and reliable estimates for the Euclidean propagator and use them in a certain time window suitable for extracting the ground state energy. Usually Monte Carlo calculations in quantum mechanics are performed using algorithms that involve a more specific adaptation to the potential, and we briefly compare our method with the most widely used such algorithms, which are of Metropolis type. As an aside, we apply it for studying the classical limit where nearly classical trajectories are expected to dominate in the path integral. We expect the advances made here to be useful also in the relativistic case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Modeling occupancy-driven building loads for large and diversified building stocks through the use of parametric schedules

Building energy modeling provides a fundamental tool to assess the potential for energy efficiency to contribute to reducing world energy consumption and global emissions. Occupancy-related operations are a key source of uncertainty for building energy analysis, particularly for aggregated building stocks. At a district or city level, it is critical to estimate aggregated power load profiles for sizing power grid infrastructure, power plant capacity allocation, and energy efficiency measures. The stochastic nature of behavior-related operations complicates the creation of models that accurately capture building load profiles for entire building stocks. This research introduces a new methodology called parametric schedules to model occupancy-driven schedules for large and diverse building stocks. In contrast to computationally expensive methodologies proposed in the literature, our work does not use a recursive time-consuming step. Occupancy is estimated by the extrapolation of operation times directly from metered electric consumption data; occupancy-related schedules are stochastically assigned to each building model, guaranteeing diversity of operation times in the stock. Our procedure has been tested on a large, diversified data-set of 25,000 commercial buildings in Los Angeles, California. It proved to be able to adequately represent the stochastic schedules diversity of the stock and to refine the stock calibration process by 1%. This innovative approach represents a useful asset for utility companies, grid operators, urban planners, and balancing authorities, seeking to improve building stock modeling and better estimate the impact of energy conservation measures. – This work is part of a larger stock modeling tool called ComStock, which is under development by NREL.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

An efficient method to integrate polynomials over polytopes and curved solids

Here in this paper, we present an efficient approach to compute the integral of monomials and polynomials over polyhedra and regions defined by parametric curved boundary surfaces. We use Euler's theorem for homogeneous functions in combination with Stokes's theorem to reduce the integration of a monomial over a three-dimensional solid to its boundary. If the solid is a polytope, through a recursive application of these theorems, the integral is further reduced to just the evaluation of the monomial and its derivatives at the vertices of the polytope. The present approach is simpler than existing techniques that rely on repeated use of the divergence theorem, which require the antiderivative of the monomials and the projection of these functions onto hyperplanes. For convex and nonconvex polytopes, our approach does not introduce any approximation for the integration of monomials. For curved solid regions bounded by surfaces that admit a parameterization, the same approach yields simplified formulas to compute the integral of any homogeneous function, including monomials. For surfaces parameterized by polynomial surfaces (such as Bezier surface triangles and B-spline patches), the method yields machine-precision accuracy for the volumetric integration of monomials with an appropriate quadrature rule. Numerical examples over regions bounded by polynomial surfaces and rational surfaces are presented to establish the accuracy and efficiency of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

The introspective may achieve more: Enhancing existing Geoscientific models with native-language emulated structural reflection

Geoscientific models manage myriad and increasingly complex data structures as trans -disciplinary models are integrated. They often incur significant redundancy with cross-cutting tasks. Reflection, the ability of a program to inspect and modify its structure and behavior at runtime, is known as a powerful tool to improve code reusability, abstraction, and separation of concerns. Reflection is rarely adopted in high-performance Geoscientific models, especially with Fortran, where it was previously deemed implausible. Practical constraints of language and legacy often limit us to feather-weight, native-language solutions. We demonstrate the usefulness of a structural-reflection-emulating, dynamically-linked metaObjects, gd . We show real-world examples including data structure self-assembly, effortless save/restart and upgrade to parallel I/O, recursive actions and batch operations. We share gd and a derived module that reproduces MATLAB-like structure in Fortran and C++. We suggest that both a gd representation and a Fortran-native representation are maintained to access the data, each for separate purposes. In conclusion, embracing emulated reflection allows generically-written codes that are highly re-usable across projects.

58 GEOSCIENCES↗
DOE OSTI2021

Computational assessment of smooth and rough parameter dependence of statistics in chaotic dynamical systems

An assumption of smooth response to small parameter changes, of statistics or long-time averages of a chaotic system, is generally made in the field of sensitivity analysis, and the parametric derivatives of statistical quantities are critically used in science and engineering. In this paper, we propose a numerical procedure to assess the differentiability of statistics with respect to parameters in chaotic systems. Here, we numerically show that the existence of the derivative depends on the Lebesgue integrability of a certain density gradient function, which we define as the derivative of logarithmic SRB density along the unstable manifold. We develop a recursive formula for the density gradient that can be efficiently computed along trajectories, and demonstrate its use in determining the differentiability of statistics. Our numerical procedure is illustrated on low-dimensional chaotic systems whose statistics exhibit both smooth and rough regions in parameter space.

42 ENGINEERING↗
DOE OSTI2019

Predicting the mechanical response of oligocrystals with deep learning

In this study, we employ data-driven homogenization approaches to predict the particular mechanical evolution of polycrystalline aggregates with tens of individual crystals. In these oligocrystals the differences in stress response due to microstructural variation is pronounced. Shell-like structures produced by metal-based additive manufacturing and the like make the prediction of the behavior of oligocrystals technologically relevant. The predictions of traditional homogenization theories based on grain volumes are not sensitive to variations in local grain neighborhoods. Direct simulation of the local response with crystal plasticity finite element methods is more detailed, but the computations are expensive. To represent the stress-strain response of a polycrystalline sample given its initial grain texture and morphology we have designed a novel neural network that incorporates a convolution component to observe and reduce the information in the crystal texture field and a recursive component to represent the causal nature of the history information. This model exhibits accuracy on par with crystal plasticity simulations at minimal computational cost per prediction.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Branches, quivers, and ideals for knot complements

We generalize the F K invariant, i.e. Z^ for the complement of a knot K in the 3-sphere, the knots-quivers correspondence, and A-polynomials of knots, and find several interconnections between them. We associate an F K invariant to any branch of the A-polynomial of K and we work out explicit expressions for several simple knots. We show that these F K invariants can be written in the form of a quiver generating series, in analogy with the knots-quivers correspondence. We discuss various methods to obtain such quiver representations, among others using R-matrices. We generalize the quantum a-deformed A-polynomial to an ideal that contains the recursion relation in the group rank, i.e. in the parameter a, and describe its classical limit in terms of the Coulomb branch of a 3d-5d theory. We also provide t-deformed versions. Furthermore, we study how the quiver formulation for closed 3-manifolds obtained by surgery leads to the superpotential of 3d N = 2 theory T[M 3 ] and to the data of the associated modular tensor category MTC[M 3 ].

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A note on efficiently generating ionic configurations for opacity calculations

When calculating the spectral opacity of hot dense plasmas one often encounters the need to generate a list of detailed ionic configurations of bound states for each ion stage in the plasma. Here we present here a non-recursive algorithm for the efficient construction of such a list of states.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

On the computation of moments in the Super-Transition-Arrays model for radiative opacity calculations

In the Super-Transition-Array statistical method for the computation of radiative opacity of hot dense matter, the moments of the absorption or emission features involve partition functions with reduced degeneracies, occurring through the calculation of averages of products of subshell populations. Here, in the present work, we discuss several aspects of the computation of such peculiar partition functions, insisting on the precautions that must be taken in order to avoid numerical difficulties. In a previous work, we derived a formula for supershell partition functions, which takes the form of a functional of the distribution of energies within the supershell and allows for fast and accurate computations, truncating the number of terms in the expansion. The latter involves coefficients for which we obtained a recursion relation and an explicit formula. We show that such an expansion can be combined with the recurrence relation for shifted partition functions. We also propose, neglecting the effect of fine structure as a first step, a positive-definite formula for the Super-Transition-Array moments of any order, providing an insight into the asymmetry and sharpness of the latter. The corresponding formulas are free of alternating sums. Several ways to speed up the calculations are also presented.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2017

An Error-Entropy Minimization Algorithm for Tracking Control of Nonlinear Stochastic Systems with Non-Gaussian Variables

This paper presents an error-entropy minimization tracking control algorithm for a class of dynamic stochastic system. The system is represented by a set of time-varying discrete nonlinear equations with non-Gaussian stochastic input, where the statistical properties of stochastic input are unknown. By using Parzen windowing with Gaussian kernel to estimate the probability densities of errors, recursive algorithms are then proposed to design the controller such that the tracking error can be minimized. The performance of the error-entropy minimization criterion is compared with the mean-square-error minimization in the simulation results.

Entropy↗
DOE OSTI2019

A method to identify weak points of interconnection of renewable energy resources

The increasing penetration of renewable energy resources (RERs) is challenging power grid planning and operation in maintaining grid reliability. Potential power grid reliability and stability issues may arise when large-scale RERs are connected to a weak power grid. These issues may become more significant due to the mutual interactions among RERs that are interconnected electrically close through a power network. Weakness analysis based on grid strength assessment is useful for identifying the potential weak grid issues. However, when taking into account the impact of the interactions among RERs, the weakness analysis becomes computationally challenging. Different combinations of points of interconnections (POIs) of RERs may have different impacts on grid strength at each POI. Due to the combination nature, such weakness analysis may be time-consuming when identifying the weakest combination of POIs from a large number of potential candidates in realistic power grids. To address this concern, the impact of the power network structure on grid strength is analyzed in this paper. It is found that the impact mainly depends on the impedance ratios at POIs. The findings can be summarized as two criteria to develop a recursive method for fast identification of the weakest combination in this paper. The efficacy of the proposed method is demonstrated through case studies on the IEEE 39-bus system and a realistic power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Decentralized Data-Driven Estimation of Generator Rotor Speed and Inertia Constant Based on Adaptive Unscented Kalman Filter

This paper proposes an online decentralized and data-driven method for synchronous generator rotor speed and inertia estimation. First, an analytical relationship between the generator terminal voltage/current phasors and its internal rotor speed is derived using the Thevenin equivalent. The parameters of the latter are obtained via a recursive estimator, which allows us to estimate the generator's internal rotor speed from voltage/current phasors without the need for any generator information. Second, we reformulate the equivalent swing equation into the Kalman filter form, which enables us to use a priori-estimated internal rotor speed along with measured real and reactive power injections to obtain an estimate of the inertia for each online synchronous generator. This is achieved through an adaptive unscented Kalman filter. We demonstrate that the use of terminal bus frequency to approximate the rotor speed for inertia estimation by existing methods leads to large estimation biases/errors. Numerical simulations carried out on the IEEE 39-bus and Texas 2000-bus systems reveal that our proposed method is consistently more accurate than existing methods. Moreover, our proposed method is insensitive to both the type and location of system disturbances, and it is robust to different levels of measurement noise.

bus frequency↗
DOE OSTI2022

Extended real-time voltage instability identification method based on synchronized phasor measurements

This paper presents an extended adaptive approach designed to accurately estimate the Thévenin equivalent parameters using phasor measurements at a given bus for measurements lying in any of four quadrants of the PQ-plane. The improvement is achieved by using a new condition to properly update the estimated parameters after an initial guess. Based on an adaptive philosophy, the proposed approach can correctly account for the intrinsic nonlinearities of a power system, can provide a real-time estimation of Thévenin parameters, and does not require network topology knowledge. The method is validated using the Kundur 2-area system, showing estimation improvements compared to the current adaptive approach and the classical recursive least-squares method. The proposed approach is able to estimate both sides of the system with respect to the measurement bus. In addition, a data-driven voltage stability index is developed. To illustrate the performance of the proposed approach in a larger power system, a voltage stability assessment is carried out on the IEEE 39-bus system, considering the action of overexcitation limiters of generators and nonlinear loads. The proposed approach is suitable for applications that require an accurate Thévenin equivalent estimation in real-time, such as for voltage stability assessment. The new approach provides a reliable tool for the system operators to make proper and timely decisions.

42 ENGINEERING↗
DOE OSTI2017

Memory-optimized shift operator alternating direction implicit finite difference time domain method for plasma

Through introducing the alternating direction implicit (ADI) technique and the memory-optimized algorithm to the shift operator (SO) finite difference time domain (FDTD) method, the memory-optimized SO-ADI FDTD for nonmagnetized collisional plasma is proposed and the corresponding formulae of the proposed method for programming are deduced. In order to further the computational efficiency, the iteration method rather than Gauss elimination method is employed to solve the equation set in the derivation of the formulae. Complicated transformations and convolutions are avoided in the proposed method compared with the Z transforms (ZT) ADI FDTD method and the piecewise linear JE recursive convolution (PLJERC) ADI FDTD method. The numerical dispersion of the SO-ADI FDTD method with different plasma frequencies and electron collision frequencies is analyzed and the appropriate ratio of grid size to the minimum wavelength is given. The accuracy of the proposed method is validated by the reflection coefficient test on a nonmagnetized collisional plasma sheet. The testing results show that the proposed method is advantageous for improving computational efficiency and saving computer memory. The reflection coefficient of a perfect electric conductor (PEC) sheet covered by multilayer plasma and the RCS of the objects coated by plasma are calculated by the proposed method and the simulation results are analyzed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A generalized approximate control variate framework for multifidelity uncertainty quantification

We describe and analyze a variance reduction approach for Monte Carlo (MC) sampling that accelerates the estimation of statistics of computationally expensive simulation models using an ensemble of models with lower cost. These lower cost models — which are typically lower fidelity with unknown statistics — are used to reduce the variance in statistical estimators relative to a MC estimator with equivalent cost. We derive the conditions under which our proposed approximate control variate framework recovers existing multifidelity variance reduction schemes as special cases. We demonstrate that existing recursive/nested strategies are suboptimal because they use the additional low-fidelity models only to efficiently estimate the unknown mean of the first low-fidelity model. As a result, they cannot achieve variance reduction beyond that of a control variate estimator that uses a single low-fidelity model with known mean. However, there often exists about an order-of-magnitude gap between the maximum achievable variance reduction using all low-fidelity models and that achieved by a single low-fidelity model with known mean. We show that our proposed approach can exploit this gap to achieve greater variance reduction by using non-recursive sampling schemes. The proposed strategy reduces the total cost of accurately estimating statistics, especially in cases where only low-fidelity simulation models are accessible for additional evaluations. Several analytic examples and an example with a hyperbolic PDE describing elastic wave propagation in heterogeneous media are used to illustrate the main features of the methodology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Permutation-adapted complete and independent basis for atomic cluster expansion descriptors

Atomic cluster expansion (ACE) methods provide a systematic way to describe particle local environments of arbitrary body order. For practical applications it is often required that the basis of cluster functions be symmetrized with respect to rotations and permutations. Existing methodologies yield sets of symmetrized functions that are over-complete. These methodologies thus require an additional numerical procedure, such as singular value decomposition (SVD), to eliminate redundant functions. In this work, it is shown that analytical linear relationships for subsets of cluster functions may be derived using recursion and permutation properties of generalized Wigner symbols. From these relationships, subsets (blocks) of cluster functions can be selected such that, within each block, functions are guaranteed to be linearly independent. It is conjectured that this block-wise independent set of permutation-adapted rotation and permutation invariant (PA-RPI) functions forms a complete, independent basis for ACE. Along with the first analytical proofs of block-wise linear dependence of ACE cluster functions and other theoretical arguments, numerical results are offered to demonstrate this. The utility of the method is demonstrated in the development of an ACE interatomic potential for tantalum. Using the new basis functions in combination with Bayesian compressive sensing sparse regression, some high degree descriptors are observed to persist and help achieve high-accuracy models.

Angular momentum↗
DOE OSTI2025

Multi-frequency progressive refinement for learned inverse scattering

Interpreting scattered acoustic and electromagnetic wave patterns is a computational task that enables remote imaging in a number of important applications, including medical imaging, geophysical exploration, sonar and radar detection, and nondestructive testing of materials. However, accurately and stably recovering an inhomogeneous medium from far-field scattered wave measurements is a computationally difficult problem, due to the nonlinear and non-local nature of the forward scattering process. We design a neural network, called Multi-Frequency Inverse Scattering Network (MFISNet), and a training method to approximate the inverse map from far-field scattered wave measurements at multiple frequencies. We consider three variants of MFISNet, with the strongest performing variant inspired by the recursive linearization method — a commonly used technique for stably inverting scattered wavefield data — that progressively refines the estimate with higher frequency content. MFISNet outperforms past methods in regimes with high-contrast, heterogeneous large objects, and inhomogeneous unknown backgrounds.

97 MATHEMATICS AND COMPUTING↗