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,153 records · Page 64
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Modeling of fracture of protective concrete structures under impact loads

This paper presents results of numerical simulation of interaction between a Boeing 747-400 aircraft and the protective shell of a nuclear power plant. The shell is presented as a complex multilayered cellular structure consisting of layers of concrete and fiber concrete bonded with steel trusses. Numerical simulation was performed three-dimensionally using the original algorithm and software taking into account algorithms for building grids of complex geometric objects and parallel computations. Dynamics of the stress-strain state and fracture of the structure were studied. Destruction is described using a two-stage model that allows taking into account anisotropy of elastic and strength properties of concrete and fiber concrete. It is shown that wave processes initiate destruction of the cellular shell structure; cells start to destruct in an unloading wave originating after the compression wave arrival at free cell surfaces.

36 MATERIALS SCIENCE↗
DOE OSTI2020

The potential of quantum annealing for rapid solution structure identification

Abstract The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations of unquestionable performance gains leveraging novel hardware platforms have faced significant obstacles. One key challenge is understanding the algorithmic properties that distinguish such devices from established optimization approaches. Through the careful design of contrived optimization tasks, this work provides new insights into the computation properties of quantum annealing and suggests that this model has the potential to quickly identify the structure of high-quality solutions. A meticulous comparison to a variety of algorithms spanning both complete and local search suggests that quantum annealing’s performance on the proposed optimization tasks is distinct. This result provides new insights into the time scales and types of optimization problems where quantum annealing has the potential to provide notable performance gains over established optimization algorithms and suggests the development of hybrid algorithms that combine the best features of quantum annealing and state-of-the-art classical approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Quantum Fourier transform revisited

Summary The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐ d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.

Camps, Daan↗
DOE OSTI2020

TurboRVB: A many-body toolkit for ab initio electronic simulations by quantum Monte Carlo

TurboRVB is a computational package for ab initio Quantum Monte Carlo (QMC) simulations of both molecular and bulk electronic systems. The code implements two types of well established QMC algorithms: Variational Monte Carlo (VMC) and diffusion Monte Carlo in its robust and efficient lattice regularized variant. A key feature of the code is the possibility of using strongly correlated many-body wave functions (WFs), capable of describing several materials with very high accuracy, even when standard mean-field approaches [e.g., density functional theory (DFT)] fail. The electronic WF is obtained by applying a Jastrow factor, which takes into account dynamical correlations, to the most general mean-field ground state, written either as an antisymmetrized geminal power with spin-singlet pairing or as a Pfaffian, including both singlet and triplet correlations. This WF can be viewed as an efficient implementation of the so-called resonating valence bond (RVB) Ansatz, first proposed by Pauling and Anderson in quantum chemistry [L. Pauling, The Nature of the Chemical Bond (Cornell University Press, 1960)] and condensed matter physics [P.W. Anderson, Mat. Res. Bull 8, 153 (1973)], respectively. The RVB Ansatz implemented in TurboRVB has a large variational freedom, including the Jastrow correlated Slater determinant as its simplest, but nontrivial case. Moreover, it has the remarkable advantage of remaining with an affordable computational cost, proportional to the one spent for the evaluation of a single Slater determinant. Therefore, its application to large systems is computationally feasible. The WF is expanded in a localized basis set. Several basis set functions are implemented, such as Gaussian, Slater, and mixed types, with no restriction on the choice of their contraction. The code implements the adjoint algorithmic differentiation that enables a very efficient evaluation of energy derivatives, comprising the ionic forces. Thus, one can perform structural optimizations and molecular dynamics in the canonical NVT ensemble at the VMC level. For the electronic part, a full WF optimization (Jastrow and antisymmetric parts together) is made possible, thanks to state-of-the-art stochastic algorithms for energy minimization. In the optimization procedure, the first guess can be obtained at the mean-field level by a built-in DFT driver. The code was efficiently parallelized by using a hybrid MPI-OpenMP protocol, which is also an ideal environment for exploiting the computational power of modern Graphics Processing Unit accelerators.

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

