Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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 145 records · Page 8

Generalizing the compressible pairwise interaction extended point-particle model

Ejecta physics plays an important role in material interfaces that are impacted by a strong shock wave. When a shock impacts a rough surface of solid material and melts it, the Richtmyer–Meshkov instability grows perturbations on the surface, which can eject particles. After release, the ejecta travel through the post-shock compressible flow. To accurately simulate a large number of ejecta particles, an Euler–Lagrange approach is preferred, which requires modeling the subgrid-scale physics involved with fluid–particle interactions. We generalize the previous work from Hsiao et al. (2023) to consider systems of moving particles subject to any loading shock. The following improvements were made: (1) Particles are allowed to move relative to each other (2) Non-planar shocks are accounted for along with allowing for variable shock speeds. As a result, the generalized algorithm was tested with particle-resolved simulations for canonical test cases. The results of these tests are discussed and analyzed.

97 MATHEMATICS AND COMPUTING↗

Enabling integrated AI control on DIII-D: a control system design with state-of-the-art experiments

We present the design and application of a general algorithm for Prediction And Control using MAchiNe learning (PACMAN) in DIII-D. Machine learning (ML)-based predictors and controllers have shown great promise in achieving regimes in which traditional controllers fail, such as tearing mode (TM) free scenarios, ELM-free scenarios and stable advanced tokamak conditions. The architecture presented here was deployed on DIII-D to facilitate the end-to-end implementation of advanced control experiments, from diagnostic processing to final actuation commands. This paper describes the detailed design of the algorithm and explains the motivation behind each design point. We also describe several successful ML control experiments in DIII-D using this algorithm, including a reinforcement learning controller targeting advanced non-inductive plasmas, a wide-pedestal quiescent H-mode ELM predictor, an Alfvén Eigenmode controller, a Model Predictive Control plasma profile controller and a state-machine TM predictor-controller. There is also discussion on guiding principles for real-time ML controller design and implementation.

machine learning↗

Multiparticle interpolating operators in quantum field theories with cubic symmetry

Numerical studies of lattice quantum field theories are conducted in finite spatial volumes, typically with cubic symmetry in the spatial coordinates. Motivated by these studies, this work presents a general algorithm to construct multiparticle interpolating operators for quantum field theories with cubic symmetry. The algorithm automates the block diagonalization required to combine multiple operators of definite linear momentum into irreducible representations of the appropriate little group. Examples are given for distinguishable and indistinguishable particles including cases with both zero and nonzero spin.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Interactions of massless higher spin fields from string theory

We construct vertex operators for massless higher spin fields in Ramond-Neveu-Schwarz superstring theory and compute some of their three-point correlators, describing gauge-invariant cubic interactions of the massless higher spins. The Fierz-Pauli on-shell conditions for the higher spins (including tracelessness and vanishing divergence) follow from the Becchi-Rouet-Stora-Tyutin-invariance conditions for the vertex operators constructed in this paper. The gauge symmetries of the massless higher spins emerge as a result of the Becchi-Rouet-Stora-Tyutin-nontriviality conditions for these operators, being equivalent to transformations with the traceless gauge parameter in the Fronsdal's approach. The gauge invariance of the interaction terms of the higher spins is therefore ensured automatically by that of the vertex operators in string theory. We develop a general algorithm to compute the cubic interactions of the massless higher spins and use it to explicitly describe the gauge-invariant interaction of two s=3 and one s=4 massless particles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum Simulation of Open Quantum Systems Using a Unitary Decomposition of Operators

Electron transport in realistic physical and chemical systems often involves the nontrivial exchange of energy with a large environment, requiring the definition and treatment of open quantum systems. Because the time evolution of an open quantum system employs a nonunitary operator, the simulation of open quantum systems presents a challenge for universal quantum computers constructed from only unitary operators or gates. Here, we present a general algorithm for implementing the action of any nonunitary operator on an arbitrary state on a quantum device. We show that any quantum operator can be exactly decomposed as a linear combination of at most four unitary operators. We demonstrate this method on a two-level system in both zero and finite temperature amplitude damping channels. Furthermore, the results are in agreement with classical calculations, showing promise in simulating nonunitary operations on intermediate-term and future quantum devices.

74 ATOMIC AND MOLECULAR PHYSICS↗

Pairing Directional Solar Inputs From Ray Tracing to Solar Receiver/Reactor Heat Transfer Models on Unstructured Meshes: Development and Case Studies

A novel method for pairing surface irradiation and volumetric absorption from Monte Carlo ray tracing to computational heat transfer models is presented. The method is well-suited to directionally and spatially complex concentrated radiative inputs (e.g., solar receivers and reactors). The method employs a generalized algorithm for directly mapping absorbed rays from a Monte Carlo ray tracing model to boundary or volumetric source terms in the computational mesh. The algorithm is compatible with unstructured, two and three-dimensional meshes with varying element shapes. Four case studies were performed on a directly irradiated, windowed solar thermochemical reactor model to validate the method. The method was shown to conserve energy and preserve spatial variation when mapping rays from a Monte Carlo ray tracing model to a computational heat transfer model in ansys fluent.

