Search NASA⌕ Search

SEARCH · Search NASA

Results for “hierarchical algorithm”

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 451 records · Page 25

Co-Optimization of Velocity and Charge-Depletion for Plug-In Hybrid Electric Vehicles: Accounting for Acceleration and Jerk Constraints

Abstract Recent advances in vehicle connectivity and automation technologies promote advanced control algorithms that co-optimize the longitudinal dynamics and powertrain operation of hybrid electric vehicles. Typically, a sequential optimization with the vehicle dynamics optimized followed by powertrain optimization is adopted to manage a number of complexities such as the inherent mixed-integer nature of the hybrid powertrain, the numerous state and control variables, the differing time scales of vehicle and powertrain subsystems, time-varying state constraints, and large horizon lengths. Instead, we solve the offline optimization problem in a centralize manner assuming exact knowledge of the lead vehicle's position over the entire trip by applying a discrete-time single shooting-based numerical approach, Discrete Mixed-Integer Shooting (DMIS), including a linearly increasing computational complexity to the problem horizon. In particular, the hierarchical problem structure is exploited to decompose the computationally intensive Hamiltonian minimization step into a set of low-dimensional optimizations. DMIS allows us to compute the direct fuel minimization problem including the vehicle and powertrain dynamics in a centralized manner to its full horizon while systematically tuning weighting factors that penalize passenger discomfort. For the first time, this study reveals that practically implemented sequential optimization exhibits similar fuel optimality as co-optimization when a certain level of passenger comfort is required.

Automation & Control Systems↗

Piecewise-Constant-Model-Based Interior Tomography Applied to Dentin Tubules

Dentin is a hierarchically structured biomineralized composite material, and dentin’s tubules are difficult to study in situ. Nano-CT provides the requisite resolution, but the field of view typically contains only a few tubules. Using a plate-like specimen allows reconstruction of a volume containing specific tubules from a number of truncated projections typically collected over an angular range of about 140°, which is practically accessible. Classical computed tomography (CT) theory cannot exactly reconstruct an object only from truncated projections, needless to say a limited angular range. Recently, interior tomography was developed to reconstruct a region-of-interest (ROI) from truncated data in a theoretically exact fashion via the total variation (TV) minimization under the condition that the ROI is piecewise constant. In this paper, we employ a TV minimization interior tomography algorithm to reconstruct interior microstructures in dentin from truncated projections over a limited angular range. Compared to the filtered backprojection (FBP) reconstruction, our reconstruction method reduces noise and suppresses artifacts. Volume rendering confirms the merits of our method in terms of preserving the interior microstructure of the dentin specimen.

59 BASIC BIOLOGICAL SCIENCES↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Time Acceleration Methods for Advection on the Cubed Sphere

Climate simulation will not grow to the ultrascale without new algorithms to overcome the scalability barriers blocking existing implementations. Until recently, climate simulations concentrated on the question of whether the climate is changing. The emphasis is now shifting to impact assessments, mitigation and adaptation strategies, and regional details. Such studies will require significant increases in spatial resolution and model complexity while maintaining adequate throughput. The barrier to progress is the resulting decrease in time step without increasing single-thread performance. In this paper we demonstrate how to overcome this time barrier for the first standard test defined for the shallow-water equations on a sphere. This paper explains how combining a multiwavelet discontinuous Galerkin method with exact linear part time-evolution schemes can overcome the time barrier for advection equations on a sphere. The discontinuous Galerkin method is a high-order method that is conservative, flexible, and scalable. The addition of multiwavelets to discontinuous Galerkin provides a hierarchical scale structure that can be exploited to improve computational efficiency in both the spatial and temporal dimensions. Exact linear part time-evolution schemes are explicit schemes that remain stable for implicit-size time steps.

54 ENVIRONMENTAL SCIENCES↗

Prediction of softening kinetics and recrystallization texture in non-isothermally annealed bulged tubes using CPFEM and CA models

