Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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 793 records · Page 44
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

AMReX

AMReX is a software framework for the development and implementation of massively parallel algorithms using block-structured adaptive mesh refinement (AMR). Block-structured AMR provides the basis for the temporal and spatial discretization strategy for a large variety of applications of interest to the DOE. AMReX provides a unified infrastructure with the functionality needed for applications to be able to effectively and efficiently utilize machines from laptops to exascale accelerator-based architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving accurate descriptions of different physical processes in complex multi-physics algorithms. AMReX supports algorithms that solve systems of partial differential equations (PDEs) in simple or complex geometries, and those that use particles and/or particle-mesh operations to represent component physical processes.

Zhang, Weiqun↗
NASA NTRS1988

AI tools in computer based problem solving

The use of computers to solve value oriented, deterministic, algorithmic problems, has evolved a structured life cycle model of the software process. The symbolic processing techniques used, primarily in research, for solving nondeterministic problems, and those for which an algorithmic solution is unknown, have evolved a different model, much less structured. Traditionally, the two approaches have been used completely independently. With the advent of low cost, high performance 32 bit workstations executing identical software with large minicomputers and mainframes, it became possible to begin to merge both models into a single extended model of computer problem solving. The implementation of such an extended model on a VAX family of micro/mini/mainframe systems is described. Examples in both development and deployment of applications involving a blending of AI and traditional techniques are given.

Beane, Arthur J.↗
DOE OSTI2023

How Accurate Can Crystal Structure Predictions Be for High-Energy Molecular Crystals?

Molecular crystals have shallow potential energy landscapes, with multiple local minima separated by very small differences in total energy. Predicting molecular packing and molecular conformation in the crystal generally requires ab initio methods of high accuracy, especially when polymorphs are involved. We used dispersion-corrected density functional theory (DFT-D) to assess the capabilities of an evolutionary algorithm (EA) for the crystal structure prediction (CSP) of well-known but challenging high-energy molecular crystals (HMX, RDX, CL-20, and FOX-7). While providing the EA with the experimental conformation of the molecule quickly re-discovers the experimental packing, it is more realistic to start instead from a naïve, flat, or neutral initial conformation, which reflects the limited experimental knowledge we generally have in the computational design of molecular crystals. By doing so, and using fully flexible molecules in fully variable unit cells, we show that the experimental structures can be predicted in fewer than 20 generations. Nonetheless, one must be aware that some molecular crystals have naturally hindered evolutions, requiring as many attempts as there are space groups of interest to predict their structures, and some may require the accuracy of all-electron calculations to discriminate between closely ranked structures. To save resources in this computationally demanding process, we showed that a hybrid xTB/DFT-D approach could be considered in a subsequent study to push the limits of CSP beyond 200+ atoms and for cocrystals.

42 ENGINEERING↗
DOE OSTI2021

ArborX

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, it uses linear BVH for its low construction cost and sufficient quality. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase. ArborX also implements several advanced algorithms using geometric search, such as density-based clustering algorithm DBSCAN.

ECP↗
NASA NTRS2014

Aeroelastic Modeling of a Nozzle Startup Transient

Lateral nozzle forces are known to cause severe structural damage to any new rocket engine in development during test. While three-dimensional, transient, turbulent, chemically reacting computational fluid dynamics methodology has been demonstrated to capture major side load physics with rigid nozzles, hot-fire tests often show nozzle structure deformation during major side load events, leading to structural damages if structural strengthening measures were not taken. The modeling picture is incomplete without the capability to address the two-way responses between the structure and fluid. The objective of this study is to develop a tightly coupled aeroelastic modeling algorithm by implementing the necessary structural dynamics component into an anchored computational fluid dynamics methodology. The computational fluid dynamics component is based on an unstructured-grid, pressure-based computational fluid dynamics formulation, while the computational structural dynamics component is developed under the framework of modal analysis. Transient aeroelastic nozzle startup analyses at sea level were performed, and the computed transient nozzle fluid-structure interaction physics presented,

