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.
The agenda for the presentation is: introduction and overview; method description; Hydrodynamics problems; LED multi-physics problems; HED multi-physics problems; Kokkos port for ATS-1 and ATS-2; Summary and future work; and, Wrap-up.
Prediction and control of chemical mixing are vital for many scientific areas such as subsurface reactive transport, climate modeling, combustion, epidemiology, and pharmacology. Due to the complex nature of mixing in heterogeneous and anisotropic media, the mathematical models related to this phenomenon are not analytically tractable. Numerical simulations often provide a viable route to predict chemical mixing accurately. However, contemporary modeling approaches for mixing cannot utilize available spatial-temporal data to improve the accuracy of the future prediction and can be compute-intensive, especially when the spatial domain is large and for long-term temporal predictions. To address this knowledge gap, in this work we will present in this paper a deep learning (DL) modeling framework applied to predict the progress of chemical mixing under fast bimolecular reactions. This framework uses convolutional neural networks (CNN) for capturing spatial patterns and long short-term memory (LSTM) networks for forecasting temporal variations in mixing. By careful design of the framework—placement of non-negative constraint on the weights of the CNN and the selection of activation function, the framework ensures non-negativity of the chemical species at all spatial points and for all times. Our DL-based framework is fast, accurate, and requires minimal data for training. The time needed to obtain a forecast using the model is a fraction (≈ O(-6)) of the time needed to obtain the result using a high-fidelity simulation. To achieve an error of 10% (measured using the infinity norm) for capturing local-scale mixing features such as interfacial mixing, only 24% to 32% of the sequence data for model training is required. To achieve the same level of accuracy for capturing global-scale mixing features, the sequence data required for model training is 64% to 70% of the total spatial-temporal data. Hence, the proposed approach—a fast and accurate way to forecast long-time spatial-temporal mixing patterns in heterogeneous and anisotropic media—will be a valuable tool for modeling reactive-transport in a wide range of applications.
SAF is of great interest to the aviation community. In this presentation the NREL team is showcasing the capability developed here at NREL to address challenges in SAF certification and adoption.
The Multiphysics Object Oriented Simulation Environment (MOOSE) [1] is an open-source, parallel finite element framework which provides the foundation for many advanced modeling and simulation tools developed under the Department of Energy (DOE) Nuclear Energy Advanced Modeling and Simulation (NEAMS) Program [2] for the analysis of advanced reactors. The MOOSE framework provides the common foundational capability on which many NEAMS codes for reactor analysis are built. The MOOSE framework also includes several systems to assemble unique workflows and couplingamong MOOSE-based applications. In particular, the MultiApp and Transfer Systems are widely used to assemble different MOOSE-based or MOOSE-wrapped physics applications together to perform loosely or tightly coupled multiphysics simulations. The National Reactor Innovation Center (NRIC) Virtual Test Bed (VTB) [3] hosts publicly available nuclear reactor multiphysics simulation examples which leverage MOOSE’s MultiApp System to meet the modeling needs of different reactor types. The flexibility and robustness of coupling provided by MOOSE permits rapid development of coupled physics models for a wide range of reactor types and events
Tensor Cores have been an important unit to accelerate Fused Matrix Multiplication Accumulation (MMA) in all NVIDIA GPUs since Volta Architecture. To program Tensor Cores, users have to use either legacy wmma APIs or current mma APIs. Legacy wmma APIs are more easy-to-use but can only exploit limited features and power of Tensor Cores. Specifically, wmma APIs support fewer operand shapes and can not leverage the new sparse matrix multiplication feature of the newest Ampere Tensor Cores. However, the performance of current programming interface has not been well explored. Furthermore, the computation numeric behaviors of low-precision floating points (TF32, BF16, and FP16) supported by the newest Ampere Tensor Cores are also mysterious. In this paper, we explore the throughput and latency of current programming APIs. Further, we intuitively study the numeric behaviors of Tensor Cores MMA and profile the intermediate operations including multiplication, addition of inner product, and accumulation. All codes used in this work can be found in https://github.com/sunlex0717/DissectingTensorCores.
Partial differential equations (PDEs) are used, with huge success, to model phenomena arising across all scientific and engineering disciplines. However, across an equally wide swath, there exist situations in which PDE models fail to adequately model observed phenomena or are not the best available model for that purpose. On the other hand, in many situations, nonlocal models that account for interaction occurring at a distance have been shown to more faithfully and effectively model observed phenomena that involve possible singularities and other anomalies. In this article, we consider a generic nonlocal model, beginning with a short review of its definition, the properties of its solution, its mathematical analysis, and specific concrete examples. We then provide extensive discussions about numerical methods, including finite element, finite difference, and spectral methods, for determining approximate solutions of the nonlocal models considered. In that discussion, we pay particular attention to a special class of nonlocal models that are the most widely studied in the literature, namely those involving fractional derivatives. The article ends with brief considerations of several modeling and algorithmic extensions which serve to show the wide applicability of nonlocal modeling.
Code verification is an essential part of credibility analysis for computational models. It assesses whether the mathematical model is implemented correctly into the code and whether the numerical methods behave consistently, and is done before solution verification and validation. Robust guidance for code verification exists in the literature. However, there is no known, concise guide for selecting the approach based on the model form that also presents an overview of the common elements. This document was written to address this gap as an accessible reference for beginning a code-verification effort.
Code verification is an essential part of credibility analysis for computational models. It assesses whether the mathematical model is implemented correctly into the code and whether the numerical methods behave consistently, and is done before solution verification and validation. Robust guidance for code verification exists in the literature. However, there is no known, concise guide for selecting the approach based on the model form that also presents an overview of the common elements. This document was written to address this gap as an accessible reference for beginning a code-verification effort.
Problems with topological uncertainties appear in many fields ranging from nano-device engineering to the design of bridges. In many of such problems, a part of the domains boundaries is subjected to random perturbations making inefficient conventional schemes that rely on discretization of the whole domain. Here, we study elliptic PDEs in domains with boundaries comprised of a deterministic part and random apertures, and apply the method of modified potentials with Green’s kernels defined on the deterministic part of the domain. This approach allows to reduce the dimension of the original differential problem by reformulating it as a boundary integral equation posed on the random apertures only. The multilevel Monte Carlo method is then applied to this modified integral equation and its optimal ϵ -2 asymptotical complexity is shown. Finally, we provide the qualitative analysis of the proposed technique and support it with numerical results.
Here, we propose a method to couple local and nonlocal diffusion models. By inheriting desirable properties such as patch tests, asymptotic compatibility and unintrusiveness from related splice and optimization-based coupling schemes, it enables the use of weak (or variational) formulations, is computationally efficient and straightforward to implement. We prove well-posedness of the coupling scheme and demonstrate its properties and effectiveness in a variety of numerical examples.
Here, the paper presents data-driven algorithms to estimate in a distributed manner the eigenvalues, right and left eigenvectors of an unknown linear (or linearized) interconnected dynamic system. In particular, the proposed algorithms do not require the identification of the system model in advance before performing the estimation. As a first step, we consider interconnected dynamical system with distinct eigenvalues. The proposed strategy first estimates the eigenvalues using the well-known Prony method. The right and left eigenvectors are then estimated by solving distributively a set of linear equations. One important feature of the proposed algorithms is that the topology of communication network used to perform the distributed estimation can be chosen arbitrarily, given that it is connected, and is also independent of the structure or sparsity of the system (state) matrix. The proposed distributed algorithms are demonstrated via a numerical example.
In this work, we consider parametrized problems driven by spatially nonlocal integral operators with parameter-dependent kernels. In particular, kernels with varying nonlocal interaction radius $\delta > 0$ and fractional Laplace kernels, parametrized by the fractional power $s\in(0,1)$, are studied. Furthermore, in order to provide an efficient and reliable approximation of the solution for different values of the parameters, we develop the reduced basis method as a parametric model order reduction approach. Major difficulties arise since the kernels are not affine in the parameters, singular, and discontinuous. Moreover, the spatial regularity of the solutions depends on the varying fractional power $s$. To address this, we derive regularity and differentiability results with respect to $\delta$ and $s$, which are of independent interest for other applications such as optimization and parameter identification. We then use these results to construct affine approximations of the kernels by local polynomials. Finally, we certify the method by providing reliable a posteriori error estimators, which account for all approximation errors, and support the theoretical findings by numerical experiments.
In this work, we consider the integral definition of the fractional Laplacian and analyze a linear-quadratic optimal control problem for the so-called fractional heat equation; control constraints are also considered. We derive existence and uniqueness results, first order optimality conditions, and regularity estimates for the optimal variables. To discretize the state equation we propose a fully discrete scheme that relies on an implicit finite difference discretization in time combined with a piecewise linear finite element discretization in space. We derive stability results and a novel $L^2(0,T;L^2(\Omega))$ a priori error estimate. On the basis of the aforementioned solution technique, we propose a fully discrete scheme for our optimal control problem that discretizes the control variable with piecewise constant functions, and we derive a priori error estimates for it. We illustrate the theory with one- and two-dimensional numerical experiments.
Many functions of interest are in a high-dimensional space but exhibit low-dimensional structures. This paper studies regression of an s-Hölder function in $R^D$ which varies along a central subspace of dimension $d$ while $d \ll D$. A direct approximation of $f$ in $R^D$ with an accuracy $\varepsilon$ requires the number of samples in the order of $\varepsilon^{-(2s+D)/s}$. In this paper, we analyze the generalized contour regression (GCR) algorithm for the estimation of the central subspace and use piecewise polynomials for function approximation. GCR is among the best estimators for the central subspace, but its sample complexity is an open question. In this paper, we partially answer this questions by proving that if a variance quantity is exactly known, GCR leads to a mean squared estimation error of $O(n^{-1})$ for the central subspace. The estimation error of this variance quantity is also given in this paper. The mean squared regression error of $f$ is proved to be in the order of $(n/\log n)^{-\frac{2s}{2s+d}}$, where the exponent depends on the dimension of the central subspace instead of the ambient space . This result demonstrates that GCR is effective in learning the low-dimensional central subspace. We also propose a modified GCR with improved efficiency. Here, the convergence rate is validated through several numerical experiments.
Numerical integration is a basic step in the implementation of more complex numerical algorithms suitable, for example, to solve ordinary and partial differential equations. The straightforward extension of a one-dimensional integration rule to a multidimensional grid by the tensor product of the spatial directions is deemed to be practically infeasible beyond a relatively small number of dimensions, e.g., three or four. In fact, the computational burden in terms of storage and floating point operations scales exponentially with the number of dimensions. This phenomenon is known as the curse of dimensionality and motivated the development of alternative methods such as the Monte Carlo method. The tensor product approach can be very effective for high-dimensional numerical integration if we can resort to an accurate low-rank tensor-train representation of the integrand function. In this work, we discuss this approach and present numerical evidence showing that it is very competitive with the Monte Carlo method in terms of accuracy and computational costs up to several hundredths of dimensions if the integrand function is regular enough and a sufficiently accurate low-rank approximation is available.
Partial differential equations (PDEs) are used with huge success to model phenomena across all scientific and engineering disciplines. However, across an equally wide swath, there exist situations in which PDEs fail to adequately model observed phenomena, or are not the best available model for that purpose. On the other hand, in many situations, nonlocal models that account for interaction occurring at a distance have been shown to more faithfully and effectively model observed phenomena that involve possible singularities and other anomalies. Here, we consider a generic nonlocal model, beginning with a short review of its definition, the properties of its solution, its mathematical analysis and of specific concrete examples. We then provide extensive discussions about numerical methods, including finite element, finite difference and spectral methods, for determining approximate solutions of the nonlocal models considered. In that discussion, we pay particular attention to a special class of nonlocal models that are the most widely studied in the literature, namely those involving fractional derivatives. The article ends with brief considerations of several modelling and algorithmic extensions, which serve to show the wide applicability of nonlocal modelling.
The novel heat exchanger (HX) designs implementing geometrical and surface modification combinations are expected to perform better than traditional HX technologies. Applied enhancement techniques seek to achieve (1) higher overall heat transfer performance, (2) increased compactness, and (3) simplified or comparable manufacturability. One innovative enhancement technique is to generate swirling flow vortices induced by channel or tube twisting. The turbulence generated by the twisted cross-section greatly enhances the heat transfer rate with minimal increases in pressure drop. Plate-type HXs and Printed Circuit Heat Exchangers (PCHXs) are compact designs that achieve high heat transfer rates per unit volume by utilizing several small channels, which maximizes the heat transfer surface area between the hot and cold fluids. Currently, advanced manufacturing technologies enable the design and fabrication of compact-type units with complicated channel geometries to achieve the highest performance and meet the compactness criteria of innovative HX technology. The proposed HX design concept combines the compactness of plate-type HXs and twisted channels, which provide additional turbulence and flow swirl enhancement. The plate-type oval-twisted HX (PTOTHX) is a crossflow configuration, with 16 short channels on one side (for hot fluid) and 8 long channels on the perpendicular side (for cold fluid). The inlet plenums have flow guide vanes to redirect flow and produce uniformity across the various flow paths. The compact size and purportedly improved heat transfer performance of the PTOTHX investigated herein prove its viability in various applications. Some notable potential nuclear applications of the PTOTHX include reactor core, spent fuel cooling, and residual heat dissipation. To establish a reference case, circular channels (PTCHX) are also considered in the present study for comparison with (PTOTHX). This paper aims to outline the numerical analysis procedures for determining the viability of the PTOTHX by comparing its heat transfer performance with the PTCHX units. The computational study used STAR-CCM+, a commercial computational fluid dynamics (CFD) code. Sensitivity analysis and model selection studies are conducted to determine the appropriate mesh density and turbulence model to provide the reported results. Numerical analyses comparing the Nusselt number (Nu) of the PTOTHX design with a comparable HX unit, including a circular cross-section and no twisting (PTCHX), show an overall heat transfer performance increase of 29-55% for balanced flow and 29-59% for imbalanced flow. Oval-cross-sectional twisted channels induce swirling flow vortices, enhancing the working fluid's convective heat transfer capabilities.
The galvanostatic intermittent titration technique (GITT), introduced in 1977 by Weppner and Huggins, provided a readily accessible means to measuring the chemical diffusion coefficient of electrochemical electrode materials. The method continues to be widely used today, but the reported diffusivity values are highly inconsistent, ranging as much as four orders of magnitude for some Li layered oxide compositions. Even qualitative trends of diffusivity are inconsistent, suggesting significant flaws in the implementation of the method. Other variants of the GITT method also suffer from similar inconsistency problems. Here we identify numerous sources of significant error including composition-dependent reaction overpotentials, mathematical flaws in the relaxation analysis methods, finite-size and non-planar geometry effects, inter-particle inhomogeneity issues, early transient effects, and surface area uncertainties. We propose a simple relaxation analysis scheme using the time variable t relax + τ - t relax , where t relax is relaxation time and τ is the galvanostatic pulse duration. We also propose to use dense diffusion-limited samples to isolate the bulk-diffusion process in the time domain. Chemical diffusivity can be extracted much more reliably with this improved implementation of the GITT method.