A hierarchically coupled cellular automata (CA) model, crystal plasticity finite element method (CPFEM), and thermal finite element (FE) model is developed to predict the softening kinetics of the bulged steel tube during non-isothermal annealing. Through the developed model, the kinetics of softening mechanisms including static recovery (SRV) and static recrystallization (SRX), as well as the recrystallization texture are predicted. Later, the Johnson-Mehl-Avrami-Kohnogorov (JMAK) model based on the predicted SRX data is developed to interpret the recrystallization behavior of the material. To perform this study, diverse experimental tests including tube hydroforming (THF), annealing, uniaxial tensile test, hardness test, as well as microstructure observations through optical microscopy and Electron Backscatter Diffraction (EBSD) tests on steel tube are performed. The obtained experimental data are utilized to calibrate and verify the implemented CPFEM model for simulation of THF process, thermal FE model for prediction of the local temperature over annealing time, and CA algorithm for modeling of the softening kinetics and texture evolution throughout the annealing process. The study shows that the predicted deformation characteristics, softening kinetics, recrystallization texture and temperature profile during non-isothermal annealing are in good agreement with experimental data. During the annealing process, a total of four stages for the kinetics of softening mechanisms is observed: No softening; SRV only; SRV dominant; and SRX dominant. During the progress of SRX, the behavior of recrystallization is abruptly changed, confirming that two different mechanisms are controlling the kinetics of transformation.

36 MATERIALS SCIENCE↗

Evaluating lightweight unsupervised online IDS for masquerade attacks in CAN

Vehicular controller area networks (CANs) are susceptible to masquerade attacks by malicious adversaries. In masquerade attacks, adversaries silence a targeted ID and then send malicious frames with forged content at the expected timing of benign frames. As masquerade attacks could seriously harm vehicle functionality and are the stealthiest attacks to detect in CAN, recent work has devoted attention to compare frameworks for detecting masquerade attacks in CAN. However, most existing works report offline evaluations using CAN logs already collected using simulations that do not comply with the domain’s real-time constraints. Here we contribute to advance the state of the art by presenting a comparative evaluation of four different non-deep learning (DL)-based unsupervised online intrusion detection systems (IDS) for masquerade attacks in CAN. Our approach differs from existing comparative evaluations in that we analyze the effect of controlling streaming data conditions in a sliding window setting. In doing so, we use realistic masquerade attacks being replayed from the ROAD dataset. We show that although evaluated IDS are not effective at detecting every attack type, the method that relies on detecting changes in the hierarchical structure of clusters of time series produces the best results at the expense of higher computational overhead. We discuss limitations, open challenges, and how the evaluated methods can be used for practical unsupervised online CAN IDS for masquerade attacks.

Anomaly detection↗

IMAGING THE ALGOL TRIPLE SYSTEM IN THE H BAND WITH THE CHARA INTERFEROMETER

Algol ({beta} Per) is an extensively studied hierarchical triple system whose inner pair is a prototype semi-detached binary with mass transfer occurring from the sub-giant secondary to the main-sequence primary. We present here the results of our Algol observations made between 2006 and 2010 at the CHARA interferometer with the Michigan Infrared Combiner in the H-band. The use of four telescopes with long baselines allows us to achieve better than 0.5 mas resolution and to unambiguously resolve the three stars. The inner and outer orbital elements, as well as the angular sizes and mass ratios for the three components, are determined independently from previous studies. We report a significantly improved orbit for the inner stellar pair with the consequence of a 15% change in the primary mass compared with previous studies. We also determine the mutual inclination of the orbits to be much closer to perpendicularity than previously established. State-of-the-art image reconstruction algorithms are used to image the full triple system. In particular an image sequence of 55 distinct phases of the inner pair orbit is reconstructed, clearly showing the Roche-lobe-filling secondary revolving around the primary, with several epochs corresponding to the primary and secondary eclipses.

79 ASTRONOMY AND ASTROPHYSICS↗

Determining the Bayesian optimal sampling strategy in a hierarchical system.

