Search NASASearch

SEARCH · Search NASA

Results for “Computer implementation”

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

On the analytical determination of relaxation modulus of viscoelastic materials by Prony's interpolation method

A computer implementation to Prony's curve fitting by exponential functions is presented. The method, although more than one hundred years old, has not been utilized to its fullest capabilities due to the restriction that the time range must be given in equal increments in order to obtain the best curve fit for a given set of data. The procedure used in this paper utilizes the 3-dimensional capabilities of the Interactive Graphics Design System (I.G.D.S.) in order to obtain the equal time increments. The resultant information is then input into a computer program that solves directly for the exponential constants yielding the best curve fit. Once the exponential constants are known, a simple least squares solution can be applied to obtain the final form of the equation.

Rodriguez, Pedro I.

Predicting broadband noise from a stator vane of a gas turbine engine

A computer-implemented model of fan section of a gas turbine engine accounts for the turbulence in the gas flow emanating from the rotor assembly and impinging upon an inlet to the stator vane cascade. The model allows for user-input variations in the sweep and/or lean angles for the stator vanes. The model determines the resulting acoustic response of the fan section as a function of the turbulence and the lean and/or sweep angles of the vanes. The model may be embodied in software that is rapidly executed in a computer. This way, an optimum arrangement in terms of fan noise reduction is quickly determined for the stator vane lean and sweep physical positioning in the fan section of a gas turbine engine.

Hanson, Donald B.

Autorotation flight control system

The present invention provides computer implemented methodology that permits the safe landing and recovery of rotorcraft following engine failure. With this invention successful autorotations may be performed from well within the unsafe operating area of the height-velocity profile of a helicopter by employing the fast and robust real-time trajectory optimization algorithm that commands control motion through an intuitive pilot display, or directly in the case of autonomous rotorcraft. The algorithm generates optimal trajectories and control commands via the direct-collocation optimization method, solved using a nonlinear programming problem solver. The control inputs computed are collective pitch and aircraft pitch, which are easily tracked and manipulated by the pilot or converted to control actuator commands for automated operation during autorotation in the case of an autonomous rotorcraft. The formulation of the optimal control problem has been carefully tailored so the solutions resemble those of an expert pilot, accounting for the performance limitations of the rotorcraft and safety concerns.

Bachelder, Edward N.

Area estimation of crops by digital analysis of Landsat data

The study for which the results are presented had these objectives: (1) to use Landsat data and computer-implemented pattern recognition to classify the major crops from regions encompassing different climates, soils, and crops; (2) to estimate crop areas for counties and states by using crop identification data obtained from the Landsat identifications; and (3) to evaluate the accuracy, precision, and timeliness of crop area estimates obtained from Landsat data. The paper describes the method of developing the training statistics and evaluating the classification accuracy. Landsat MSS data were adequate to accurately identify wheat in Kansas; corn and soybean estimates for Indiana were less accurate. Systematic sampling of entire counties made possible by computer classification methods resulted in very precise area estimates at county, district, and state levels.

Bauer, M. E.

Implementation of Kane's Method for a Spacecraft Composed of Multiple Rigid Bodies

Equations of motion are derived for a general spacecraft composed of rigid bodies connected via rotary (spherical or gimballed) joints in a tree topology. Several supporting concepts are developed in depth. Basis dyads aid in the transition from basis-free vector equations to component-wise equations. Joint partials allow abstraction of 1-DOF, 2-DOF, 3-DOF gimballed and spherical rotational joints to a common notation. The basic building block consisting of an "inner" body and an "outer" body connected by a joint enables efficient organization of arbitrary tree structures. Kane's equation is recast in a form which facilitates systematic assembly of large systems of equations, and exposes a relationship of Kane's equation to Newton and Euler's equations which is obscured by the usual presentation. The resulting system of dynamic equations is of minimum dimension, and is suitable for numerical solution by computer. Implementation is ·discussed, and illustrative simulation results are presented.

Stoneking, Eric T.

Flow in a differentially rotated cylindrical drop at moderate Reynolds number

