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 1,297 records · Page 72
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

K-space algorithmic reconstruction (KAREN): a robust statistical methodology to separate Bragg and diffuse scattering

Diffuse scattering occurring in the Bragg diffraction pattern of a long-range-ordered structure represents local deviation from the governing regular lattice. However, interpreting the real-space structure from the diffraction pattern presents a significant challenge because of the dramatic difference in intensity between the Bragg and diffuse components of the total scattering function. In contrast to the sharp Bragg diffraction, the diffuse signal has generally been considered to be a weak expansive or continuous background signal. In this paper, using 1D and 2D models, it is demonstrated that diffuse scattering in fact consists of a complex array of high-frequency features that must not be averaged into a low-frequency background signal. To evaluate the actual diffuse scattering effectively, an algorithm has been developed that uses robust statistics and traditional signal processing techniques to identify Bragg peaks as signal outliers which can be removed from the overall scattering data and then replaced by statistically valid fill values. This method, described as a 'K-space algorithmic reconstruction' (KAREN), can identify Bragg reflections independent of prior knowledge of a system's unit cell. KAREN does not alter any data other than that in the immediate vicinity of the Bragg reflections, and reconstructs the diffuse component surrounding the Bragg peaks without introducing discontinuities which induce Fourier ripples or artifacts from underfilling `punched' voids. The KAREN algorithm for reconstructing diffuse scattering provides demonstrably better resolution than can be obtained from previously described punch-and-fill methods. The superior structural resolution obtained using the KAREN method is demonstrated by evaluating the complex ordered diffuse scattering observed from the neutron diffraction of a single plastic crystal of CBr 4 using pair distribution function analysis.

36 MATERIALS SCIENCE↗
DOE OSTI2013

Asymptotic expansion of two-electron integrals and its application to Coulomb and exchange lattice sums in metallic, semimetallic, and nonmetallic crystals

A simple, easily implemented, accurate, and efficient approximation of long-range electron-electron-repulsion and electron-nucleus-attraction integrals is proposed. It replaces each product of two atomic-orbital (AO) basis functions of an electron by a point charge centered at the midpoint of the two AO's. The magnitude of the point charge is equal to the overlap integral of the two AO's. Each integral is then rapidly evaluated in the direct algorithm as a Coulomb interaction between two point charges. This scheme is implemented in ab initio Hartree–Fock crystalline orbital theory and tested for one-, two-, and three-dimensional solids of metallic, semimetallic, and nonmetallic electronic structures, in which the lattice sums of the direct Coulomb and/or exchange interactions are expected to be slowly convergent. It is shown that this approximation reduces operation and/or memory costs by up to an order of magnitude to achieve converged lattice sums, although the scaling (size dependence) of operation cost is unchanged. An improved criterion for truncating the exchange lattice sum is also proposed.

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

A Thermo‐Flow‐Mechanics‐Fracture Model Coupling a Phase‐Field Interface Approach and Thermo‐Fluid‐Structure Interaction

This work proposes a novel approach for coupling non-isothermal fluid dynamics with fracture mechanics to capture thermal effects within fluid-filled fractures accurately. This method addresses critical aspects of calculating fracture width in enhanced geothermal systems, where the temperature effects of fractures are crucial. The proposed algorithm features an iterative coupling between an interface-capturing phase-field fracture method and interface-tracking thermo-fluid-structure interaction using arbitrary Lagrangian–Eulerian coordinates. We use a phase-field approach to represent fractures and reconstruct the geometry to frame a thermo-fluid-structure interaction problem, resulting in pressure and temperature fields that drive fracture propagation. We developed a novel phase-field interface model accounting for thermal effects, enabling the coupling of quantities specific to the fluid-filled fracture with the phase-field model through the interface between the fracture and the intact solid domain. We provide several numerical examples to demonstrate the capabilities of the proposed algorithm. In particular, we analyze mesh convergence of our phase-field interface model, investigate the effects of temperature on crack width and volume in a static regime, and highlight the method's potential for modeling slowly propagating fractures.

