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,387 records · Page 77
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Model Predictive Control of Discrete-Continuous Energy Systems via Generalized Disjunctive Programming

Generalized Disjunctive Programming (GDP) provides an alternative framework to model optimization problems with both discrete and continuous variables. The key idea behind GDP involves the use of logical disjunctions to represent discrete decisions in the continuous space, and logical propositions to denote algebraic constraints in the discrete space. Compared to traditional mixed-integer programming (MIP), the inherent logic structure in GDP yields tighter relaxations that are exploited by global branch and bound algorithms to improve solution quality. In this paper, we present a general GDP model for optimal control of hybrid systems that exhibit both discrete and continuous dynamics. Specifically, we use GDP to formulate a model predictive control (MPC) model for piecewise-affine systems with implicit switching logic. As an example, the GDP-based MPC approach is used as a supervisory control to improve energy efficiency in residential buildings with binary on/off, relay-based thermostats. A simulation study is used to demonstrate the validity of the proposed approach, and the improved solution quality compared to existing MIPbased control approaches.

Bhattacharya, Arnab↗
DOE OSTI2013

Fast plane wave density functional theory molecular dynamics calculations on multi-GPU machines

Plane wave pseudopotential (PWP) density functional theory (DFT) calculation is the most widely used method for material simulations, but its absolute speed stagnated due to the inability to use large scale CPU based computers. By a drastic redesign of the algorithm, and moving all the major computation parts into GPU, we have reached a speed of 12 s per molecular dynamics (MD) step for a 512 atom system using 256 GPU cards. This is about 20 times faster than the CPU version of the code regardless of the number of CPU cores used. Our tests and analysis on different GPU platforms and configurations shed lights on the optimal GPU deployments for PWP-DFT calculations. An 1800 step MD simulation is used to study the liquid phase properties of GaInP.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Progressive growth of the solid–electrolyte interphase towards the Si anode interior causes capacity fading

The solid–electrolyte interphase (SEI), a layer formed on the electrode surface, is essential for electrochemical reactions in batteries and critically governs the battery stability. Active materials, especially those with extremely high energy density, such as silicon (Si), often inevitably undergo a large volume swing upon ion insertion and extraction, raising a critical question as to how the SEI interactively responds to and evolves with the material and consequently controls the cycling stability of the battery. Here, by integrating sensitive elemental tomography, an advanced algorithm and cryogenic scanning transmission electron microscopy, we unveil, in three dimensions, a correlated structural and chemical evolution of Si and SEI. Furthermore, corroborated with a chemomechanical model, we demonstrate progressive electrolyte permeation and SEI growth along the percolation channel of the nanovoids due to vacancy injection and condensation during the delithiation process. Consequently, the Si–SEI spatial configuration evolves from the classic ‘core–shell’ structure in the first few cycles to a ‘plum-pudding’ structure following extended cycling, featuring the engulfing of Si domains by the SEI, which leads to the disruption of electron conduction pathways and formation of dead Si, contributing to capacity loss. The spatially coupled interactive evolution model of SEI and active materials, in principle, applies to a broad class of high-capacity electrode materials, leading to a critical insight for remedying the fading of high-capacity electrodes.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Machine learning with bond information for local structure optimizations in surface science

Local optimization of adsorption systems inherently involves different scales: within the substrate, within the molecule, and between the molecule and the substrate. In this work, we show how the explicit modeling of different characteristics of the bonds in these systems improves the performance of machine learning methods for optimization. Furthermore, we introduce an anisotropic kernel in the Gaussian process regression framework that guides the search for the local minimum, and we show its overall good performance across different types of atomic systems. The method shows a speed-up of up to a factor of two compared with the fastest standard optimization methods on adsorption systems. Additionally, we show that a limited memory approach is not only beneficial in terms of overall computational resources but can also result in a further reduction of energy and force calculations.

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

Quantifying particle-scale 3D granular dynamics during rapid compaction from time-resolved in situ 2D x-ray images

Understanding the particle-scale dynamics of granular materials during rapid compaction and flow is of fundamental importance for manufacturing, planetary science, geology, and defense applications. Time-resolved 2D radiography and static 3D x-ray tomography are powerful in situ tools for studying particle-scale dynamics but provide detail only in 2D or with significant time-scale limitations, respectively. Here, we introduce a new method that uses 2D in situ x-ray imaging for determining time-resolved 3D particle-scale dynamics in rapidly compressed granular materials. The method employs initial particle packing structures obtained from x-ray tomography, a 2D x-ray image generation algorithm, and an optimization algorithm. We first describe and validate the method using finite element simulations. Furthermore, we then apply the technique to x-ray phase-contrast images obtained during rapid compaction of granular materials with varying particle morphology and sample thickness. The depth-resolved particle-scale dynamics reveal complex velocity and porosity fields evolving heterogeneously along and perpendicular to the compaction direction. We characterize these features, their fluctuations near the compaction front, and the compaction front thickness. Our technique can be applied to understanding granular dynamics during rapid compaction events, and rearrangements during slower, but non-quasi-static, flows.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Probing polarization dynamics at specific domain configurations: Computer-vision based automated experiment in piezoresponse force microscopy

