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.
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
- NSF-PAR ID:
- 10132645
- 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
-
more » « less
Abstract -
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
-
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
-
more » « less
Abstract A key challenge in spatial data science is the analysis for massive spatially‐referenced data sets. Such analyses often proceed from Gaussian process specifications that can produce rich and robust inference, but involve dense covariance matrices that lack computationally exploitable structures. Recent developments in spatial statistics offer a variety of massively scalable approaches. Bayesian inference and hierarchical models, in particular, have gained popularity due to their richness and flexibility in accommodating spatial processes. Our current contribution is to provide computationally efficient exact algorithms for spatial interpolation of massive data sets using scalable spatial processes. We combine low‐rank Gaussian processes with efficient sparse approximations. Following recent work by Zhang et al. (2019), we model the low‐rank process using a Gaussian predictive process (GPP) and the residual process as a sparsity‐inducing nearest‐neighbor Gaussian process (NNGP). A key contribution here is to implement these models using exact conjugate Bayesian modeling to avoid expensive iterative algorithms. Through the simulation studies, we evaluate performance of the proposed approach and the robustness of our models, especially for long range prediction. We implement our approaches for remotely sensed light detection and ranging (LiDAR) data collected over the US Forest Service Tanana Inventory Unit (TIU) in a remote portion of Interior Alaska.
-
Computationally efficient modeling of gas turbine combustion is challenging due to the chaotic multi-scale physics and the complex non-linear interactions between acoustic, hydrodynamic, and chemical processes. A large-eddy simulation (LES) is conducted for the model combustor of Meier et al. (1) using an unstructured mesh finite volume method with turbulent combustion effects modeled using a flamelet-based method. The flow field is validated via comparison to averaged and unsteady high-frequency particle image velocimetry (PIV) fields. A high degree of correlation is noted with the experiment in terms of flow field snapshots and via modal analysis. The dynamics of the precessing vortex core (PVC) is quantitatively characterized using dynamic mode decomposition. The validated FOM dataset is used to construct projection-based ROMs, which aim to reduce the system dimension by projecting the state onto a reduced dimensional linear manifold. The use of a structure-preserving least squares formulation (SP-LSVT) guarantees stability of the ROM, compared to traditional model reduction techniques. The SP-LSVT ROM provides accurate reconstruction of the combustion dynamics within the training region, but faces a significant challenge in future state predictions. This limitation is mainly due to the increased projection error, which in turn is a direct consequence of the highly chaotic nature of the flow field, involving a wide range of disperse coherent structures. Formal projection-based ROMs have not been applied to a problem of this scale and complexity, and achieving accurate and efficient ROMs is a grand challenge problem. Further advances in non-linear manifold projections or adaptive basis projections have the potential to improve the predictive capability of this class of ROMs.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1115/1.4045795