fracture↗
DOE OSTI2019

Composite matrix construction for structured grid adaptive mesh refinement

Structured-grid adaptive mesh refinement (SAMR) is an approach to mesh generation that supports structured access to data and adaptive mesh refinement for discretized partial differential equations (PDEs). Solution algorithms often require that an inverse of an operator be applied, a system of algebraic equations must be solved, and this process is often the primary computational cost in an application. SAMR is well suited to geometric multigrid solvers, which can be effective, but often do not adapt well to complex geometry including material coefficients. Algebraic multigrid (AMG) is more robust in the face of complex geometry, in both boundary conditions and internal material interfaces. AMG requires a stored matrix linearization of the operator. We discuss an approach, and an implementation in the Chombo block-structured AMR framework, for constructing composite grid matrices from a SAMR hierarchy of grids for use in linear solvers in the PETSc numerical library. We consider a case study with the Chombo-based BISICLES ice sheet modeling application.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Learning-based traffic signal control algorithms with neighborhood information sharing: An application for sustainable mobility

Here, this research applies R-Markov Average Reward Technique based reinforcement learning (RL) algorithm, namely RMART, for vehicular signal control problem leveraging information sharing among signal controllers in connected vehicle environment. We implemented the algorithm in a network of 18 signalized intersections and compare the performance of RMART with fixed, adaptive, and variants of the RL schemes. Results show significant improvement in system performance for RMART algorithm with information sharing over both traditional fixed signal timing plans and real time adaptive control schemes. Additionally, the comparison with reinforcement learning algorithms including Q learning and SARSA indicate that RMART performs better at higher congestion levels. Further, a multi-reward structure is proposed that dynamically adjusts the reward function with varying congestion states at the intersection. Finally, the results from test networks show significant reduction in emissions (CO, CO 2 , NO x , VOC, PM 10 ) when RL algorithms are implemented compared to fixed signal timings and adaptive schemes.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2018

Investigating the role of non-covalent interactions in conformation and assembly of triazine-based sequence-defined polymers

Grate and co-workers at Pacific Northwest National Laboratory recently developed high information content triazine-based sequence-defined polymers that are robust by not having hydrolyzable bonds and can encode structure and functionality by having various side chains. Through molecular dynamics (MD) simulations, the triazine polymers have been shown to form particular sequential stacks, have stable backbone-backbone interactions through hydrogen bonding and π–π interactions, and conserve their cis/trans conformations throughout the simulation. However, we do not know the effects of having different side chains and backbone structures on the entire conformation and whether the cis or trans conformation is more stable for the triazine polymers. For this reason, we investigate the role of non-covalent interactions for different side chains and backbone structures on the conformation and assembly of triazine polymers in MD simulations. Since there is a high energy barrier associated with the cis-trans isomerization, we use replica exchange molecular dynamics (REMD) to sample various conformations of triazine hexamers. To obtain rates and intermediate conformations, we use the recently developed concurrent adaptive sampling (CAS) algorithm for dimers of triazine trimers. Here, we found that the hydrogen bonding ability of the backbone structure is critical for the triazine polymers to self-assemble into nanorod-like structures, rather than that of the side chains, which can help researchers design more robust materials.

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

Sampling Density in Regional Exploration and Environmental Geochemical Studies: A Review