Topological defects in ferroelectric materials have attracted much attention due to the emergence of conductive, ferroic, and magnetic functionalities. However, many topological configurations dynamically evolve during the switching processes, making them a challenge to characterize via traditional techniques. Here, we implement an automated experimentation approach for the exploration of functional properties in BiFeO 3 thin films. Specifically, we visualize the ferroelectric domain structures via single frequency piezoresponse force microscopy and implement a computer vision-based algorithm to discover features of interest at which spectroscopic measurements are taken. Subsequently, we employ dimensionality reduction techniques to reveal characteristic polarization behaviors at these features. This approach can be extended to other spectroscopies and modalities to probe only specific features of interest, ultimately enabling dynamical processes in ferroelectrics to be studied.

36 MATERIALS SCIENCE↗
DOE OSTI2013

Generation of arbitrarily non-Gaussian fields with a set correlation structure

Non-Gaussianity in the cosmic microwave background and the large-scale structure of galaxies provides an increasingly powerful probe of the universe. I implement an algorithm to generate realisations of fields that possess an arbitrary probability distribution function and an arbitrary power spectrum and demonstrate the code with a number of examples, including the uniform distribution, the Laplace distribution, the χ and χ{sup 2} distributions, Rayleigh and Maxwell-Boltzmann distributions. The code is available at http://sourceforge.net/projects/nongaussian.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Low-energy physics of isotropic spin-1 chains in the critical and Haldane phases

Using a matrix product state algorithm with infinite boundary conditions, we compute high-resolution dynamic spin and quadrupolar structure factors in the thermodynamic limit to explore the low-energy excitations of isotropic bilinear-biquadratic spin-1 chains. Haldane mapped the spin-1 Heisenberg antiferromagnet to a continuum field theory, the nonlinear sigma model (NLσM). In this work, we find that the NLσM fails to capture the influence of the biquadratic term and provides only an unsatisfactory description of the Haldane phase physics. But several features in the Haldane phase can be explained by noninteracting multimagnon states. The physics at the Uimin-Lai-Sutherland point is characterized by multisoliton continua. Moving into the extended critical phase, we find that these excitation continua contract, which we explain using a field-theoretic description. New excitations emerge at higher energies and, in the vicinity of the purely biquadratic point, they show simple cosine dispersions. Using block fidelities, we identify them as elementary one-particle excitations and relate them to the integrable Temperley-Lieb chain.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2026

Clifford transformations for fermionic quantum systems: From Pauli and Majorana operators to Dirac fermions

Clifford gates and transformations, which map products of elementary Pauli or Majorana operators to other such products, are foundational in quantum computing, underpinning the stabilizer formalism, error-correcting codes, magic state distillation, quantum communication and cryptography, and qubit tapering. Moreover, circuits composed entirely of Clifford gates are classically simulatable, highlighting their computational significance. In this article we extend the concept of Clifford transformations to Dirac fermions. We demonstrate that discrete Clifford transformations are generated by half-body and pair operators while continuous Clifford transformations are generated by number operators, providing a systematic framework for their characterization. Additionally, we establish connections with fermionic mean-field theories and applications in qubit tapering, offering insights into their broader implications in quantum computing.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2017

ζ-Glycine: insight into the mechanism of a polymorphic phase transition

Glycine is the simplest and most polymorphic amino acid, with five phases having been structurally characterized at atmospheric or high pressure. A sixth form, the elusive ζ phase, was discovered over a decade ago as a short-lived intermediate which formed as the high-pressure ϵ phase transformed to the γ form on decompression. However, its structure has remained unsolved. We now report the structure of the ζ phase, which was trapped at 100 K enabling neutron powder diffraction data to be obtained. The structure was solved using the results of a crystal structure prediction procedure based on fully ab initio energy calculations combined with a genetic algorithm for searching phase space. We show that the fate of ζ-glycine depends on its thermal history: although at room temperature it transforms back to the γ phase, warming the sample from 100 K to room temperature yielded β-glycine, the least stable of the known ambient-pressure polymorphs.