Galerkin finite-element approximations are combined with computer-implemented perturbation methods for tracking families of solutions to calculate the steady axisymmetric flows in a differentially rotated cylindrical drop as a function of Reynolds number Re, drop aspect ratio and the rotation ratio between the two end disks. The flows for Reynolds numbers below 100 are primarily viscous and reasonably described by an asymptotic analysis. When the disks are exactly counter-rotated, multiple steady flows are calculated that bifurcate to higher values of Re from the expected solution with two identical secondary cells stacked symmetrically about the axial midplane. The new flows have two cells of different size and are stable beyond the critical value Re sub c. The slope of the locus of Re sub c for drops with aspect ratio up to 3 disagrees with the result for two disks of infinite radius computed assuming the similarity form of the velocity field. Changing the rotation ratio for exact counter-rotation ruptures the junction of the multiple flow fields into two separated flow families.

Harriott, G. M.

Unsupervised discovery of extreme weather events using universal representations of emergent organization

Spontaneous self-organization is ubiquitous in systems far from thermodynamic equilibrium. While organized structures that emerge dominate transport properties, universal representations that identify and describe these key objects remain elusive. Here, we introduce a theoretically grounded framework for describing emergent organization that, via data-driven algorithms, is constructive in practice. Its building blocks are spacetime lightcones that embody how information propagates across a system through local interactions. We show that predictive equivalence classes of lightcones—local causal states—capture organized behaviors in complex spatiotemporal systems. Employing an unsupervised physics-informed machine learning algorithm and a high-performance computing implementation, we demonstrate automatically discovering organized structures in two real-world domain science problems. We show that local causal states identify vortices and track their power-law decay behavior in two-dimensional fluid turbulence. We then show how to detect and track familiar extreme weather events—hurricanes and atmospheric rivers—and discover other novel structures associated with precipitation extremes in high-resolution climate data at the grid-cell level.