A variety of factors contribute to the proper and efficient evaluation of geochemical programs including sampling medium, sample size and sample fraction, sampling density, digestion procedure, and analytical techniques. Among the aforementioned factors, sampling density is of great importance, affecting project ability to detect anomalous sites, which are either economically viable or environmentally hazardous. It is quite critical to have a sufficient number of samples to delineate geochemical anomalies or baselines and to reveal the relative variations in elemental concentrations in a study area. The resolution of the subsequent maps obtained by sampling greatly depends on sampling density. While a large number of samples may generate redundant data, a small number of samples smooth out the patterns and may completely miss anomalies. This review provides a platform for applied geochemists who desire to design a sampling scheme for a regional geochemical program and do not have the financial resources to perform an orientation survey, which will give them the necessary information for designing, according to project objectives, a cost-effective regional geochemical survey for their study area. It is advisable to integrate during the desktop study all available information, such as geological, structural, geophysical, remote sensing data and topographical data by using different data fusion algorithms to arrive at a sampling density fit-for-purpose of the target area. This in turn facilitates an effective spatial positioning of sample locations. Quantitative analyses of the efficiency of different sampling densities for delineating geochemical patterns have not been well documented, warranting more attention and research.

58 GEOSCIENCES↗
DOE OSTI2017

Evolutionary Optimization of a Charge Transfer Ionic Potential Model for Ta/Ta-Oxide Heterointerfaces

Heterostructures of tantalum and its oxide are of tremendous technological interest for a myriad of technological applications, including electronics, thermal management, catalysis and biochemistry. In particular, local oxygen stoichiometry variation in TaO x memristors comprising of thermodynamically stable metallic (Ta) and insulating oxide (Ta 2 O 5 ) have been shown to result in fast switching on the subnanosecond timescale over a billion cycles. This rapid switching opens up the potential for advanced functional platforms such as stateful logic operations and neuromorphic computation. Despite its broad importance, an atomistic scale understanding of oxygen stoichiometry variation across Ta/TaO x heterointerfaces, such as during early stages of oxidation and oxide growth, is not well understood. This is mainly due to the lack of a unified interatomic potential model for tantalum oxides that can accurately describe metallic (Ta), ionic (TaO x ) as well as mixed (Ta/TaO x interfaces) bonding environments simultaneously. To address this challenge, we introduce a Charge Transfer Ionic Potential (CTIP) model for Ta/Ta-oxide system by training against lattice parameters, cohesive energies, equations of state (EOS), elastic properties, and surface energies of the various experimentally observed Ta 2 O 5 polymorphs (hexagonal, orthorhombic and monoclinic) obtained from density functional theory (DFT) calculations. The best CTIP parameters are determined by employing a global optimization scheme driven by genetic algorithms followed by local Simplex optimization. Our newly developed CTIP potential accurately predicts structure, thermodynamics, energetic ordering of polymorphs, as well as elastic and surface properties of both Ta and Ta 2 O 5 , in excellent agreement with DFT calculations and experiments. We employ our newly parameterized CTIP potential to investigate the early stages of oxidation and atomic scale mechanisms associated with oxide growth on Ta surface at various temperatures. Furthermore, the CTIP potential developed in this work is an invaluable tool to investigate atomic-scale mechanisms and transport phenomena underlying the response of Ta/TaO x interfaces to external stimuli (e.g, temperature, pressure, strain, electric field etc.), as well as other interesting dynamical phenomena including the physics of switching dynamics in TaO x based memristors and neuromorphic devices.

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

Prediction of Structures and Atomization Energies of Small Silver Clusters, (Ag) n , n < 100

Neutral silver clusters, Ag n , were studied using density functional theory (DFT) followed by high level coupled cluster CCSD(T) calculations to determine the low energy isomers for each cluster size for small clusters. The normalized atomization energy, heats of formation, and average bond lengths were calculated for each of the different isomeric forms of the silver clusters. For n = 2–6, the preferred geometry is planar, and the larger n = 7–8 clusters prefer higher symmetry, three-dimensional geometries. The low spin state is predicted to be the ground state for every cluster size. A number of new low energy isomers for the heptamer and octamer were found. Additional larger Ag n structures, n < 100, were initially optimized using a tree growth-hybrid genetic algorithm with an embedded atom method (EAM) potential. Finally, for n ≤ 20, DFT was used to optimize the geometries. DFT with benchmarked functionals were used to predict that the normalized atomization energies ((AE)s) for Ag n start to converge slowly to the bulk at n = 55. The (AE) for Ag 99 is predicted to be ~50 kcal/mol.

