SEARCH · Engineering Papers
Results for “Engineering science”
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.
Laser Additive Manufacturing Process Development for Bismuth Telluride Thermoelectric Material
Thermoelectric generators have strong potential for aerospace and aircraft applications. However, traditional manufacturing methods for thermoelectric devices severely limit device adaptability and consequently marketability. Laser powder bed fusion is an additive manufacturing method which shows promising potential for producing thermoelectric devices. Thermoelectric materials pose unique challenges compared to metals because of low thermal conductivity, brittle fracture characteristics, and irregular powder particle morphologies. Herein, we communicate processing procedures to fabricate thermoelectric parts of Bi 2 Te 3 through laser powder bed fusion. In this study, we identify the successful combination of key process parameters—laser power, scan speed, hatch distance, and powder layer thickness—to achieve high-quality parts in terms of density and physical properties, and we demonstrate the impact of process parameter variation on built part quality. While it cannot exclusively determine part quality, the volumetric energy density is a useful guide in deciding process parameters for thermoelectric materials, and the optimal value is between 9 and 11 J/mm 3 for Bi 2 Te 3 . We demonstrate successful fabrication of different freeform geometries of Bi 2 Te 3 powders. The results suggest it is possible to extend this method more broadly to other semiconductor materials, including thermoelectric power generation materials applicable for space applications.
Material Goals Towards Equity Along the STEM and LGBTQIA+ Spectra
Materials Science and Engineering (MSE) is an exciting interdisciplinary field that promises to secure an understanding of materials underpin technologies that enable modern life. We often champion the properties of the materials we study, we must remember that these advances are afforded by the people ‘behind’ the research and applications. This warrants us to consider the impact of our academic & industrial research climate, and whether there is equal access/support to participate. As such, this article focusses on disparities for members of the LGBTQIA+ (lesbian, gay, bisexual, transgender, queer, intersex, asexual, and more) community. Furthermore, we hope to support actions that create a more equitable community, where there is a sense of inclusion and belonging and power shared amongst LGBTQIA+ and non-LGBTQIA+ identifying individuals.
Pathway to Decarbonization Through Industrial Energy Efficiency: Micro and Macro Perspectives from Compressed Air Usage
Abstract Energy audits directly provided the industrial sector with reduced energy costs and avoided emissions. Still, they also lead to far-reaching indirect and induced local, regional, and national benefits. This paper aims to present the techno-economic-environmental analysis to achieve decarbonization through implementing industrial energy efficiency at micro and macro levels. An integrated techno-economic-environmental methodology is developed. Case studies of micro-level carbon reduction efforts through industrial energy efficiency technologies are presented. The broader macroeconomic and environmental effects of technology on society are analyzed using data from 206 energy audits of industrial compressed air systems conducted over 13 years. The impacts show that energy-efficient improvements lead to direct cost savings for manufacturers, boost economic activity across sectors, and affect carbon dioxide emissions both short-term and long-term in the region. Given their extensive benefits, energy audits significantly influence policymaking. We devised a methodology to link micro-level energy audit data with macroeconomic and environmental analyses to quantify these cascading benefits. The economic scenario analysis shows that $228 M has been saved from direct industrial energy savings from implementing all compressed air recommendations in the studied periods and the region. In addition, the investment made through manufacturers would create 2,025 jobs and $383 M annually, cascading regional economic impacts. The environmental analysis shows that the regional manufacturers have directly avoided about 2.8 M metric tons of carbon dioxide emissions.
Chapter 4 - Recent Advances in Identification of Differential Equations from Noisy Data: IDENT Review
Differential equations and numerical methods are extensively used to model various real-world phenomena in science and engineering. With modern developments, we aim to find the underlying differential equation from a single observation of time-dependent data. If we assume that the differential equation is a linear combination of various linear and nonlinear differential terms, then the identification problem can be formulated as solving a linear system. The goal then reduces to finding the optimal coefficient vector that best represents the time derivative of the given data. We review some recent works on the identification of differential equations. We find some common themes for the improved accuracy: (i) The formulation of linear system with proper denoising is important, (ii) how to utilize sparsity and model selection to find the correct coefficient support needs careful attention, and (iii) there are ways to improve the coefficient recovery. We present an overview and analysis of recent developments on the topic.
Generalization error guaranteed auto-encoder-based nonlinear model reduction for operator learning
Many physical processes in science and engineering are naturally represented by operators between infinite-dimensional function spaces. The problem of operator learning, in this context, seeks to extract these physical processes from empirical data, which is challenging due to the infinite or high dimensionality of data. An integral component in addressing this challenge is model reduction, which reduces both the data dimensionality and problem size. In this paper, we utilize low-dimensional nonlinear structures in model reduction by investigating Auto-Encoder-based Neural Network (AENet). AENet first learns the latent variables of the input data and then learns the transformation from these latent variables to corresponding output data. Our numerical experiments validate the ability of AENet to accurately learn the solution operator of nonlinear partial differential equations. Furthermore, we establish a mathematical and statistical estimation theory that analyzes the generalization error of AENet. Finally, our theoretical framework shows that the sample complexity of training AENet is intricately tied to the intrinsic dimension of the modeled process, while also demonstrating the robustness of AENet to noise.
Differentiating densities on smooth manifolds
Lebesgue integration of derivatives of strongly-oscillatory functions is a recurring challenge in computational science and engineering. Integration by parts is an effective remedy for huge computational costs associated with Monte Carlo integration schemes. In case of Lebesgue integrals over a smooth manifold, however, integration by parts gives rise to a derivative of the density implied by charts describing the domain manifold. This paper focuses on the computation of that derivative, which we call the density gradient function, on general smooth manifolds. We analytically derive formulas for the density gradient and present examples of manifolds determined by popular differential equation-driven systems. Furthermore, we highlight the significance of the density gradient by demonstrating a numerical example of Monte Carlo integration involving oscillatory integrands.
Theory and numerics of subspace approximation of eigenvalue problems
Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to mitigate the computational burden associated with high-fidelity systems. Furthermore, we provide general error estimates under non-simple eigenvalue conditions, establishing some theoretical foundations for understanding the convergence behavior of subspace approximations. Numerical examples, including problems with one-dimensional to three-dimensional spatial domain and one-dimensional to two-dimensional parameter domain, are presented to demonstrate the efficacy of reduced basis method in handling parametric variations in boundary conditions and coefficient fields to achieve significant computational savings while maintaining high accuracy, making them promising tools for practical applications in large-scale eigenvalue computations.
Partitioned exponential methods for coupled multiphysics systems
Multiphysics problems involving two or more coupled physical phenomena are ubiquitous in science and engineering. This work develops a new partitioned exponential approach for the time integration of multiphysics problems. After a possible semi-discretization in space, the class of problems under consideration is modeled by a system of ordinary differential equations where the right-hand side is a summation of two component functions, each corresponding to a given set of physical processes. The partitioned-exponential methods proposed herein evolve each component of the system via an exponential integrator, and information between partitions is exchanged via coupling terms. Here, the traditional approach to constructing exponential methods, based on the variation-of-constants formula, is not directly applicable to partitioned systems. Rather, our approach to developing new partitioned-exponential families is based on a general-structure additive formulation of the schemes. Two method formulations are considered, one based on a linear-nonlinear splitting of the right hand component functions, and another based on approximate Jacobians. The paper develops classical (non-stiff) order conditions theory for partitioned exponential schemes based on particular families of T-trees and B-series theory. Several practical methods of third order are constructed that extend the Rosenbrock-type and EPIRK families of exponential integrators. Several implementation optimizations specific to the application of these methods to reaction-diffusion systems are also discussed. Numerical experiments reveal that the new partitioned-exponential methods can perform better than traditional unpartitioned exponential methods on some problems.
AutoTandemML: Active Learning Enhanced Tandem Neural Networks for Inverse Design Problems
Inverse design in science and engineering involves determining optimal design parameters that achieve desired performance outcomes, a process often hindered by the complexity and high dimensionality of design spaces, leading to significant computational costs. To tackle this challenge, we propose a novel hybrid approach that combines active learning with Tandem Neural Networks to enhance the efficiency and effectiveness of solving inverse design problems. Active learning allows to selectively sample the most informative data points, reducing the required dataset size without compromising accuracy. We investigate this approach using three benchmark problems: airfoil inverse design, photonic surface inverse design, and scalar boundary condition reconstruction in diffusion partial differential equations. We demonstrate that integrating active learning with Tandem Neural Networks outperforms standard approaches across the benchmark suite, achieving better accuracy with fewer training samples.
Generalized moving least squares vs. radial basis function finite difference methods for approximating surface derivatives
Approximating differential operators defined on two-dimensional surfaces is an important problem that arises in many areas of science and engineering. Over the past ten years, localized meshfree methods based on generalized moving least squares (GMLS) and radial basis function finite differences (RBF-FD) have been shown to be effective for this task as they can give high orders of accuracy at low computational cost, and they can be applied to surfaces defined only by point clouds. However, there have yet to be any studies that perform a direct comparison of these methods for approximating surface differential operators (SDOs). The first purpose of this work is to fill that gap. For this comparison, we focus on an RBF-FD method based on polyharmonic spline kernels and polynomials (PHS+Poly) since they are most closely related to the GMLS method. Additionally, we use a relatively new technique for approximating SDOs with RBF-FD called the tangent plane method since it is simpler than previous techniques and natural to use with PHS+Poly RBF-FD. Further, the second purpose of this work is to relate the tangent plane formulation of SDOs to the local coordinate formulation used in GMLS and to show that they are equivalent when the tangent space to the surface is known exactly. The final purpose is to use ideas from the GMLS SDO formulation to derive a new RBF-FD method for approximating the tangent space for a point cloud surface when it is unknown. For the numerical comparisons of the methods, we examine their convergence rates for approximating the surface gradient, divergence, and Laplacian as the point clouds are refined for various parameter choices. We also compare their efficiency in terms of accuracy per computational cost, both when including and excluding setup costs.
Attack graph-based stochastic modeling approach for enabling cybersecure semiconductor wafer fabrication
Not provided.
Accelerated basis adaptation in homogeneous chaos spaces
Polynomial chaos expansions (PCE) provide an efficient approach to uncertainty quantification (UQ) and have been adapted to diverse applications across the spectrum of science and engineering. For situations involving large stochastic parameterizations, the curse of dimensionality renders PCE-based methods computationally prohibitive. A basis adaptation approach for PCE was proposed by Tipireddy and Ghanem (2014) which transforms the input random variables through an isometry such that sufficient probabilistic characterization of specific quantities of interest (QoI) is concentrated in an algebraic manifold embedded in the linear span of the dominant transformed variables. While quite versatile, that original version of the PCE basis adaptation exhibited slow convergence for a number of problems of practical significance. In the present paper, we propose two novel methods to accelerate the convergence of the original basis adaptation approach, thus expanding its reach while also providing insight into its performance. In the first method, information gained from a pilot PCE representation is used to correct the mean and Gaussian coefficients in the adapted space. By taking advantages of probabilistic information in higher dimensional adaptation gleaned from an initial adaptation, the second method updates the rotation matrix used to identify the dominant transformed variables. In this manner, the new rotation matrix concentrates even more probabilistic information in its first few dimensions. These two method can be combined to achieve even better performance, the combined method is referred to as sequentially optimized adaptation method. Here, the methods are demonstrated on an analytical test function and a model of a space structure with several sub-components and a non-smooth quantity of interest representing the maximum acceleration over time. Both methods achieve accelerated convergence of the basis adaptation approach with negligible additional costs.
Latent map Gaussian processes for mixed variable metamodeling
Gaussian processes (GPs) are ubiquitously used in sciences and engineering as metamodels. Standard GPs, however, can only handle numerical or quantitative variables. Here we introduce latent map Gaussian processes (LMGPs) that inherit the attractive properties of GPs and are also applicable to mixed data which have both quantitative and qualitative inputs. The core idea behind LMGPs is to learn a continuous, low-dimensional latent space or manifold which encodes all qualitative inputs. To learn this manifold, we first assign a unique prior vector representation to each combination of qualitative inputs. We then use a low-rank linear map to project these priors on a manifold that characterizes the posterior representations. As the posteriors are quantitative, they can be directly used in any standard correlation function such as the Gaussian or Matern. Hence, the optimal map and the corresponding manifold, along with other hyperparameters of the correlation function, can be systematically learned via maximum likelihood estimation. Through a wide range of analytic and real-world examples, we demonstrate the advantages of LMGPs over state-of-the-art methods in terms of accuracy and versatility. In particular, we show that LMGPs can handle variable-length inputs, have an explainable neural network interpretation, and provide insights into how qualitative inputs affect the response or interact with each other. We also employ LMGPs in Bayesian optimization and illustrate that they can discover optimal compound compositions more efficiently than conventional methods that convert compositions to qualitative variables via manual featurization.
Time-periodic steady-state solution of fluid-structure interaction and cardiac flow problems through multigrid-reduction-in-time
In this study, a time-periodic MGRIT algorithm is proposed as a means to reduce the time-to-solution of numerical algorithms by exploiting the time periodicity inherent to many applications in science and engineering. The time-periodic MGRIT algorithm is applied to a variety of linear and nonlinear single- and multiphysics problems that are periodic-in-time. It is demonstrated that the proposed parallel-in-time algorithm can obtain the same time-periodic steady-state solution as sequential time-stepping. It is shown that the required number of MGRIT iterations can be estimated a priori and that the new MGRIT variant can significantly and consistently reduce the time-to-solution compared to sequential time-stepping, irrespective of the number of dimensions, linear or nonlinear PDE models, single-physics or coupled problems and the employed computing resources. The numerical experiments demonstrate that the time-periodic MGRIT algorithm enables a greater level of parallelism yielding faster turnaround, and thus, facilitating more complex and more realistic problems to be solved.