14 SOLAR ENERGY↗

Design of intrinsically disordered protein variants with diverse structural properties

Intrinsically disordered proteins (IDPs) perform a broad range of functions in biology, suggesting that the ability to design IDPs could help expand the repertoire of proteins with novel functions. Computational design of IDPs with specific conformational properties has, however, been difficult because of their substantial dynamics and structural complexity. We describe a general algorithm for designing IDPs with specific structural properties. We demonstrate the power of the algorithm by generating variants of naturally occurring IDPs that differ in compaction, long-range contacts, and propensity to phase separate. We experimentally tested and validated our designs and analyzed the sequence features that determine conformations. We show how our results are captured by a machine learning model, enabling us to speed up the algorithm. Our work expands the toolbox for computational protein design and will facilitate the design of proteins whose functions exploit the many properties afforded by protein disorder.

Science & Technology - Other Topics↗

ARIADNE

The code ARIADNE performs uncertainty quantification of experimental data for nuclear data. It also performs nuclear data evaluations with the algorithm generalized squares.

Neudecker, Denise↗

Quantitative phase retrieval with arbitrary pupil and illumination

We present a general algorithm for combining measurements taken under various illumination and imaging conditions to quantitatively extract the amplitude and phase of an object wave. The algorithm uses the weak object transfer function, which incorporates arbitrary pupil functions and partially coherent illumination. The approach is extended beyond the weak object regime using an iterative algorithm. Finally, we demonstrate the method on measurements of Extreme Ultraviolet Lithography (EUV) multilayer mask defects taken in an EUV zone plate microscope with both a standard zone plate lens and a zone plate implementing Zernike phase contrast.

97 MATHEMATICS AND COMPUTING↗

Unitarity cuts of the worldsheet

We compute the imaginary parts of genus-one string scattering amplitudes. Following Witten’s i\varepsilon i ε prescription for the integration contour on the moduli space of worldsheets, we give a general algorithm for computing unitarity cuts of the annulus, Möbius strip, and torus topologies exactly in \alpha' α ′ . With the help of tropical analysis, we show how the intricate pattern of thresholds (normal and anomalous) opening up arises from the worldsheet computation. The result is a manifestly-convergent representation of the imaginary parts of amplitudes, which has the analytic form expected from Cutkosky rules in field theory, but bypasses the need for performing laborious sums over the intermediate states. We use this representation to study various physical aspects of string amplitudes, including their behavior in the (s,t) ( s , t ) plane, exponential suppression, decay widths of massive strings, total cross section, and low-energy expansions. We find that planar annulus amplitudes exhibit a version of low-spin dominance: at any finite energy, only a finite number of low partial-wave spins give an appreciable contribution to the imaginary part.

97 MATHEMATICS AND COMPUTING↗

Surface Triangulation for CSG in Mercury

Visualization routines for rendering complicated geometries are very useful for engineers and scientists who are trying to build 3D prototypes of their designs. A common way to rapidly add interesting features to a 3D model is through the use of a concept called Constructive Solid Geometry. CSG uses compositions of the boolean set operations to manipulate basic geometric primitives to form more complicated objects. The most common boolean operations employed are union, intersection, and subtraction. Most computer-aided design software packages contain some sort of ability visualize CSG. The typical workflow for the user is as follows: The user specifies the individual primitive components, the user arbitrarily combines each of these primitives with boolean operations, the software generates a CSG tree structure which normally stores these solids implicitly with their defining equation, the tree is traversed and a general algorithm is applied to render the appropriate geometry onto the screen. Algorithms for visualizing CSG have been extensively developed for over a decade. Points sampled from the implicit solids are typically used as input by variations of algorithms like marching cubes and point-cloud surface reconstruction. Here, we explain a surface triangulation method from the graphics community that is being used for surface visualization in the framework of a Monte-Carlo neutron transport code called Mercury.

97 MATHEMATICS AND COMPUTING↗

Bloodhound 0.8: A Python package for infrasound data analysis

This report provides details of the algorithms in the Bloodhound package for infrasound data analysis. The report provides a detailed description of the algorithms, general instructions on tuning Bloodhound for different signal types, and a complete listing of all input parameters and the complete output schema. Several Jupyter notebooks are provided with the distribution for illustrating how to use Bloodhound for different workflows.

97 MATHEMATICS AND COMPUTING↗

Coupled Electron-Photon Monte Carlo Radiation Transport for Next-Generation Computing Systems