Environmental Molecular Sciences Laboratory↗
DOE OSTI2025

Generative AI for design of nanoporous materials: review and future prospects

Generative artificial intelligence (AI) is emerging as a powerful tool for advancing the design of nanoporous materials such as metal–organic frameworks, covalent–organic frameworks, and zeolites. These materials have potential application in important areas such as carbon capture, catalysis, gas storage, chemical separation, and drug delivery due to their modular, tunable structures, and their performance in these areas depends on precise control over their structure, chemical functionalities, and properties. Herein, we provide a review of generative AI algorithms that are emerging as powerful tools for the design of nanoporous materials, namely generative adversarial networks, variational autoencoders, diffusion models, genetic algorithms, reinforcement learning, and large language models. Some models are particularly good at generating diverse and high-quality designs, while others excel at exploring large design spaces or optimizing materials with desired properties. Certain algorithms also allow for efficient transitions between different designs, and some offer versatility in generating materials based on textual input. We discuss the advantages, limitations, and applications of these algorithms in porous material design and emphasize the future potential of integrating AI with experimental workflows to accelerate the development and validation of AI-generated materials.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Acoustic emission signal processing technique to characterize reactor in-pile phenomena

Existing and developing advanced sensor technologies and instrumentation will allow non-intrusive in-pile measurement of temperature, extension, and fission gases when coupled with advanced signal processing algorithms. The transmitted measured sensor signals from inside to the outside of containment structure are corrupted by noise and are attenuated, thereby reducing the signal strength and the signal-to-noise ratio. Identification and extraction of actual signal (representative of an in-pile phenomenon) is a challenging and complicated process. In the paper, empirical mode decomposition technique is utilized to reconstruct actual sensor signal by partially combining intrinsic mode functions. Reconstructed signal will correspond to phenomena and/or failure modes occurring inside the reactor. In addition, it allows accurate non-intrusive monitoring and trending of in-pile phenomena.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures

Here, we investigate how to port the standard interior-point method to new exascale architectures for block-structured nonlinear programs with state equations. Computationally, we decompose the interior-point algorithm into two successive operations: the evaluation of the derivatives and the solution of the associated Karush-Kuhn-Tucker (KKT) linear system. Our method accelerates both operations using two levels of parallelism. First, we distribute the computations on multiple processes using coarse parallelism. Second, each process uses SIMD/GPU accelerators locally to accelerate the operations using fine-grained parallelism. The KKT system is reduced by eliminating the inequalities and the state variables from the corresponding equations. We demonstrate our method's capability on the supercomputer Polaris, a testbed for the future exascale Aurora system. Each node is equipped with four GPUs, a setup amenable to our two-level approach. Our experiments on the stochastic optimal power flow problem show that the reduction method is 50x faster than the sparse linear solver HSL MA57 running in serial on the CPU, and 6x faster than Pardiso running in parallel on CPU on the same number of processes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

FAST $\mathrm{G}$ AP $\mathrm{F}$ ILL : efficient gap filling in metabolic networks

Genome-scale metabolic reconstructions summarize current knowledge about a target organism in a structured manner and as such highlight missing information. Such gaps can be filled algorithmically. Scalability limitations of available algorithms for gap filling hinder their application to compartmentalized reconstructions. We present fastGapFill, a computationally efficient tractable extension to the COBRA toolbox that permits the identification of candidate missing knowledge from a universal biochemical reaction database (e.g. Kyoto Encyclopedia of Genes and Genomes) for a given (compartmentalized) metabolic reconstruction. The stoichiometric consistency of the universal reaction database and of the metabolic reconstruction can be tested for permitting the computation of biologically more relevant solutions. We demonstrate the efficiency and scalability of fastGapFill on a range of metabolic reconstructions.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

GLAD-M35: a joint P and S global tomographic model with uncertainty quantification