Wang, Ten-See↗
DOE OSTI2020

GPU-acceleration of the ELPA2 distributed eigensolver for dense symmetric and hermitian eigenproblems

The solution of eigenproblems is often a key computational bottleneck that limits the tractable system size of numerical algorithms, among them electronic structure theory in chemistry and in condensed matter physics. Large eigenproblems can easily exceed the capacity of a single compute node, thus must be solved on distributed-memory parallel computers. We here present GPU-oriented optimizations of the ELPA two-stage tridiagonalization eigensolver (ELPA2). On top of cuBLAS-based GPU offloading, we add a CUDA kernel to speed up the back-transformation of eigenvectors, which can be the computationally most expensive part of the two-stage tridiagonalization algorithm. Furthermore, we benchmark the performance of this GPU-accelerated eigensolver on two hybrid CPU–GPU architectures, namely a compute cluster based on Intel Xeon Gold CPUs and NVIDIA Volta GPUs, and the Summit supercomputer based on IBM POWER9 CPUs and NVIDIA Volta GPUs. Consistent with previous benchmarks on CPU-only architectures, the GPU-accelerated two-stage solver exhibits a parallel performance superior to the one-stage counterpart. Finally, we demonstrate the performance of the GPU-accelerated eigensolver developed in this work for routine semi-local KS-DFT calculations comprising thousands of atoms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Fossil group origins

Aims: We analyse the large-scale structure out to 100 Mpc around a sample of 16 confirmed fossil systems using spectroscopic information from the Sloan Digital Sky Survey Data Release 16. Methods: We computed the distance between our fossil groups (FGs) and the centres of filaments and nodes from the literature. We also studied the density of bright galaxies, since this parameter is thought to be a good mass tracers, as well as the projected over-densities of galaxies. Finally, we applied a friends-of-friends (FoF) algorithm to detect virialised structures around our FGs and obtain an estimate of the mass available in their surroundings. Results: We find that FGs are mainly located close to filaments, with a mean distance of 3.7 ± 1.1 R 200 and a minimum distance of 0.05 R 200 . On the other hand, none of our FGs were found close to intersections, with a mean and minimum distance of 19.3 ± 3.6 and 6.1 R 200 , respectively. There is a correlation that indicates FGs at higher redshifts are found in denser regions, when we use bright galaxies as tracers of the mass. At the same time, FGs with the largest magnitude gaps (Δm 12 > 2.5) are found in less dense environments and tend to host (on average) smaller central galaxies. Conclusions: Our results suggest that FGs formed in a peculiar position within the cosmic web, close to filaments and far from nodes, whereby their interaction with the cosmic web itself may be limited. We deduce that FGs with brightest central galaxies (BCGs) that are relatively faint, high values of Δm 12 , and low redshifts could, in fact, be systems that are at the very last stage of their evolution. Moreover, we confirm theoretical predictions that systems with the largest magnitude gap are not massive.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1989

Numerical simulation of controlled large space structures

Large Space Structures do not have much damping, which necessitates the installation of a controller onto the structure. If the controller is improperly designed, the structure may become unstable and be destroyed. Since Large Space Structures are extremely expensive pieces of hardware, new controllers must not be tested first on the structure. They must first be tested in computer simulations. Until now, the usual procedure for simulating controlled Large Space Structures is to compute a reduced order modal representation of the structure and then apply the controller. However, this procedure entails modal truncation error. A new software package which is free from this error is currently under development within the Center for Space Construction. The more accurate finite element representation of the structure is used in the simulation, instead of the less accurate reduced order modal representation. This software also features an efficient matrix storage scheme, which effectively deals with the asymmetric system matrices which occur when control is added to the structure. Also, an integration algorithm was chosen so that the simulation is a reliable indicator of system stability or instability. The software package is fairly general in nature. Linearity of the finite element model and of the controller is the only assumption made. Actuator dynamics, sensor dynamics, noise, and disturbances can be handled by the package. In addition, output feedback of displacement, velocity, and/or acceleration signals can be simulated. Kalman state estimation was also implemented. This software was tested on a finite element model of a real Large Space Structure: The Mini-Mast Truss. Mini-Mast is a testbed at NASA-Langley which is currently under development. A 714 degree of freedom finite element model was computed, and a 19 state controller was designed for it. Torque wheel dynamics were added to the model, and the entire closed loop system was simulated with the software package.