Consider a classic hierarchy tree as a basic model of a 'system-of-systems' network, where each node represents a component system (which may itself consist of a set of sub-systems). For this general composite system, we present a technique for computing the optimal testing strategy, which is based on Bayesian decision analysis. In previous work, we developed a Bayesian approach for computing the distribution of the reliability of a system-of-systems structure that uses test data and prior information. This allows for the determination of both an estimate of the reliability and a quantification of confidence in the estimate. Improving the accuracy of the reliability estimate and increasing the corresponding confidence require the collection of additional data. However, testing all possible sub-systems may not be cost-effective, feasible, or even necessary to achieve an improvement in the reliability estimate. To address this sampling issue, we formulate a Bayesian methodology that systematically determines the optimal sampling strategy under specified constraints and costs that will maximally improve the reliability estimate of the composite system, e.g., by reducing the variance of the reliability distribution. This methodology involves calculating the 'Bayes risk of a decision rule' for each available sampling strategy, where risk quantifies the relative effect that each sampling strategy could have on the reliability estimate. A general numerical algorithm is developed and tested using an example multicomponent system. The results show that the procedure scales linearly with the number of components available for testing.

99 GENERAL AND MISCELLANEOUS↗

Using galaxy pairs to investigate the three-point correlation function in the squeezed limit

We investigate the three-point correlation function (3PCF) in the squeezed limit by considering galaxy pairs as discrete objects and cross-correlating them with the galaxy field. We develop an efficient algorithm using fast Fourier transforms to compute such cross-correlations and their associated pair-galaxy bias bp, g and the squeezed 3PCF coefficient Qeff. We implement our method using N-body cosmological simulations and a fiducial halo occupation distribution (HOD) and present the results in both the real space and redshift space. In real space, we observe a peak in b p, g and Q eff at pair separation of ~2 Mpc, attributed to the fact that galaxy pairs at 2 Mpc separation trace the most massive dark matter haloes. We also see strong anisotropy in the b p, g and Qeff signals that track the large-scale filamentary structure. In redshift space, both the 2 Mpc peak and the anisotropy are significantly smeared out along the line of sight due to finger-of-God effect. In both the real space and redshift space, the squeezed 3PCF shows a factor of 2 variation, contradicting the hierarchical ansatz, but offering rich information on the galaxy-halo connection. Thus, we explore the possibility of using the squeezed 3PCF to constrain the HOD. When we compare two simple HOD models that are closely matched in their projected two-point correlation function (2PCF), we do not yet see a strong variation in the 3PCF that is clearly disentangled from variations in the projected 2PCF. Nevertheless, we propose that more complicated HOD models, e.g. those incorporating assembly bias, can break degeneracies in the 2PCF and show a distinguishable squeezed 3PCF signal.

79 ASTRONOMY AND ASTROPHYSICS↗

Block-oriented modeling of superstructure optimization problems

We present a novel software framework for modeling large-scale engineered systems as mathematical optimization problems. A key motivating feature in such systems is their hierarchical, highly structured topology. Existing mathematical optimization modeling environments do not facilitate the natural expression and manipulation of hierarchically structured systems. Rather, the modeler is forced to "flatten" the system description, hiding structure that may be exploited by solvers, and obfuscating the system that the modeling environment is attempting to represent. To correct this deficiency, we propose a Python-based "block-oriented" modeling approach for representing the discrete components within the system. Our approach is an extension of the Pyomo library for specifying mathematical optimization problems. Through the use of a modeling components library, the block-oriented approach facilitates a clean separation of system superstructure from the details of individual components. This approach also naturally lends itself to expressing design and operational decisions as disjunctive expressions over the component blocks. By expressing a mathematical optimization problem in a block-oriented manner, inherent structure (e.g., multiple scenarios) is preserved for potential exploitation by solvers. In particular, we show that block-structured mathematical optimization problems can be straightforwardly manipulated by decomposition-based multi-scenario algorithmic strategies, specifically in the context of the PySP stochastic programming library. We illustrate our block-oriented modeling approach using a case study drawn from the electricity grid operations domain: unit commitment with transmission switching and N - 1 reliability constraints. Finally, we demonstrate that the overhead associated with block-oriented modeling only minimally increases model instantiation times, and need not adversely impact solver behavior. (C) 2013 Elsevier Ltd. All rights reserved.

