Development of a Research and Production Material Model Library for Computational Solid Mechanics
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Abstract not provided.
Abstract not provided.
Additive manufacturing (AM) is the process of constructing an object by adding layer upon layer of material in specific locations, to build the object into its final shape. There are many different AM processes that can be used to add layers of material, such as extrusion, material jetting, and sheet lamination. All of the AM processes are a form of digital fabrication because the object to be constructed must first be modeled with a computer. The modeled object must be converted into machine instructions that an AM system can use to construct the object. This chapter serves as an introduction to the many different AM processes. Subsequent chapters will explore the intricacies of creating machine instructions for the AM processes introduced here.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
A modeling approach for binary collision and particle breakup is presented for a stochastic particle model in which a computational parcel represents a number of similar physical particles. Presented in this report includes sampling from a distribution of discrete data, parcel number reduction, probabilistic calculation of collision rates, and various particle-particle interactions. Modeling of elastic scattering, coalescence and agglomeration, and breakup are discussed for solid-solid, solid-liquid, and liquid-liquid particle collisions. Numerical procedures are also summarized.
This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.
This paper summarizes the modeling, statistics, simulation, and computing needs of direct dark matter detection experiments in the next decade.
Fractured media models comprise discontinuities of multiple lengths (e.g. fracture lengths and apertures, wellbore area) that fall into the relatively insignificant length scales spanning millimeter-scale fractures to centimeter-scale wellbores in comparison to the extensions of the field of interest, and challenge the conventional discretization methods imposing highly-fine meshing and formidably large numerical cost. By utilizing the recent developments in the finite element analysis of electromagnetics that allow to represent material properties on a hierarchical geometry, this project develops computational capabilities to model fluid flow, heat conduction, transport and induced polarization in large-scale geologic environments that possess geometrically-complex fractures and man-made infrastructures without explosive computational cost. The computational efficiency and robustness of this multi-physics modeling tool are demonstrated by considering various highly-realistic complex geologic environments that are common in many energy and national security related engineering problems.
This paper describes the implementation of a two-dimensional hydrodynamic flood model with two different numerical schemes on heterogeneous high-performance computing architectures. Both schemes were able to solve the nonlinear hyperbolic shallow water equations using an explicit upwind first-order approach on finite differences and finite volumes, respectively, and were conducted using MPI and CUDA. Four different test cases were simulated on the Summit supercomputer at Oak Ridge National Laboratory. Both numerical schemes scaled up to 128 nodes (768 GPUs) with a maximum 98.2x speedup of over 1 GPU. The lowest run time for the 10 day Hurricane Harvey event simulation at 5 meter resolution (272 million grid cells) was 50 minutes. GPUDirect communication proved to be more convenient than the standard communication strategy. Both strong and weak scaling are shown.
Abstract mAbs to MHC class I (MHC-I) molecules have proved to be crucial reagents for tissue typing and fundamental studies of immune recognition. To augment our understanding of epitopic sites seen by a set of anti–MHC-I mAb, we determined X-ray crystal structures of four complexes of anti–MHC-I Fabs bound to peptide/MHC-I/β2-microglobulin (pMHC-I). An anti–H2-Dd mAb, two anti–MHC-I α3 domain mAbs, and an anti–β2-microglobulin mAb bind pMHC-I at sites consistent with earlier mutational and functional experiments, and the structures explain allelomorph specificity. Comparison of the experimentally determined structures with computationally derived models using AlphaFold Multimer showed that although predictions of the individual pMHC-I heterodimers were quite acceptable, the computational models failed to properly identify the docking sites of the mAb on pMHC-I. The experimental and predicted structures provide insight into strengths and weaknesses of purely computational approaches and suggest areas that merit additional attention.
Genome-scale stoichiometric modeling of metabolism has become a standard systems biology tool for modeling cellular physiology and growth. Extensions of this approach are emerging as a valuable avenue for predicting, understanding and designing microbial communities. Computation of microbial ecosystems in time and space (COMETS) extends dynamic flux balance analysis to generate simulations of multiple microbial species in molecularly complex and spatially structured environments. Here we describe how to best use and apply the most recent version of COMETS, which incorporates a more accurate biophysical model of microbial biomass expansion upon growth, evolutionary dynamics and extracellular enzyme activity modules. In addition to a command-line option, COMETS includes user-friendly Python and MATLAB interfaces compatible with the well-established COBRA models and methods, as well as comprehensive documentation and tutorials. Overall, this protocol provides a detailed guideline for installing, testing and applying COMETS to different scenarios, generating simulations that take from a few minutes to several days to run, with broad applicability to microbial communities across biomes and scales.
This study describes accurate, computationally efficient models that can be implemented for practical use in predicting frost events for point-scale agricultural applications. Frost damage in agriculture is a costly burden to farmers and global food security alike. Timely prediction of frost events is important to reduce the cost of agricultural frost damage and traditional numerical weather forecasts are often inaccurate at the field-scale in complex terrain. In this paper, we developed machine learning (ML) algorithms for the prediction of such frost events near Alcalde, NM at the point-scale. ML algorithms investigated include deep neural network, convolution neural networks, and random forest models at lead-times of 6–48 h. Our results show promising accuracy (6-h prediction RMSE = 1.53–1.72°C) for use in frost and minimum temperature prediction applications. Seasonal differences in model predictions resulted in a slight negative bias during Spring and Summer months and a positive bias in Fall and Winter months. Additionally, we tested the model transferability by continuing training and testing using data from sensors at a nearby farm. We calculated the feature importance of the random forest models and were able to determine which parameters provided the models with the most useful information for predictions. We determined that soil temperature is a key parameter in longer term predictions (>24 h), while other temperature related parameters provide the majority of information for shorter term predictions. The model error compared favorable to previous ML based frost studies and outperformed the physically based High Resolution Rapid Refresh forecasting system making our ML-models attractive for deployment toward real-time monitoring of frost events and damage at commercial farming operations.
We compute the longitudinal dielectric function ɛl(k) for p-point water models, p = 3 (SPC/E, TIP3P), p = 4 (TIP4P-EW, OPC), and p = 5 (TIP5P-E) from the charge–charge fluctuation function SZZ(k), obtained from two methods: average of the charge in k-space (method:sum) and from the pair distribution function in Fourier space (method:integral). The latter requires a continuation to small k-values, which we thoroughly discuss. We conclude with a detailed comparison of the longitudinal dielectric function for the different p-point models and its main characteristics: small k and large k limits, position of the poles, and its (complex) zeros.