Quan, Ralph↗
DOE OSTI2019

Aspherical particle models for molecular dynamics simulation

In traditional molecular dynamics (MD) simulations, atoms and coarse-grained particles are modeled as point masses interacting via isotropic potentials. For studies where particle shape plays a vital role, more complex models are required. Here, we describe a spectrum of approaches for modeling aspherical particles, all of which are now available (some recently) as options within the LAMMPS MD package. Broadly these include two classes of models. In the first, individual particles are aspherical, either via a pairwise anisotropic potential which implicitly assigns a simple geometric shape to each particle, or in a more general way where particles store internal state which can explicitly define a complex geometric shape. In the second class of models, individual particles are simple points or spheres, but rigid body constraints are used to create composite aspherical particles in a variety of complex shapes. This work discusses parallel algorithms and associated data structures for both kinds of models, which enable dynamics simulations of aspherical particle systems across a wide range of length and time scales. We also highlight parallel performance and scalability and give a few illustrative examples of aspherical models in different contexts.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2015

Multi-reference approach to the calculation of photoelectron spectra including spin-orbit coupling

X-ray photoelectron spectra provide a wealth of information on the electronic structure. The extraction of molecular details requires adequate theoretical methods, which in case of transition metal complexes has to account for effects due to the multi-configurational and spin-mixed nature of the many-electron wave function. Here, the restricted active space self-consistent field method including spin-orbit coupling is used to cope with this challenge and to calculate valence- and core-level photoelectron spectra. The intensities are estimated within the frameworks of the Dyson orbital formalism and the sudden approximation. Thereby, we utilize an efficient computational algorithm that is based on a biorthonormal basis transformation. The approach is applied to the valence photoionization of the gas phase water molecule and to the core ionization spectrum of the [Fe(H{sub 2}O){sub 6}]{sup 2+} complex. The results show good agreement with the experimental data obtained in this work, whereas the sudden approximation demonstrates distinct deviations from experiments.

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

Flow-induced vibration analysis of a helical coil steam generator experiment using large eddy simulation

This paper describes a numerical study of flow-induced vibration in a helical coil steam generator experiment conducted at Argonne National Laboratory in the 1980s. In the experiment, a half-scale sector model of a steam generator helical coil tube bank was subjected to still and flowing air and water, and the vibrational characteristics were recorded. The research detailed in this document utilizes the multi-physics simulation toolkit SHARP developed at Argonne National Laboratory, in cooperation with Lawrence Livermore National Laboratory, to simulate the experiment. SHARP uses the spectral element code Nek5000 for fluid dynamics analysis and the finite element code DIABLO for structural analysis. The flow around the coil tubes is modeled in Nek5000 by using a large eddy simulation turbulence model. Transient pressure data on the tube surfaces is sampled and transferred to DIABLO for the structural simulation. The structural response is simulated in DIABLO via an implicit time-marching algorithm and a combination of continuum elements and structural shells. Tube vibration data (acceleration and frequency) are sampled and compared with the experimental data. Currently, only one-way coupling is used, which means that pressure loads from the fluid simulation are transferred to the structural simulation but the resulting structural displacements are not fed back to the fluid simulation

CFD↗
DOE OSTI2014

Structures in the protoplanetary disk of HD142527 seen in polarized scattered light