Friedman, Z↗

Removing instabilities in the hierarchical equations of motion: Exact and approximate projection approaches

The hierarchical equations of motion (HEOM) provide a numerically exact approach for computing the reduced dynamics of a quantum system linearly coupled to a bath. We have found that HEOM contains temperature-dependent instabilities that grow exponentially in time. In the case of continuous-bath models, these instabilities may be delayed to later times by increasing the hierarchy dimension; however, for systems coupled to discrete, nondispersive modes, increasing the hierarchy dimension does little to alleviate the problem. We show that these instabilities can also be removed completely at a potentially much lower cost via projection onto the space of stable eigenmodes; furthermore, we find that for discrete-bath models at zero temperature, the remaining projected dynamics computed with few hierarchy levels are essentially identical to the exact dynamics that otherwise might require an intractably large number of hierarchy levels for convergence. Recognizing that computation of the eigenmodes might be prohibitive, e.g., for large or strongly coupled models, we present a Prony filtration algorithm that may be useful as an alternative for accomplishing this projection when diagonalization is too costly. We present results demonstrating the efficacy of HEOM projected via diagonalization and Prony filtration. Finally, we discuss issues associated with the non-normality of HEOM.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mapping 3D grain and precipitate structure during in situ mechanical testing of open-cell metal foam using micro-computed tomography and high-energy X-ray diffraction microscopy

Open-cell metal foams are ultra-low-density cellular metals with complex hierarchical structures that span bulk, cell, ligament, and sub-ligament scales and give rise to desirable properties such as high strength-to-weight ratio and excellent energy absorption. Although literature suggests that intrinsic material structures at sub-ligament length scales (e.g., grains and precipitates) play an important role in mechanical behavior of open-cell metal foams, there are very few experimental measurements of such structures in three dimensions and for meaningful volumes of foam. This study seeks to map and track the three-dimensional (3D) grain and precipitate structures of an intact volume of open-cell aluminum foam by advancing microstructural characterization techniques that leverage X-ray micro-computed tomography (μCT) and far-field high-energy X-ray diffraction microscopy (FF-HEDM). A 6%-relative-density aluminum foam sample was mechanically tested in compression while μCT and FF-HEDM measurements were collected at interrupted loading states at beamline 1-ID of the Advanced Photon Source. Further, a new scanning strategy and reconstruction algorithm were established to enable characterization of a foam volume with diameter approximately four times wider than the nominal width of the X-ray beam. The result is a set of maps that detail both the 3D grain and precipitate structures throughout the foam volume at successive strain steps. A novel grain tracking procedure was developed to track individual grains within the foam volume by accounting for the large rigid-body motions that individual ligaments can undergo during mechanical loading. The ability to track grains and precipitate structures in three dimensions throughout large bulk deformation of ultra-low-density polycrystalline materials enables new possibilities for validating numerical models and investigating local failure mechanisms. Furthermore, the methods and procedures developed in this study could be applied to other ultra-low-density structures, such as additively manufactured lattices.

36 MATERIALS SCIENCE↗

Patch-based image segmentation of satellite imagery using minimum spanning tree construction