We present our third and final generation joint P and S global adjoint tomography (GLAD) model, GLAD-M35, and quantify its uncertainty based on a low-rank approximation of the inverse Hessian. Starting from our second-generation model, GLAD-M25, we added 680 new earthquakes to the database for a total of 2160 events. New P-wave categories are included to compensate for the imbalance between P- and S-wave measurements, and we enhanced the window selection algorithm to include more major-arc phases, providing better constraints on the structure of the deep mantle and more than doubling the number of measurement windows to 40 million. Two stages of a Broyden–Fletcher–Goldfarb–Shanno (BFGS) quasi-Newton inversion were performed, each comprising five iterations. With this BFGS update history, we determine the model’s standard deviation and resolution length through randomized singular value decomposition.

58 GEOSCIENCES↗
DOE OSTI2017

Accurate force field for molybdenum by machine learning large materials data

In this work, we present a highly accurate spectral neighbor analysis potential (SNAP) model for molybdenum (Mo) developed through the rigorous application of machine learning techniques on large materials data sets. Despite Mo's importance as a structural metal, existing force fields for Mo based on the embedded atom and modified embedded atom methods still do not provide satisfactory accuracy on many properties. We will show that by fitting to the energies, forces and stress tensors of a large density functional theory (DFT)-computed dataset on a diverse set of Mo structures, a Mo SNAP model can be developed that achieves close to DFT accuracy in the prediction of a broad range of properties, including energies, forces, stresses, elastic constants, melting point, phonon spectra, surface energies, grain boundary energies, etc. We will outline a systematic model development process, which includes a rigorous approach to structural selection based on principal component analysis, as well as a differential evolution algorithm for optimizing the hyperparameters in the model fitting so that both the model error and the property prediction error can be simultaneously lowered. We expect that this newly developed Mo SNAP model will find broad applications in large-scale, long-time scale simulations.

36 MATERIALS SCIENCE↗
DOE OSTI2017

TGE: Machine Learning Based Task Graph Embedding for Large-Scale Topology Mapping

Task mapping is an important problem in parallel and distributed computing. The goal in task mapping is to find an optimal layout of the processes of an application (or a task) onto a given network topology. We target this problem in the context of staging applications. A staging application consists of two or more parallel applications (also referred to as staging tasks) which run concurrently and exchange data over the course of computation. Task mapping becomes a more challenging problem in staging applications, because not only data is exchanged between the staging tasks, but also the processes of a staging task may exchange data with each other. We propose a novel method, called Task Graph Embedding (TGE), that harnesses the observable graph structures of parallel applications and network topologies. TGE employs a machine learning based algorithm to find the best representation of a graph, called an embedding, onto a space in which the task-to-processor mapping problem can be solved. We evaluate and demonstrate the effectiveness of TGE experimentally with the communication patterns extracted from runs of XGC, a large-scale fusion simulation code, on Titan.

Choi, Jong Youl↗
DOE OSTI2020

Computationally Efficient Decompositions of Oblique Projection Matrices

Oblique projection matrices arise in problems in weighted least squares, signal processing, and optimization. While these matrices can be potentially very large, their low-rank structure can be exploited for efficient computation. Here, we propose fast and scalable algorithms for computing their eigendecomposition and singular value decomposition (SVD). Numerical experiments that compare our proposed approaches to existing methods, including randomized SVD, are presented. In addition, we test their accuracy on linear systems from equality constrained optimization problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Butterfly Counting in Bipartite Networks

We consider the problem of counting motifs in bipartite affiliation networks, such as author-paper, user-product, and actor-movie relations. We focus on counting the number of occurrences of a "butterfly", a complete 2x2 biclique, the simplest cohesive higher-order structure in a bipartite graph. Our main contribution is a suite of randomized algorithms that can quickly approximate the number of butterflies in a graph with a provable guarantee on accuracy. An experimental evaluation on large real-world networks shows that our algorithms return accurate estimates within a few seconds, even for networks with trillions of butterflies and hundreds of millions of edges.

Sanei-Mehri, Seyed-Vahid↗