AGS-GNN: Attribute-guided Sampling for Graph Neural Networks

We propose AGS-GNN, a novel attribute-guided sampling algorithm for Graph Neural Networks (GNNs) that exploits node features and connectivity structure of a graph while simultaneously adapting for both homophily and heterophily in graphs. (In homophilic graphs vertices of the same class are more likely to be connected, and vertices of different classes tend to be linked in heterophilic graphs.) While GNNs have been successfully applied to homophilic graphs, their application to heterophilic graphs remains challenging. The best-performing GNNs for heterophilic graphs do not fit the sampling paradigm, suffer high computational costs, and are not inductive. We employ samplers based on feature-similarity and feature-diversity to select subsets of neighbors for a node, and adaptively capture information from homophilic and heterophilic neighborhoods using dual channels. Currently, AGS-GNN is the only algorithm that we know of that explicitly controls homophily in the sampled subgraph through similar and diverse neighborhood samples. For diverse neighborhood sampling, we employ submodularity, which was not used in this context prior to our work. The sampling distribution is pre-computed and highly parallel, achieving the desired scalability. Using an extensive dataset consisting of 35 small (<=100K nodes) and large (>100K nodes) homophilic and heterophilic graphs, we demonstrate the superiority of AGS-GNN compare to the current approaches in the literature. AGS-GNN achieves comparable test accuracy to the best-performing heterophilic GNNs, even outperforming methods using the entire graph for node classification. AGS-GNN also converges faster compared to methods that sample neighborhoods randomly, and can be incorporated into existing GNN models that employ node or graph sampling.

artificial intelligence↗
DOE OSTI2023

Optimizing Fast Charging and Wetting in Lithium-Ion Batteries with Optimal Microstructure Patterns Identified by Genetic Algorithm

To sustain the high-rate current required for fast charging electric vehicle batteries, electrodes must exhibit sufficiently high effective ionic diffusion. Additionally, to reduce battery manufacturing costs, wetting time must decrease. Both of these issues can be addressed by structuring the electrodes with mesoscale pore channels. However, their optimal spatial distribution, or patterns, is unknown. Herein, a genetic algorithm has been developed to identify these optimal patterns using a CPU-cheap proxy distance-based model to evaluate the impact of the added pore networks. Both coin-cell and pouch cell form factors have been considered for the wetting analysis, with their respective electrolyte infiltration mode. Regular hexagonal and mud-crack-like patterns, respectively, for fast charging and fast wetting were found to be optimal and have been compared with pre-determined, easier to manufacture, patterns. The model predicts that using cylindrical channels arranged in a regular hexagonal pattern is ∼6.25 times more efficient for fast charging as compared to grooved lines with both structuring strategies being restricted to a 5% electrode total volume loss. The model also shows that only a very limited electrode volume loss (1%–2%) is required to dramatically improve the wetting (5–20 times) compared to an unstructured electrode.

25 ENERGY STORAGE↗
DOE OSTI2014

SU-E-J-238: Monitoring Lymph Node Volumes During Radiotherapy Using Semi-Automatic Segmentation of MRI Images