Traditional Monte Carlo particle transport codes are expected to run inefficiently on next-generation architectures as they are memory-intensive and highly divergent. Since electrons and photons also behave differently, the future for coupled electron-photon radiation transport looks even worse. This project describes preliminary efforts to improve the performance of Monte Carlo particle transport codes when using accelerators like the graphics processing unit (GPU). Two key issues are addressed: how to handle memory-intensive tallies, and how to reduce divergence. Tallying on the GPU can be done efficiently by post-processing particle data, or by using a feature called warp shuffle for summing scores in parallel during the simulation. Reducing divergence is possible by using an event-based algorithm for particle tracking instead of the traditional history-based one. Although performance tests presented in this work show that the history-based algorithm generally outperformed the event-based one for simple problems, this outcome will likely change as the complexity of the code increases.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Integrating Reanalysis and Satellite Cloud Information to Estimate Surface Downward Long-Wave Radiation

The estimation of downward long-wave radiation (DLR) at the surface is very important for the understanding of the Earth’s radiative budget with implications in surface–atmosphere exchanges, climate variability, and global warming. Theoretical radiative transfer and observationally based studies identify the crucial role of clouds in modulating the temporal and spatial variability of DLR. In this study, a new machine learning algorithm that uses multivariate adaptive regression splines (MARS) and the combination of near-surface meteorological data with satellite cloud information is proposed. The new algorithm is compared with the current operational formulation used by the European Organization for the Exploitation of Meteorological Satellites (EUMETSAT) Satellite Application Facility on Land Surface Analysis (LSA-SAF). Both algorithms use near-surface temperature and dewpoint temperature along with total column water vapor from the latest European Centre for Medium-range Weather Forecasts (ECMWF) reanalysis ERA5 and satellite cloud information from the Meteosat Second Generation. The algorithms are trained and validated using both ECMWF-ERA5 and DLR acquired from 23 ground stations as part of the Baseline Surface Radiation Network (BSRN) and the Atmospheric Radiation Measurement (ARM) user facility. Results show that the MARS algorithm generally improves DLR estimation in comparison with other model estimates, particularly when trained with observations. When considering all the validation data, root mean square errors (RMSEs) of 18.76, 23.55, and 22.08 W·m –2 are obtained for MARS, operational LSA-SAF, and ERA5, respectively. The added value of using the satellite cloud information is accessed by comparing with estimates driven by ERA5 total cloud cover, showing an increase of 17% of the RMSE. The consistency of MARS estimate is also tested against an independent dataset of 52 ground stations (from FLUXNET2015), further supporting the good performance of the proposed model.

54 ENVIRONMENTAL SCIENCES↗

An innovative approach to compensator design

The primary goal is to present for a control system a computer-aided-compensator design technique from a frequency domain point of view. The thesis for developing this technique is to describe the open loop frequency response by n discrete frequency points which result in n functions of the compensator coefficients. Several of these functions are chosen so that the system specifications are properly portrayed; then mathematical programming is used to improve all of these functions which have values below minimum standards. In order to do this several definitions in regard to measuring the performance of a system in the frequency domain are given. Next, theorems which govern the number of compensator coefficients necessary to make improvements in a certain number of functions are proved. After this a mathematical programming tool for aiding in the solution of the problem is developed. Then for applying the constraint improvement algorithm generalized gradients for the constraints are derived. Finally, the necessary theory is incorporated in a computer program called CIP (compensator improvement program).

Mitchell, J. R.↗

An innovative approach to compensator design

The design is considered of a computer-aided-compensator for a control system from a frequency domain point of view. The design technique developed is based on describing the open loop frequency response by n discrete frequency points which result in n functions of the compensator coefficients. Several of these functions are chosen so that the system specifications are properly portrayed; then mathematical programming is used to improve all of these functions which have values below minimum standards. To do this, several definitions in regard to measuring the performance of a system in the frequency domain are given, e.g., relative stability, relative attenuation, proper phasing, etc. Next, theorems which govern the number of compensator coefficients necessary to make improvements in a certain number of functions are proved. After this a mathematical programming tool for aiding in the solution of the problem is developed. This tool is called the constraint improvement algorithm. Then for applying the constraint improvement algorithm generalized, gradients for the constraints are derived. Finally, the necessary theory is incorporated in a Computer program called CIP (compensator Improvement Program). The practical usefulness of CIP is demonstrated by two large system examples.

Mitchell, J. R.↗

Analytical theory for artificial satellites

A theory for generating segmented ephemerides is discussed as a means for fast generation and simple retrieval of nominal orbit data. Over a succession of finite intervals of time, the orbit is represented by a best approximation expressed by Chebyshev polynomials. Storage of coefficients tables for Chebyshev polynomials is seen as a method to reduce data and decrease transmission costs. A general algorithm was constructed and computer programs were designed. The possibility of storing an ephemeris for a few days in the on-board computer, or in microprocessors attached to the data collectors is suggested.

Deprit, A.↗