Rupe, Adam [Pacific Northwest National Laboratory

Autonomous Environment-Monitoring Networks

Autonomous environment-monitoring networks (AEMNs) are artificial neural networks that are specialized for recognizing familiarity and, conversely, novelty. Like a biological neural network, an AEMN receives a constant stream of inputs. For purposes of computational implementation, the inputs are vector representations of the information of interest. As long as the most recent input vector is similar to the previous input vectors, no action is taken. Action is taken only when a novel vector is encountered. Whether a given input vector is regarded as novel depends on the previous vectors; hence, the same input vector could be regarded as familiar or novel, depending on the context of previous input vectors. AEMNs have been proposed as means to enable exploratory robots on remote planets to recognize novel features that could merit closer scientific attention. AEMNs could also be useful for processing data from medical instrumentation for automated monitoring or diagnosis. The primary substructure of an AEMN is called a spindle. In its simplest form, a spindle consists of a central vector (C), a scalar (r), and algorithms for changing C and r. The vector C is constructed from all the vectors in a given continuous stream of inputs, such that it is minimally distant from those vectors. The scalar r is the distance between C and the most remote vector in the same set. The construction of a spindle involves four vital parameters: setup size, spindle-population size, and the radii of two novelty boundaries. The setup size is the number of vectors that are taken into account before computing C. The spindle-population size is the total number of input vectors used in constructing the spindle counting both those that arrive before and those that arrive after the computation of C. The novelty-boundary radii are distances from C that partition the neighborhood around C into three concentric regions (see Figure 1). During construction of the spindle, the changing spindle radius is denoted by h. It is the final value of h, reached before beginning construction on the next spindle, that is denoted by r. During construction of a spindle, if a new vector falls between C and the inner boundary, the vector is regarded as completely familiar and no action is taken. If the new vector falls into the region between the inner and outer boundaries, it is considered unusual enough to warrant the adjustment of C and r by use of the aforementioned algorithms, but not unusual enough to be considered novel. If a vector falls outside the outer boundary, it is considered novel, in which case one of several appropriate responses could be initiation of construction of a new spindle.

Hand, Charles

Gradient flow based phase-field modeling using separable neural networks

Allen–Cahn equation is a reaction–diffusion equation and is widely used for modeling phase separation. Machine learning methods for solving the Allen–Cahn equation in its strong form suffer from inaccuracies in collocation techniques, errors in computing higher-order spatial derivatives, and the large system size required by the space–time approach. To overcome these challenges, we propose solving the gradient flow of the Ginzburg–Landau free energy functional, which is equivalent to the Allen–Cahn equation, thereby avoiding the second-order spatial derivatives associated with the Allen–Cahn equation. A minimizing movement scheme is employed to solve the gradient flow problem, eliminating the complexities of a space–time approach. We utilize a separable neural network that efficiently represents the phase field through low-rank tensor decomposition. As we use the minimizing movement scheme to numerically solve the gradient flow problem, we thus, refer to the proposed method as the Separable Deep Minimizing Movement (SDMM) method. The evaluation of the functional in the minimizing movement scheme using the Gauss quadrature technique bypasses the inaccuracies associated with collocation techniques traditionally used to solve partial differential equations. A hyperbolic tangent transformation is introduced on the phase field prior to the evaluation of the functional to ensure that it remains strictly bounded within the values of the two phases. For this transformation, theoretical guarantee for energy stability of the minimizing movement scheme is established. Our results suggest that this transformation helps to improve the accuracy and efficiency significantly. The proposed method resolves the challenges faced by state-of-the-art machine learning techniques, outperforming them in both accuracy and efficiency. It is also the first machine learning method to achieve an order of magnitude speed improvement over the finite element method. In addition to its formulation and computational implementation, several case studies illustrate the applicability of the proposed method.

42 ENGINEERING

Computing the QRPA level density with the finite amplitude method

Here, we describe a new algorithm to calculate the vibrational nuclear level density of an atomic nucleus. Fictitious perturbation operators that probe the response of the system are generated by drawing their matrix elements from some probability distribution function. We use the Finite Amplitude Method to explicitly compute the response for each such sample. With the help of the Kernel Polynomial Method, we build an estimator of the vibrational level density and provide the upper bound of the relative error in the limit of infinitely many random samples. The new algorithm can give accurate estimates of the vibrational level density. Since it is based on drawing multiple samples of perturbation operators, its computational implementation is naturally parallel and scales like the number of available processing units.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

Residual stress distribution in an additively manufactured complex structure by neutron diffraction measurement

Residual stress in an aerodynamically shaped Ni-based superalloy airfoil fabricated by laser powder bed fusion was measured by neutron diffraction. The experiment was conducted by considering the complex shape, implementing computer aided experiment planning, and automatic alignment at each rapid measurement. The 3-dimensional (3D) residual stress distribution in the airfoil is presented in this work, which lacks symmetry due to the complex geometry of the airfoil. In conclusion, the results provide theoretical thermal processing models a complete residual stress dataset of simulation validation on 3D shape complex structure.

Residual stress

Dissipation Pathways in a Photosynthetic Complex

Determining how energy flows within and between molecules is crucial for understanding chemical reactions, material properties, and even vital processes such as photosynthesis. While the general principles of energy transfer are well established, elucidating the specific molecular pathways by which energy is funneled remains challenging, as it requires tracking energy flow in complex molecular environments. Here, we demonstrate how photon excitation energy is partially dissipated in the light-harvesting Fenna–Matthews–Olson (FMO) complex, mediating the excitation energy transfer from light-harvesting chlorosomes to the photosynthetic reaction center in green sulfur bacteria. Specifically, we isolate the contribution of the protein and specific vibrational modes of the pigment molecules to the energy dynamics. For this, we introduce an efficient computational implementation of a recently proposed theory of dissipation pathways for open quantum systems, based on second-order perturbation theory in the electronic couplings. Using it and a state-of-the-art FMO model with highly structured and chromophore-specific spectral densities, we demonstrate that energy dissipation is dominated by low-frequency modes (<800 cm –1 ) as their energy range is near-resonance with the energy gaps between electronic states of the pigments. We identify the most important modes for dissipation to be in-plane breathing modes (∼200 cm –1 ) of the bacteriochlorophylls in the complex. Conversely, far-detuned intramolecular vibrations with higher frequencies (>800 cm –1 ) play no role in dissipation. Interestingly, the FMO complex first needs to borrow energy from the environment to release excess photonic energy, indicating that the energy exchange between the system and thermal environment is not strictly unidirectional in time but involves a transient thermally activated step. Beyond their fundamental value, these insights can guide the development of artificial light-harvesting devices and, more broadly, engineer environments for chemical and quantum control tasks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Benchmark for two-dimensional large scale coherent structures in partially magnetized E × B plasmas—community collaboration & lessons learned

Low-temperature plasmas (LTPs) are essential to both fundamental scientific research and critical industrial applications. As in many areas of science, numerical simulations have become a vital tool for uncovering new physical phenomena and guiding technological development. Code benchmarking remains crucial for verifying implementations and evaluating performance. This work continues the Landmark benchmark initiative, a series specifically designed to support the verification of LTP codes. In this study, seventeen simulation codes from a collaborative community of nineteen international institutions modeled a partially magnetized E × B Penning discharge. The emergence of large scale coherent structures, or rotating plasma spokes, endows this configuration with an enormous range of time scales, making it particularly challenging to simulate. The codes showed excellent agreement on the rotation frequency of the spoke as well as key plasma properties, including time-averaged ion density, plasma potential, and electron temperature profiles. Achieving this level of agreement came with challenges, and we share lessons learned on how to conduct future benchmarking campaigns. Comparing code implementations, computational hardware, and simulation runtimes also revealed interesting trends, which are summarized with the aim of guiding future plasma simulation software development.

benchmarking

Theory of ab initio downfolding with arbitrary-range electron-phonon coupling

Ab initio downfolding describes the electronic structure of materials within a low-energy subspace, often around the Fermi level. Typically starting from mean-field calculations, this framework allows for the calculation of one- and two-electron interactions, and the parametrization of a many-body Hamiltonian representing the active space of interest. The subsequent solution of such Hamiltonians can provide insights into the physics of strongly correlated materials. While phonons can substantially screen electron-electron interactions, electron-phonon coupling has been commonly ignored within ab initio downfolding, and when considered, this is done only for short-range coupling. Here we propose a theory of ab initio downfolding that accounts for short- and long-range electron-phonon coupling on equal footing. Our practical computational implementation is readily compatible with current downfolding approaches. We apply our approach to polar materials MgO and GeTe, and we reveal the importance of both short-range and long-range electron-phonon coupling in determining the magnitude of electron-electron interactions. Our results show that in the static limit, phonons reduce the on-site repulsion between electrons by 40% for MgO and by 79% for GeTe. Our framework also predicts that overall attractive nearest-neighbor interactions arise between electrons in GeTe, consistent with superconductivity in this material.

Tubman, Norm M

Desmearing small-angle scattering data by central moment expansions of instrument resolution

This study introduces an enhanced numerical technique tailored specifically for refining 1D small-angle scattering (SAS) intensity profiles affected by smearing. Our primary objective is to address the resolution blurring commonly encountered in SAS data, particularly in systems with clearly defined correlation peaks whose spread aligns with the width of the resolution function at corresponding Q positions. Unlike previous approaches that expanded the SAS intensity using central moment expansion, the new method focuses on expanding the resolution function itself, thus eliminating artificial oscillations observed in smeared spectra due to limitations inherent in our earlier algorithm. This method is straightforward to implement, computationally efficient and consistently performs well in numerical benchmarking. To illustrate its effectiveness, we present a case study of a lamellar phase characterized by distinct peaks in its small-angle neutron scattering intensities.

central moment expansions

A Survey on the Expanding Scope and Interdisciplinary Opportunities for Processing-in-Memory Techniques

Processing-in-Memory (PIM) is emerging as a practical path to overcome the limitations of traditional von Neumann architectures. At its core, PIM systems implement computing primitives such as logic operations and multiply-accumulate acceleration through compute-in-memory, near-memory processing, or hybrid designs. The role of memory cells varies widely across technologies, acting as inputs, outputs, or analog accumulators through bit-lines and sense amplifiers. This diversity creates trade-offs in precision, bandwidth, latency, and programmability, making it difficult to build a unified understanding on the progress of the field. In this survey, we organize recent advances of PIM into three areas. First, we discuss the progress on the architectural optimizations of PIM and its integration with both DRAM and emerging non-volatile memories. Second, we examine how PIM is being used to accelerate key computing domains, including generative AI workloads and high-performance kernels, along with new approaches. Third, we highlight the growing adoption of PIM in computational sciences, where it is being applied to solve interdisciplinary problems such as genome analysis, mRNA quantification, mass spectrometry, quantum circuit simulation, wave modeling, and secure computation. Finally, we synthesize the major challenges that continue to slow PIM adoption, including manufacturing constraints, power delivery, thermal reliability, data consistency, runtime and memory-management coordination, and the difficulty of building portable software abstractions without sacrificing commercial viability. This work provides an updated, structured perspective on PIM’s potential across computing and computational sciences and the barriers that must be solved for it to reach its full impact.

Asifuzzaman, Kazi [Oak Ridge National Laboratory (