We present a method for hierarchical image segmentation and feature extraction. This method builds upon the combination of the detection of image spectral discontinuities using Canny edge detection and the image Laplacian, followed by the construction of a hierarchy of segmented images of successively reduced levels of details. These images are represented as sets of polygonized pixel patches (polygons) attributed with spectral and structural characteristics. This hierarchy forms the basis for object-oriented image analysis. To build fine level-of-detail representation of the original image, seed partitions (polygons) are built upon a triangular mesh composed of irregular sized triangles, whose spatial arrangement is adapted to the image content. This is achieved by building the triangular mesh on the top of the detected spectral discontinuities that form a network of constraints for the Delaunay triangulation. A polygonized image is represented as a spatial network in the form of a graph with vertices which correspond to the polygonal partitions and graph edges reflecting pairwise partitions relations. Image graph partitioning is based on the iterative graph oontraction using Boruvka's Minimum Spanning Tree algorithm. An important characteristic of the approach is that the agglomeration of partitions is constrained by the detected spectral discontinuities; thus the shapes of agglomerated partitions are more likely to correspond to the outlines of real-world objects.

97 MATHEMATICS AND COMPUTING↗

CHESS 2025: Spectrometer orthorectified at-sensor radiance from NEON AOP imaging spectroscopy surveys

This dataset provides Level 1 (L1) orthorectified at-sensor radiance derived from measurements collected by the Imaging Spectrometer-1 (NIS-1) onboard the NEON (National Ecological Observatory Network) Airborne Observation Platform (AOP) for the 2025 Colorado Headwaters Ecological Spectroscopy Study (CHESS). NIS-1 captures light reflected from the Earth’s surface in 426 discrete wavelength bands as raw digital numbers (DNs; Level 0). These data are then calibrated to physical units (uW/cm²·sr·nm) following the processing steps described in the NEON Imaging Spectrometer Level 1B Calibrated Radiance Algorithm Theoretical Basis Document (ATBD; Gallery 2022). The data delivered here are the primary inputs for the surface reflectance product in “Custom surface reflectance, shade masks, and equivalent water thickness maps for the Colorado Headwaters Ecological Spectroscopy Study” (Carroll et al. 2026). For intertemporal comparison, the radiance data here are most directly relatable to the v2 radiance data in “NEON AOP Imaging Spectroscopy Survey of Upper East River Colorado Watersheds: Raw-Space Radiance and Observational Variable Dataset” (Goulden et al. 2018), to which the same processing methodology was applied. Together, the radiance and reflectance data enable users to exploit the unique reflection signatures of different surface objects for land cover classification, foliar trait mapping, plant vigor assessment, water content estimation, trace-element identification, and other scientific applications. The data were acquired over three study domains in the Upper Gunnison river basin: the upper East River watershed (CRBU); Almont Triangle and Taylor Canyon (ALMO); and Upper Taylor River watershed (UPTA) between 2025-06-13 and 2025-07-15. Within each domain, data are delivered by flightline as orthorectified and calibrated hyperspectral rasters in Hierarchical Data Format version 5 (HDF5) format, with radiance values provided in uW/cm²·sr·nm on a fixed, uniform Universal Transverse Mercator (UTM) grid at 1 meter spatial resolution. The radiance rasters include all 426 NIS-1 spectral bands, along with associated quality-assurance (QA) and diagnostic and ancillary layers needed for atmospheric correction workflows. Orthorectified radiance is produced from pushbroom spectrometer observations by applying NEON’s radiometric calibration (including bad pixel masking, dark subtract, dark pedestal shift correction, electronic panel ghost correction, grating ghost correction, deblur correction and flat-fielding) and spectral calibration (using spectral response function band centers and full-width at half-maximum intensity), followed by geolocation and regridding to the fixed grid. CHESS Project Description: The Colorado Headwaters Ecological Spectroscopy Study (CHESS) comprised a multi-week airborne remote sensing and field observation campaign in the Upper Gunnison Basin, Colorado, conducted in June and July of 2025. Airborne remote sensing was conducted by the National Ecological Observatory Network Airborne Observation Platform (NEON AOP), concurrent with a field campaign run by the Rocky Mountain Biological Laboratory (RMBL), the Lawrence Berkeley National Laboratory (LBNL) and SLAC National Accelerator Laboratory Watershed Function Science Focus Area (SFA), and NASA-JPL (Jet Propulsion Laboratory) Earth Surface Mineral Dust Source Investigation (EMIT) program. Between June 10 and July 18, 2025, the NEON AOP flight team collected high-resolution aerial imaging spectroscopy and Light Detection and Ranging (LiDAR) data over three domains: the Upper East River (CRBU), Almont Triangle (ALMO), and the Upper Taylor Basin (UPTA). In coordination with the flights, a field campaign acquired ground-truth observations, including observations of vegetation composition, foliar traits, forest demography, and subsurface properties in 18 core sampling areas within the domains. Additional surface water observations were taken at over 380 point locations. All CHESS campaign datasets can be found within the CHESS ESS-DIVE data portal: https://data.ess-dive.lbl.gov/portals/chess. Funding Acknowledgement: Field and remote-sensing data acquisition was performed under a grant from the National Aeronautics and Space Administration (80NSSC24K1005). This work was also supported by the Watershed Function Science Focus Area at Lawrence Berkeley National Laboratory funded by the US Department of Energy, Office of Science, Biological and Environmental Research under Contract No. DE-AC02-05CH11231.