36 MATERIALS SCIENCE↗
DOE OSTI2016

Can I solve my structure by SAD phasing? Planning an experiment, scaling data and evaluating the useful anomalous correlation and anomalous signal

A key challenge in the SAD phasing method is solving a structure when the anomalous signal-to-noise ratio is low. Here, we describe algorithms and tools for evaluating and optimizing the useful anomalous correlation and the anomalous signal in a SAD experiment. A simple theoretical framework [Terwilliger et al. (2016), Acta Cryst. D 72 , 346–358] is used to develop methods for planning a SAD experiment, scaling SAD data sets and estimating the useful anomalous correlation and anomalous signal in a SAD data set. The phenix.plan_sad_experiment tool uses a database of solved and unsolved SAD data sets and the expected characteristics of a SAD data set to estimate the probability that the anomalous substructure will be found in the SAD experiment and the expected map quality that would be obtained if the substructure were found. The phenix.scale_and_merge tool scales unmerged SAD data from one or more crystals using local scaling and optimizes the anomalous signal by identifying the systematic differences among data sets, and the phenix.anomalous_signal tool estimates the useful anomalous correlation and anomalous signal after collecting SAD data and estimates the probability that the data set can be solved and the likely figure of merit of phasing.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Model-Based Reconstruction for Multi-Frequency Collimated Beam Ultrasound Systems

Collimated beam ultrasound systems are a technology for imaging inside multi-layered structures such as geothermal wells. These systems work by using a collimated narrow-band ultrasound transmitter that can penetrate through multiple layers of heterogeneous material. A series of measurements can then be made at multiple transmit frequencies. However, commonly used reconstruction algorithms such as Synthetic Aperture Focusing Technique (SAFT) tend to produce poor quality reconstructions for these systems both because they do not model collimated beam systems and they do not jointly reconstruct the multiple frequencies. Here, in this article, we propose a multi-frequency ultrasound model-based iterative reconstruction (UMBIR) algorithm designed for multi-frequency collimated beam ultrasound systems. The combined system targets reflective imaging of heterogeneous, multi-layered structures. For each transmitted frequency band, we introduce a physics-based forward model to accurately account for the propagation of the collimated narrow-band ultrasonic beam through the multi-layered media. We then show how the joint multi-frequency UMBIR reconstruction can be computed by modeling the direct arrival signals, detector noise, and incorporating a spatially varying image prior. Results using both simulated and experimental data indicate that multi-frequency UMBIR reconstruction yields much higher reconstruction quality than either single frequency UMBIR or SAFT.

47 OTHER INSTRUMENTATION↗
DOE OSTI2016

SU-F-T-347: An Absolute Dose-Volume Constraint Based Deterministic Optimization Framework for Multi-Co60 Source Focused Radiotherapy

Purpose: Treatment plan optimization in multi-Co60 source focused radiotherapy with multiple isocenters is challenging, because dose distribution is normalized to maximum dose during optimization and evaluation. The objective functions are traditionally defined based on relative dosimetric distribution. This study presents an alternative absolute dose-volume constraint (ADC) based deterministic optimization framework (ADC-DOF). Methods: The initial isocenters are placed on the eroded target surface. Collimator size is chosen based on the area of 2D contour on corresponding axial slice. The isocenter spacing is determined by adjacent collimator sizes. The weights are optimized by minimizing the deviation from ADCs using the steepest descent technique. An iterative procedure is developed to reduce the number of isocenters, where the isocenter with lowest weight is removed without affecting plan quality. The ADC-DOF is compared with the genetic algorithm (GA) using the same arbitrary shaped target (254cc), with a 15mm margin ring structure representing normal tissues. Results: For ADC-DOF, the ADCs imposed on target and ring are (D100>10Gy, D50,10, 0<12Gy, 15Gy and 20Gy) and (D40<10Gy). The resulting D100, 50, 10, 0 and D40 are (9.9Gy, 12.0Gy, 14.1Gy and 16.2Gy) and (10.2Gy). The objectives of GA are to maximize 50% isodose target coverage (TC) while minimize the dose delivered to the ring structure, which results in 97% TC and 47.2% average dose in ring structure. For ADC-DOF (GA) techniques, 20 out of 38 (10 out of 12) initial isocenters are used in the final plan, and the computation time is 8.7s (412.2s) on an i5 computer. Conclusion: We have developed a new optimization technique using ADC and deterministic optimization. Compared with GA, ADC-DOF uses more isocenters but is faster and more robust, and achieves a better conformity. For future work, we will focus on developing a more effective mechanism for initial isocenter determination.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