Purpose: Identification and image-based monitoring of lymph nodes growing due to disease, could be an attractive alternative to prophylactic head and neck irradiation. We evaluated the accuracy of the user-interactive Grow Cut algorithm for volumetric segmentation of radiotherapy relevant lymph nodes from MRI taken weekly during radiotherapy. Method: The algorithm employs user drawn strokes in the image to volumetrically segment multiple structures of interest. We used a 3D T2-wturbo spin echo images with an isotropic resolution of 1 mm3 and FOV of 492×492×300 mm3 of head and neck cancer patients who underwent weekly MR imaging during the course of radiotherapy. Various lymph node (LN) levels (N2, N3, N4'5) were individually contoured on the weekly MR images by an expert physician and used as ground truth in our study. The segmentation results were compared with the physician drawn lymph nodes based on DICE similarity score. Results: Three head and neck patients with 6 weekly MR images were evaluated. Two patients had level 2 LN drawn and one patient had level N2, N3 and N4'5 drawn on each MR image. The algorithm took an average of a minute to segment the entire volume (512×512×300 mm3). The algorithm achieved an overall DICE similarity score of 0.78. The time taken for initializing and obtaining the volumetric mask was about 5 mins for cases with only N2 LN and about 15 mins for the case with N2,N3 and N4'5 level nodes. The longer initialization time for the latter case was due to the need for accurate user inputs to separate overlapping portions of the different LN. The standard deviation in segmentation accuracy at different time points was utmost 0.05. Conclusions: Our initial evaluation of the grow cut segmentation shows reasonably accurate and consistent volumetric segmentations of LN with minimal user effort and time.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Energy–Geometry Dependency of Molecular Structures: A Multistep Machine Learning Approach

There is growing interest in estimating quantum observables while circumventing expensive computational overhead for facile in silico materials screening. Machine learning (ML) methods are implemented to perform such calculations in shorter times. In this paper, we introduce a multistep method based on machine learning algorithms to estimate total energy on the basis of spatial coordinates and charges for various chemical structures, including organic molecules, inorganic molecules, and ions. This method quickly calculates total energy with 0.76 au in root-mean-square error (RMSE) and 1.5% in mean absolute percent error (MAPE) when tested on a database of optimized and unoptimized structures. Using similar molecular representations, experimental thermochemical properties were estimated, with MAPE as low as 6% and RMSE of 8 cal/mol·K for heat capacity in a 10-fold cross-validation.

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

WSBP/NWBP small-world neural network and its performance for wind power forecasting

A small-world neural network has stronger generalization ability with high transfer efficiency than that of the regular neural networks. This paper presents two novel small-world neural networks, the Watts-Strogatz small-world based on a BP neural network (WSBP) and a Newman-Watts small-world neural network based on a BP neural network (NWBP), related to previous research of complex networks. The algorithms are developed separately by adopting WS and NW small-world networks as their topological structures, and their derivation and convergence criterion are progressively discussed. After that, the proposed models are subsequently tested by two typical nonlinear functions which confirm their significant improvement over the regular BP networks and other algorithms. Finally, a wind power prediction system is advanced to verify their generalization abilities, and show that the models are practically feasible and effective with improved accuracy and acceptable forecasting errors caused by wind fluctuation and randomness with a time scale up to 24 h.

17 WIND ENERGY↗
DOE OSTI2021

Parallel projection—An improved return mapping algorithm for finite element modeling of shape memory alloys

Here, we present a novel finite element analysis of inelastic structures containing Shape Memory Alloys (SMAs). Phenomenological constitutive models for SMAs lead to material nonlinearities, that require substantial computational effort to resolve. Finite element analysis methods, which rely on Gauss quadrature integration schemes, must solve two sets of coupled differential equations: one at the global level and the other at the local, i.e. Gauss point level. In contrast to the conventional return mapping algorithm, which solves these two sets of coupled differential equations separately using a nested Newton procedure, we propose a scheme to solve the local and global differential equations simultaneously. In the process we also derive closed-form expressions used to update the internal/constitutive state variables, and unify the popular closest-point and cutting plane methods with our formulas. Numerical testing indicates that our method allows for larger thermomechanical loading steps and provides increased computational efficiency, over the standard return mapping algorithm.

42 ENGINEERING↗
DOE OSTI2024

R-Adaptivity to Enable Compression of Elementary Computations in Extreme-Scale Finite Element Simulators

Modern computing systems are capable of exascale calculations, which are revolutionizing the development and application of high-fidelity numerical models in computational science and engineering. While these systems continue to grow in processing power, the available system memory has not increased commensurately, and electrical power consumption continues to grow. A predominant approach to limit the memory usage in large-scale applications is to exploit the abundant processing power and continually recompute many low-level simulation quantities, rather than storing them. However, this approach can adversely impact the throughput of the simulation and diminish the benefits of modern computing architectures. We present three novel contributions to reduce the memory burden while maintaining, and sometimes improving, performance in simulations based on finite element discretizations. The first contribution develops dictionary-based data compression schemes that detect and exploit the structure of the discretization, due to redundancies across the finite element mesh. While these schemes are shown to reduce memory requirements by more than 99% on meshes with large numbers of identical mesh cells, there are applications where this structure does not exist. The second contribution leverages a recently developed augmented Lagrangian optimization algorithm to enable r-adaptivity for meshes with the goal of enhancing the redundancies in the mesh. The third contribution extends these methods to patch-based linear solvers and preconditioners by compressing local matrices. Numerical results demonstrate the effectiveness of the proposed methods to detect, enhance and exploit mesh structure on a suite of examples inspired by large-scale applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

A Bridge for Accelerating Materials by Design

Recent technical advances in the area of nanoscale imaging, spectroscopy, and scattering/diffraction have led to unprecedented capabilities for investigating materials structural, dynamical and functional characteristics. In addition, recent advances in computational algorithms and computer capacities that are orders of magnitude larger/faster have enabled large-scale simulations of materials properties starting with nothing but the identity of the atomic species and the basic principles of quantum- and statistical-mechanics and thermodynamics. Along with these advances, an explosion of high-resolution data has emerged. This confluence of capabilities and rise of big data offer grand opportunities for advancing materials sciences but also introduce several challenges. In this editorial we identify challenges impeding progress towards advancing materials by design (e.g., the design/discovery of materials with improved properties/performance), possible solutions, and provide examples of scientific issues that can be addressed by using a tightly integrated approach where theory and experiments are linked through big-deep data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Optimization of relativistic backward wave oscillator with non-uniform slow wave structure and a resonant reflector

This letter optimizes synchronously 18 parameters of a relativistic backward wave oscillator with non-uniform slow wave structure (SWS) and a resonant reflector by using the parallel genetic algorithms and particle-in-cell simulation. The optimization results show that the generation efficiency of microwave from the electron beam has increased 32% compared to that of the original device. After optimization, the electromagnetic mode propagating in the resonant changes from the original TM{sub 020} mode of reflector to higher-order TM{sub 021} mode, which has a high reflection coefficient in a broader frequency range than that of the former. The modulation of current inside the optimized device is much deeper than that in the original one. The product of the electric field and current is defined. Observing this product, it is found that the interaction of the electron beam with the electromagnetic wave in the optimized device is much stronger than that in the original device, and at the rear part of SWS of the optimized device, the electron beam dominantly gives out the energy to the electromagnetic wave, leading to the higher generation efficiency of microwave than that of the original device.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2018

Genarris: Random generation of molecular crystal structures and fast screening with a Harris approximation

Herein, we present Genarris, a Python package that performs configuration space screening for molecular crystals of rigid molecules by random sampling with physical constraints. For fast energy evaluations, Genarris employs a Harris approximation, whereby the total density of a molecular crystal is constructed via superposition of single molecule densities. Dispersion-inclusive density functional theory is then used for the Harris density without performing a self-consistency cycle. Genarris uses machine learning for clustering, based on a relative coordinate descriptor developed specifically for molecular crystals, which is shown to be robust in identifying packing motif similarity. In addition to random structure generation, Genarris offers three workflows based on different sequences of successive clustering and selection steps: the "Rigorous" workflow is an exhaustive exploration of the potential energy landscape, the "Energy" workflow produces a set of low energy structures, and the "Diverse" workflow produces a maximally diverse set of structures. The latter is recommended for generating initial populations for genetic algorithms. Here, the implementation of Genarris is reported and its application is demonstrated for three test cases. Published by AIP Publishing.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

Inversion of coherent surface scattering images via deep learning network

Coherent surface scattering imaging is a powerful tool for imaging a surface/interface of a thin nanostructure deposited on an opaque substrate. A mathematical conversion of an object image from a scattering pattern is essential for coherent surface scattering imaging to visualize structures of specimens. It has been achieved by using phase retrieval algorithms requiring oversampling in scattering patterns and employing alternating projection approaches. It is a computationally challenging and time-consuming process. In this paper, we demonstrate CSSI-NN, which is a deep learning neural network model to predict images of objects from scattering intensities in coherent surface scattering imaging. This model allowing for the instant outcome from scattering patterns would be tremendously beneficial not only for effective experiments but also for data analysis of phase retrieval.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Broadband mid-IR difference-frequency generation in 5 mol % MgO-doped periodically and aperiodically poled lithium niobate

We have theoretically investigated broadband mid-infrared (mid-IR) difference-frequency generation (DFG) in 5 mol % MgO-doped periodically poled lithium niobate (5 mol % MgO : PPLN) based on quasi-phase-matching (QPM) with group-velocity matching (GVM) between the pump and the idler for the eee interaction of QPM. The acceptance bandwidths are 282.3 nm and 35.4 nm around 3.4 μm with the signal and pump wavelengths fixed at 1.550 μm and 1.064 μm, and the required QPM periods are 30.26 μm and 30.25 μm, respectively. A method which can broaden the flattop QPM DFG acceptance bandwidth (ABW) around the GVM wavelength for the idler wavelength in 5 mol % MgO-doped aperiodically poled lithium niobate (5 mol % MgO : APPLN) is proposed. The structure of 5 mol % MgO : APPLN is optimised using a genetic algorithm by adjusting its parameters. The simulation results show that under the GVM conditions, the maximum ABW for the idler is 1045.9 nm and 96.6 nm at a fixed signal wavelength of 1.550 μm and at a fixed pump wavelength of 1.064 μm, respectively. The tradeoff between the reduced effective nonlinear coefficient and DFG ABW is discussed. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Understanding the nature of mean-field semiclassical light-matter dynamics: An investigation of energy transfer, electron-electron correlations, external driving, and long-time detailed balance

Semiclassical electrodynamics (with quantum matter plus classical electrodynamics fields) is an appealing approach for studying light-matter interactions, especially for realistic molecular systems. However, there is no unique semiclassical scheme. On the one hand, intermolecular interactions can be described instantaneously by static two-body interactions connecting two different molecules, while a classical transverse E field acts as a spectator at short distance; we will call this Hamiltonian no. I. On the other hand, intermolecular interactions can also be described as effects that are mediated exclusively through a classical one-body Ε field without any quantum effects at all (assuming we ignore electronic exchange); we will call this Hamiltonian no. II. Moreover, one can also mix these two different Hamiltonians into a third, hybrid Hamiltonian, which preserves quantum electron-electron correlations for lower excitations but describes higher excitations in a mean-field way. To investigate which semiclassical scheme is most reliable for practical use, here we study the real-time dynamics of a minimalistic many-site model—a pair of identical two-level systems (TLSs)—undergoing either resonance energy transfer (RET) or collectively driven dynamics. While both approaches (no. 1 and no. 2) perform reasonably well when there is no strong external excitation, we find that no single approach is perfect for all conditions (and all methods fail when a strong external field is applied). Each method has its own distinct problems: Hamiltonian no. I performs best for RET but behaves in a complicated manner for driven dynamics; Hamiltonian no. II is always stable, but obviously fails for RET at short distances. One key finding is that, for externally driven dynamics, a full configuration-interaction description of Hamiltonian no. I strongly overestimates the long-time electronic energy, highlighting the not obvious fact that, if one plans to merge quantum molecules with classical light, a full, exact treatment of electron-electron correlations can actually lead to worse results than a simple mean-field electronic structure treatment. Future work will need to investigate (i) how these algorithms behave in the context of more than a pair of TLSs and (ii) whether or not these algorithms can be improved in general by including crucial aspects of spontaneous emission.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