skip to main content


Title: Nearest-neighbor Gaussian Process Emulation for Multi-dimensional Array Responses in Freeze Nano 3D Printing of Energy Devices
Abstract Energy 3D printing processes have enabled energy storage devices with complex structures, high energy density, and high power density. Among these processes, Freeze Nano Printing (FNP) has risen as a promising process. However, quality problems are among the biggest barriers for FNP. Particularly, the droplet solidification time in FNP governs thermal distribution, and subsequently determines product solidification, formation, and quality. To describe the solidification time, physical-based heat transfer model is built. But it is computationally intensive. The objective of this work is to build an efficient emulator for the physical model. There are several challenges unaddressed: 1) the solidification time at various locations, which is a multi-dimensional array response, needs to be modeled; 2) the construction and evaluation of the emulator at new process settings need to be quick and accurate. We integrate joint tensor decomposition and Nearest Neighbor Gaussian Process (NNGP) to construct an efficient multi-dimensional array response emulator with process settings as inputs. Specifically, structured joint tensor decomposition decomposes the multi-dimensional array responses at various process settings into the setting-specific core tensors and shared low dimensional factorization matrices. Then, each independent entry of the core tensor is modeled with an NNGP, which addresses the computationally intensive model estimation problem by sampling the nearest neighborhood samples. Finally, tensor reconstruction is performed to make predictions of solidification time for new process settings. The proposed framework is demonstrated by emulating the physical model of FNP, and compared with alternative tensor (multi-dimensional array) regression models.  more » « less
Award ID(s):
1846863
PAR ID:
10132645
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
Journal of Computing and Information Science in Engineering
ISSN:
1530-9827
Page Range / eLocation ID:
1 to 36
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    Freeze nano 3D printing is a novel process that seamlessly integrates freeze casting and inkjet printing processes. It can fabricate flexible energy products with both macroscale and microscale features. These multi-scale features enable good mechanical and electrical properties with lightweight structures. However, the quality issues are among the biggest barriers that freeze nano printing, and other 3D printing processes, need to come through. In particular, the droplet solidification behavior is crucial for the product quality. The physical based heat transfer models are computationally inefficient for the online solidification time prediction during the printing process. In this paper, we integrate machine learning (i.e., tensor decomposition) methods and physical models to emulate the tensor responses of droplet solidification time from the physical based models. The tensor responses are factorized with joint tensor decomposition, and represented with low dimensional vectors. We then model these low dimensional vectors with Gaussian process models. We demonstrate the proposed framework for emulating the physical models of freeze nano 3D printing, which can help the future real-time process optimization.

     
    more » « less
  2. The phase-field method is an attractive computational tool for simulating microstructural evolution during phase separation, including solidification and spinodal decomposition. However, the high computational cost associated with solving phase-field equations currently limits our ability to comprehend phase transformations. This article reports a novel phase-field emulator based on the tensor decomposition of the evolving microstructures and their corresponding two-point correlation functions to predict microstructural evolution at arbitrarily small time scales that are otherwise nontrivial to achieve using traditional phase-field approaches. The reported technique is based on obtaining a low-dimensional representation of the microstructures via tensor decomposition, and subsequently, predicting the microstructure evolution in the low-dimensional space using Gaussian process regression (GPR). Once we obtain the microstructure prediction in the low-dimensional space, we employ a hybrid input–output phase-retrieval algorithm to reconstruct the microstructures. As proof of concept, we present the results on microstructure prediction for spinodal decomposition, although the method itself is agnostic of the material parameters. Results show that we are able to predict microstructure evolution sequences that closely resemble the true microstructures (average normalized mean square of 6.78×10^−7) at time scales half of that employed in obtaining training data. Our data-driven microstructure emulator opens new avenues to predict the microstructural evolution by leveraging phase-field simulations and physical experimentation where the time resolution is often quite large due to limited resources and physical constraints, such as the phase coarsening experiments previously performed in microgravity. 
    more » « less
  3. null (Ed.)
    To overcome the curse of dimensionality in joint probability learning, recent work has proposed to recover the joint probability mass function (PMF) of an arbitrary number of random variables (RVs) from three-dimensional marginals, exploiting the uniqueness of tensor decomposition and the (unknown) dependence among the RVs. Nonetheless, accurately estimating three-dimensional marginals is still costly in terms of sample complexity. Tensor decomposition also poses a computationally intensive optimization problem. This work puts forth a new framework that learns the joint PMF using pairwise marginals that are relatively easy to acquire. The method is built upon nonnegative matrix factorization (NMF) theory, and features a Gram–Schmidt-like economical algorithm that works provably well under realistic conditions. Theoretical analysis of a recently proposed expectation maximization (EM) algorithm for joint PMF recovery is also presented. In particular, the EM algorithm is shown to provably improve upon the proposed pairwise marginal-based approach. Synthetic and real-data experiments are employed to showcase the effectiveness of the proposed approach. 
    more » « less
  4. The integrity of the final printed components is mostly dictated by the adhesion between the particles and phases that form upon solidification, which is a major problem in printing metallic parts using available In-Space Manufacturing (ISM) technologies based on the Fused Deposition Modeling (FDM) methodology. Understanding the melting/solidification process helps increase particle adherence and allows to produce components with greater mechanical integrity. We developed a phase-field model of solidification for binary alloys. The phase-field approach is unique in capturing the microstructure with computationally tractable costs. The developed phase-field model of solidification of binary alloys satisfies the stability conditions at all temperatures. The suggested model is tuned for Ni-Cu alloy feedstocks. We derived the Ginzburg-Landau equations governing the phase transformation kinetics and solved them analytically for the dilute solution. We calculated the concentration profile as a function of interface velocity for a one-dimensional steady-state diffuse interface neglecting elasticity and obtained the partition coefficient, k, as a function of interface velocity. Numerical simulations for the diluted solution are used to study the interface velocity as a function of undercooling for the classic sharp interface model, partitionless solidification, and thin interface. 
    more » « less
  5. null (Ed.)
    While many statistical approaches have tackled the problem of large spa- tial datasets, the issues arising from costly data movement and data stor- age have long been set aside. Having easy access to the data has been taken for granted and is now becoming an important bottleneck in the performance of statistical inference. As the availability of high resolution spatial data continues to grow, the need to develop efficient modeling techniques that leverage multi-processor and multi-storage capabilities is becoming a priority. To that end, the development of a distributed method to implement Nearest-Neighbor Gaussian Process (NNGP) models for spa- tial interpolation and inference for large datasets is of interest. The pro- posed framework retains the exact implementation of the NNGP while allowing for distributed or sequential computation of the posterior infer- ence. The method allows for any choice of grouping of the data whether it is at random or by region. As a result of this new method, the NNGP model can be implemented with an even split of the computation burden with minimum overload at the master node level. 
    more » « less