2018 NEON and 2025 CHESS Campaigns↗

GPU Acceleration of Large-Scale Full-Frequency GW Calculations

Many-body perturbation theory is a powerful method to simulate electronic excitations in molecules and materials starting from the output of density functional theory calculations. By implementing the theory efficiently so as to run at scale on the latest leadership high-performance computing systems it is possible to extend the scope of GW calculations. Here, we present a GPU acceleration study of the full-frequency GW method as implemented in the WEST code. Excellent performance is achieved through the use of (i) optimized GPU libraries, e.g., cuFFT and cuBLAS, (ii) a hierarchical parallelization strategy that minimizes CPU-CPU, CPU-GPU, and GPU-GPU data transfer operations, (iii) nonblocking MPI communications that overlap with GPU computations, and (iv) mixed precision in selected portions of the code. A series of performance benchmarks has been carried out on leadership high-performance computing systems, showing a substantial speedup of the GPU-accelerated version of WEST with respect to its CPU version. Good strong and weak scaling is demonstrated using up to 25 920 GPUs. Finally, we showcase the capability of the GPU version of WEST for large-scale, full-frequency GW calculations of realistic systems, e.g., a nanostructure, an interface, and a defect, comprising up to 10 368 valence electrons.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Synergistic Computational and Microstructural Design of Next- Generation High-Temperature Austenitic Stainless Steels