Implicit-Explicit Multirate Infinitesimal GARK Methods

This work focuses on the development of a new class of high-order accurate methods for multirate time integration of systems of ordinary differential equations. Unlike other recent work in this area, the proposed methods support mixed implicit-explicit (IMEX) treatment of the slow time scale. In addition to allowing this slow time scale flexibility, the proposed methods utilize a so-called infinitesimal formulation for the fast time scale through definition of a sequence of modified “fast" initial-value problems that may be solved using any viable algorithm. We name the proposed class as implicit-explicit multirate infinitesimal generalized-structure additive Runge--Kutta (IMEX-MRI-GARK) methods. In addition to defining these methods, we prove that they may be viewed as specific instances of GARK methods and derive a set of order conditions on the IMEX-MRI-GARK coefficients to guarantee both third and fourth order accuracy for the overall multirate method. Additionally, we provide three specific IMEX-MRI-GARK methods, two of order three and one of order four. We conclude with numerical simulations on two multirate test problems, demonstrating the methods' predicted convergence rates and comparing their efficiency against both legacy IMEX multirate schemes and recent third and fourth order implicit MRI-GARK methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis

Label Propagation is not only a well-known machine learning algorithm for classification but also an effective method for discovering communities and connected components in networks. We propose a new Direction-optimizing Label Propagation Algorithm (DOLPA) framework that enhances the performance of the standard Label Propagation Algorithm (LPA), increases its scalability, and extends its versatility and application scope. As a central feature, the DOLPA framework relies on the use of frontiers and alternates between label push and label pull operations to attain high performance. It is formulated in such a way that the same basic algorithm can be used for finding communities or connected components in graphs by only changing the objective function used. Additionally, DOLPA has parameters for tuning the processing order of vertices in a graph to reduce the number of edges visited and improve the quality of solution obtained. We present the design and implementation of the enhanced algorithm as well as our shared-memory parallelization of it using OpenMP. We also present an extensive experimental evaluation of our implementations using the LFR benchmark and real-world networks drawn from various domains. Compared with an implementation of LPA for community detection available in a widely used network analysis software, we achieve at most five times the F-Score while maintaining similar runtime for graphs with overlapping communities. We also compare DOLPA against an implementation of the Louvain method for community detection using the same LFR-graphs and show that DOLPA achieves about three times the F-Score at just 10% of the runtime. For connected component decomposition, our algorithm achieves orders of magnitude speedups over the basic LP-based algorithm on large-diameter graphs, up to 13.2× speedup over the Shiloach-Vishkin algorithm, and up to 1.6× speedup over Afforest on an Intel Xeon processor using 40 threads.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

HipGISAXS

Implementation of a flexible Grazing Incidence Small-Angle Scattering (GISAXS). Simulation code based on the Distorted Wave Born Approximation (DWBA) theory that effectively utilizes the parallel processing power provided by graphic processors and multicore processors. This constitutes a handy tool for experimentalists facing a massive flux of data, allowing them to accurately simulate the GISAXS process and analyze the produced data. The software computes the diffraction image for any given super position of custom shapes or morphologies in a user-defined region of the reciprocal space for all possible grazing incidence angles and in-plane sample rotations. This flexibility then allows to easily tackle a wide range of possible sample structures such as nanoparticles o top of or embedded in a substrate or a multilayered structure. In cases where the sample displays regions of significant refractive index contrast, an algorithm has been implemented to perform a slicing of the sample along the vertical direction and compute the averaging refractive index profile to be used as the reference geometry of the unpertubed system. Preliminary tests show good agreement with experimental data for a variety of commonly encountered nanostructures.

Xiaoye, Sherry Li↗
DOE OSTI2019

SERAC

The purpose of this code is to enable collaborative research in simulation of large deformation structural mechanics. Particularly, it will be used to investigate abstract physics coupling methods and algorithms for implicit solves on emerging computing hardware.

Bramwell, JamieA↗
DOE OSTI2020

Method of Moving Asymptotes Optimization Algorithm in Python

Python implementation of the Method of Moving Asymptotes optimization algorithm described in[Svanberg, K., The method of moving asymptotes- a new method for structural optimization. International journal for numerical methods in engineering, 1987. 24(2): p.359 (https://onlinelibrary.wiley.com/doi/abs/10.1002/nme.1620240207). Originally implemented in[GetDP](https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=717799) [project](https://gitlab.onelab.info/getdp/getdp), although it has been deleted in their repository.

Salazar De Troya, Miguel↗