Search NASASearch

Engineering topics

Huan, Xun

Publications and source records attributed to Huan, Xun.

Understanding Process–Structure Relationships during Lamination of Halide Perovskite Interfaces

Fabrication of halide perovskite (HP) solar cells typically involves the sequential deposition of multiple layers to create a device stack, which is limited by the thermal and chemical incompatibility of top contact layers with the underlying HP semiconductor. One emerging strategy to overcome these restrictions on material selection and processing conditions is lamination, where two half-stacks are independently processed and then diffusion bonded to complete the device. Lamination reduces the processing constraints on the top side of the solar cell to allow new device designs, expanded use of deposition methods, and self-encapsulation of devices. While laminated perovskite solar cells with high efficiencies and novel interlayer combinations have been demonstrated, there is a limited understanding of how the lamination process parameters affect the diffusion-bond quality and material properties of the resulting HP layer. In this study, we systematically vary temperature, pressure, and time during lamination and quantify the resulting impacts on bonded area, grain domain size, and photoluminescence. A design of experiments is performed, and statistical analysis of the experimental results is used to quantitatively evaluate the resulting process–structure–property relationships. The lamination temperature is found to be the key parameter controlling these properties. Furthermore, a temperature of 150 °C enables successful bonding over 95% of the substrate area and also results in increases in apparent grain domain size and photoluminescence intensity. Based on these insights, the lamination temperature of functional perovskite solar cell devices is varied, demonstrating the importance of the resulting bond quality on device performance metrics.

14 SOLAR ENERGY

Optimal experimental design: Formulations and computations

Questions of ‘how best to acquire data’ are essential to modelling and prediction in the natural and social sciences, engineering applications, and beyond. Optimal experimental design (OED) formalizes these questions and creates computational methods to answer them. This article presents a systematic survey of modern OED, from its foundations in classical design theory to current research involving OED for complex models. We begin by reviewing criteria used to formulate an OED problem and thus to encode the goal of performing an experiment. We emphasize the flexibility of the Bayesian and decision-theoretic approach, which encompasses information-based criteria that are well-suited to nonlinear and non-Gaussian statistical models. We then discuss methods for estimating or bounding the values of these design criteria; this endeavour can be quite challenging due to strong nonlinearities, high parameter dimension, large per-sample costs, or settings where the model is implicit. A complementary set of computational issues involves optimization methods used to find a design; we discuss such methods in the discrete (combinatorial) setting of observation selection and in settings where an exact design can be continuously parametrized. Finally we present emerging methods for sequential OED that build non-myopic design policies, rather than explicit designs; these methods naturally adapt to the outcomes of past experiments in proposing new experiments, while seeking coordination among all experiments to be performed. Throughout, we highlight important open questions and challenges.

97 MATHEMATICS AND COMPUTING

Uncertainty quantification of graph convolution neural network models of evolving processes

The application of neural network models to scientific machine learning tasks has proliferated in recent years. In particular, neural networks have proved to be adept at modeling processes with spatial–temporal complexity. Nevertheless, these highly parameterized models have garnered skepticism in their ability to produce outputs with quantified error bounds over the regimes of interest. Hence there is a need to find uncertainty quantification methods that are suitable for neural networks. In this work we present comparisons of the parametric uncertainty quantification of neural networks modeling complex spatial–temporal processes with Hamiltonian Monte Carlo and Stein variational gradient descent and its projected variant. Specifically we apply these methods to graph convolutional neural network models of evolving systems modeled with recurrent neural network and neural ordinary differential equations architectures. We show that Stein variational inference is a viable alternative to Monte Carlo methods with some clear advantages for complex neural network models. For our exemplars, Stein variational interference gave similar pushed forward uncertainty profiles through time compared to Hamiltonian Monte Carlo, albeit with generally more generous variance. As a result, projected Stein variational gradient descent also produced similar uncertainty profiles to the non-projected counterpart, but large reductions in the active weight space were confounded by the stability of the neural network predictions and the convoluted likelihood landscape.

36 MATERIALS SCIENCE