The purpose of this project was to: 1) study deformation twinning, its evolution, thermal stability, and the contribution on mechanical response of the new advanced stainless steels, especially at elevated temperatures; 2) study alumina-scale formation on the surface, as an alternative for conventional chromium oxide, that shows better oxidation resistance, through alloy design; and 3) design new generation of high temperature stainless steels that form alumina scale and have thermally stable nano-twins. The work involved few baseline alloys for investigating the twin formation under tensile loading, thermal stability of these twins, and the role of deformation twins on the mechanical response of the alloys. These baseline alloys included Hadfield Steel (Fe-13Mn-1C), 316, 316L and 316N stainless steels. Another baseline alloy was studied for alumina-scale formation investigations. Hadfield steel showed twinning but undesired second phases formed at higher temperatures. 316N stainless steel did not show signs of deformation twinning. Conventional 316 stainless steel demonstrated extensive deformation twinning at room temperature. Investigations on this alloy, both in single crystalline and polycrystalline forms, showed that deformation twins evolve in a hierarchical manner, consisting of micron–sized bundles of nano-twins. The width of nano-twins stays almost constant as the extent of strain increases, but the width and number of the bundles increase with increasing strain. A systematic thermomechanical cycling study showed that the twins were stable at temperatures as high as 900°C, after the dislocations are annealed out. Using such cycles, volume fraction of the thermally stable deformation twins were increased up to 40% in 316 stainless steel. Using computational thermodynamics and kinetics calculations, we designed two generations of advanced austenitic stainless steels. In the first generation, Alloy 1, which had been proposed as an alumina-forming austenitic stainless steel, is fully austenitic, but possesses carbides that were not dissolvable and could not be controlled. This alloy also did not show deformation twinning. Alloy 2 was designed based on alloy 1, but was not fully austenitic and had significant traces of uncontrollable precipitates as well. Alloy 3, also designed based on alloy 1, was mainly austenitic with evolution of a second phase along the grain boundaries, but also had precipitates that were not controllable. Based on the knowledge gained from the first generation of the designed steels, two more steels, called PGAA1 and PGAA2, were proposed using genetic algorithms that, based on the modelling, were supposed to exhibit alumina-scale formation. PGAA1, however, did not demonstrate a fully austenitic structure. PGAA2 could achieve a mostly austenitic structure through thermo-mechanical processing, and was then used for oxidation tests. The oxidation tests of PGAA2, with and without nitrogen impurities, along with alloy 1, suggested that PGAA2 can form alumina-scale similar to alloy 1, but N impurity will prevent formation of such a scale, probably through formation of aluminum nitrides. For the above mentioned genetic algorithm framework of alloy design, separate models were developed for specific design criteria. For prediction of alumina formation in stainless steels, a model was constructed based off of two criteria – effective valence and third element effect. These criteria capture the thermodynamics and kinetics of alumina formation in steels. To test the efficacy and robustness of this model, they were tested against alloys in the literature which had been experimentally verified to exhibit alumina formation and the predictions were in excellent agreement with the experiments. Another meta-model for prediction of twinning in unknown steel compositions was developed by an informatics based machine learning/data mining approach. Stacking Fault Energy data was captured from the literature for a large number of steel compositions and then this data was used to build a classifier to predict deformation mechanisms. Here a training set-test set based analysis was performed to test performance. The above genetic algorithm based optimization framework for alloy design was exhibited to be a successful methodology for accelerated materials discovery in the context of alloy design.

36 MATERIALS SCIENCE↗

Computational Design of Creep-Resistant Alloys and Experimental Validation in Ferritic Superalloys

A new class of ferritic superalloys containing B2-type zones inside parent L21-type precipitates in a disordered solid-solution matrix, also known as a hierarchical-precipitate strengthened ferritic alloy (HPSFA), has been developed for high-temperature structural applications in fossil-energy power plants. These alloys were designed by the addition of the Ti element into a previously-studied NiAl-strengthened ferritic alloy (denoted as FBB8 in this study). In the present research, systematic investigations, including advanced experimental techniques, first-principles calculations, and numerical simulations, have been integrated and conducted to characterize the complex microstructures and excellent creep resistance of HPSFAs. The experimental techniques include transmission-electron microscopy, scanningtransmission- electron microscopy, neutron diffraction, and atom-probe tomography, which provide detailed microstructural information of HPSFAs. Systematic tension/compression creep tests revealed that HPSFAs exhibit the superior creep resistance, compared with the FBB8 and conventional ferritic steels (i.e., the creep rates of HPSFAs are about 4 orders of magnitude slower than the FBB8 and conventional ferritic steels.) First-principles calculations include interfacial free energies, anti-phase boundary (APB) free energies, elastic constants, and impurity diffusivities in Fe. Combined with kinetic Monte- Carlo simulations of interdiffusion coefficients, and the integration of computational thermodynamics and kinetics, these calculations provide great understanding of thermodynamic and mechanical properties of HPSFAs. In addition to the systematic experimental approach and first-principles calculations, a series of numerical tools and algorithms, which assist in the optimization of creep properties of ferritic superalloys, are utilized and developed. These numerical simulation results are compared with the available experimental data and previous first-principles calculations, providing deep insight of creep mechanisms of the creep-resistant ferritic superalloys. With the above investigations, the HPSFA has been proved with superior creep resistance, and its microstructure, creep mechanism, and thermal/mechanical properties have been well studied and understood. In the future, HPSFAs with different additions and sizes of precipitates will be investigated and developed to further enhance the creep resistance of the ferritic superalloys and provide promising applications of the fossil-energy power plants.

Liaw, Peter↗