We present H- and K {sub s}-band polarized differential images of the Herbig Ae/Be star HD142527, revealing its optically thick outer disk and the nearly empty gap. The very small inner working angle (∼0.''1) and high-resolution achievable with an 8 m class telescope, together with a careful polarimetric calibration strategy, allow us to achieve images that surpass the quality of previous scattered-light images. Previously known substructures are resolved more clearly and new structures are seen. Specifically, we are able to resolve (1) half a dozen spiral structures in the disk, including previously known outer-disk spirals as well as new spiral arms and arcs close to the inner rim of the disk, (2) peculiar holes in the polarized surface brightness at position angles (P.A.'s) of ∼0° and ∼160°, (3) the inner rim on the eastern side of the disk, and (4) the gap between the outer and inner disk, ranging from the inner working angle of 0.''1 out to between 0.''7 and 1.''0, which is nearly devoid of dust. We then use a Markov Chain Monte Carlo algorithm to determine several structural parameters of the disk, using very simple assumptions, including its inclination, eccentricity, and the scale height of the inner rim. We compare our results with previous work on this object and try to produce a consistent picture of the system and its transition disk.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

An explicitly solvable energy-conserving algorithm for pitch-angle scattering in magnetized plasmas

In this work, we develop an Explicitly Solvable Energy-Conserving (ESEC) algorithm for the Stochastic Differential Equation (SDE) describing the pitch-angle scattering process in magnetized plasmas. The Cayley transform is used to calculate both the deterministic gyromotion and stochastic scattering, affording the algorithm to be explicitly solvable and exactly energy conserving. An unusual property of the SDE for pitch-angle scattering is that its coefficients diverge at the zero velocity and do not satisfy the global Lipschitz condition. Consequently, when standard numerical methods, such as the Euler-Maruyama (EM), are applied, numerical convergence is difficult to establish. For the proposed ESEC algorithm, its energy-preserving property enables us to overcome this obstacle. We rigorously prove that the ESEC algorithm is order 1/2 strongly convergent. This result is confirmed by detailed numerical studies. For the case of pitch-angle scattering in a magnetized plasma with a constant magnetic field, the numerical solution is benchmarked against the analytical solution, and excellent agreements are found.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Learning From User Behavior: A Survey-Assist Algorithm for Longitudinal Mobility Data Collection

GPS-based travel surveys are widely used in mobility studies to gather crucial qualitative data, like purpose, transportation mode and replaced mode. However, survey response still poses a burden to users, especially in long-term mobility studies, leading to response fatigue. We explore a survey-assist strategy to ease this burden by a novel, user-level modeling approach that leverages past responses from each user to predict responses for new trips, without relying on external data sources like GIS data. We investigate three main algorithms for predicting responses: (i) clustering trips and extrapolating responses for similar trips, (ii) using random forest classification, and (iii) clustering that uses a hybrid algorithm to determine spatial structure, which is then fed as input to a classic random forest classifier. The clustering approach can flexibly predict responses for even complex qualitative survey questions; it achieved F-scores of 65%. The random forest pipeline uses architecture that restricts it to predicting three predetermined survey questions: trip purpose, mode, and replaced mode. However, it achieved F-scores of 78%. While the survey-assist approach has been implemented by several proprietary systems, to our knowledge, this is the first exploration in the academic literature. It follows that this is also the first rigorous evaluation of multiple algorithms that can implement the approach. The evaluation uses a large scale, publicly available, longitudinal dataset consisting of ~ 92k trips from 235 users over a period of roughly one and a half years. With this approach, travel surveys can be pre-filled with the predicted responses for each trip, thus streamlining the survey process for users. Combined with an active learning system that requests user input on low-confidence predictions, models can be updated and improved over time to better support the long-term collection of longitudinal qualitative data.

clustering↗
NASA NTRS1992

Conservative Grid-Interface Algorithm For Computing Flows

Best features of structured- and unstructured-grid methods combined. Gaps and overlaps between zonal grids eliminated by grid-interface algorithm, which generates single interfacial grid and corrects fluxes of flow quantities accordingly. Incorporated into two three-dimensional Navier-Stokes finite-volume codes and tested in computations of incompressible and compressible flows about simple bodies. Good numerical results obtained. General enough to be incorporated into other finite-volume codes without restrictions on complexities of shapes of bodies and zonal interfaces.

Klopfer, G. H.↗
DOE OSTI2017

Alternative difference analysis scheme combining R -space EXAFS fit with global optimization XANES fit for X-ray transient absorption spectroscopy

Time-resolved X-ray absorption spectroscopy (TR-XAS), based on the laser-pump/X-ray-probe method, is powerful in capturing the change of the geometrical and electronic structure of the absorbing atom upon excitation. TR-XAS data analysis is generally performed on the laser-on minus laser-off difference spectrum. Here, a new analysis scheme is presented for the TR-XAS difference fitting in both the extended X-ray absorption fine-structure (EXAFS) and the X-ray absorption near-edge structure (XANES) regions. R -space EXAFS difference fitting could quickly provide the main quantitative structure change of the first shell. The XANES fitting part introduces a global non-derivative optimization algorithm and optimizes the local structure change in a flexible way where both the core XAS calculation package and the search method in the fitting shell are changeable. The scheme was applied to the TR-XAS difference analysis of Fe(phen) 3 spin crossover complex and yielded reliable distance change and excitation population.

Zhan, Fei↗
NASA NTRS2011

Defining Dynamic Route Structure

This poster describes a method for defining route structure from flight tracks. Dynamically generated route structures could be useful in guiding dynamic airspace configuration and helping controllers retain situational awareness under dynamically changing traffic conditions. Individual merge and diverge intersections between pairs of flights are identified, clustered, and grouped into nodes of a route structure network. Links are placed between nodes to represent major traffic flows. A parametric analysis determined the algorithm input parameters producing route structures of current day flight plans that are closest to todays airway structure. These parameters are then used to define and analyze the dynamic route structure over the course of a day for current day flight paths. Route structures are also compared between current day flight paths and more user preferred paths such as great circle and weather avoidance routing.

Zelinski, Shannon↗
NASA NTRSDate not supplied

Sheaf Theoretic Models for Routing in Delay Tolerant Networks

One key to communications scalability is routing; as such the goal of this paper is to build upon successful efforts towards general routing for space-based networks. With the ever-increasing accessibility of space, the number of assets is increasing, which becomes a critical communications burden in terms of scheduling, spectrum allocation, and resource allocation. In order to mitigate these concerns, a true networking approach is necessary; a standard approach for space systems is Delay Tolerant Networking (DTN). For DTN to be a meaningful answer to the Solar System Internet (SSI) question, DTN must offer meaningful routing solutions that span the heterogeneous collection of links and nodes. This, in turn, depends on the general structure of these disconnected networks -- a structure that remains largely unknown. In ground communications networks, routing decisions are made based on several pathfinding algorithms working in tandem. In previous work, we modeled Dijkstra's pathfinding algorithm using sheaves and provided a more general framework for determining paths using sheaves over graphs. Continuing our sheaf-theoretic approach, we introduce here an expansion of our pathfinding sheaf to handle more general information, and we expand on additional pathfinding algorithms that can be represented using sheaves. Moreover, we demonstrate means of combining multiple algorithms into a single sheaf structure so that changes of scale can be presented in the language of sheaves. In addition, space communications networks rely upon radio transmitter antennas which can establish broadcast and multicast communications options, rather than the primarily unicast options available to wired networks. Last year, we also introduced a multicast routing sheaf for presenting broadcast, unicast, and multicast communications over a graph. Extending that work, we also introduce queuing sheaves so that we can blend these communications options together to simulate a variety of routing options across space networks. In addition, we include examples to illustrate the applicability of this abstract theory to routing in disconnected networks.

Robert Short↗