Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Diffusion equation”

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.

At least 163 records · Page 9

Dark Matter-Electron Interactions Alter the Luminosity and Spectral Index of M87

We investigate the possibility that cosmic-ray electron cooling through dark matter-electron scatterings contributes to the low radiative efficiency observed in radio-loud galaxies such as M87. Light dark matter can scatter efficiently off electrons in M87, lowering the observed bolometric luminosity compared to astrophysical expectations. This consideration allows us to probe previously unexplored regions of the parameter space of dark matter-electron interactions. We further model the cosmic-ray electron distribution by numerically solving a diffusion equation along the jet and find that efficient dark matter-electron interactions can induce a flattening of the spectral index at different distances from the central supermassive black hole, in better alignment with radio observations from M87.

Hussein, Abdelaziz [MIT] (ORCID:0000000255608668)↗

Fully quantum algorithm for mesoscale fluid simulations with application to partial differential equations

Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based mesoscale numerical methods can be executed as efficient quantum algorithms due to their statistical features. This approach revises a quantum algorithm for lattice gas automata to reduce classical computations and state preparation at every time step. For this, the algorithm approximates the qubit relative phases and subtracts them at the end of each time step. Phases are evaluated using the iterative phase estimation algorithm and subtracted using single-qubit rotation phase gates. Further, this method optimizes the quantum resource required and makes it more appropriate for near-term quantum hardware. We also demonstrate how the checkerboard deficiency that the D1Q2 scheme presents can be resolved using the D1Q3 scheme. The algorithm is validated by simulating two canonical partial differential equations: the diffusion and Burgers' equations on different quantum simulators. We find good agreement between quantum simulations and classical solutions for the presented algorithm.

97 MATHEMATICS AND COMPUTING↗

Discrete generative diffusion models without stochastic differential equations: A tensor network approach

Diffusion models (DMs) are a class of generative machine learning methods that sample a target distribution by transforming samples of a trivial (often Gaussian) distribution using a learned stochastic differential equation. In standard DMs, this is done by learning a “score function” that reverses the effect of adding diffusive noise to the distribution of interest. Here we consider the generalisation of DMs to lattice systems with discrete degrees of freedom, and where noise is added via Markov chain jump dynamics. We show how to use tensor networks (TNs) to efficiently define and sample such “discrete diffusion models” (DDMs) without explicitly having to solve a stochastic differential equation. We show the following: (i) by parametrising the data and evolution operators as TNs, the denoising dynamics can be represented exactly; (ii) the auto-regressive nature of TNs allows to generate samples efficiently and without bias; (iii) for sampling Boltzmann-like distributions, TNs allow to construct an efficient learning scheme that integrates well with Monte Carlo. We illustrate this approach to study the equilibrium of two models with non-trivial thermodynamics, the d = 1 constrained Fredkin chain and the d = 2 Ising model. Published by the American Physical Society 2025

Causer, Luke (ORCID:0000000194243473)↗

A Second Moment Method for k -Eigenvalue Acceleration with Continuous Diffusion and Discontinuous Transport Discretizations

The second moment method is a linear acceleration technique that couples the transport equation to a diffusion equation with transport-dependent additive closures. The resulting low-order diffusion equation can be discretized independent of the transport discretization, unlike diffusion synthetic acceleration, and is symmetric positive definite, unlike quasidiffusion. While this method has been shown to be comparable to quasidiffusion in iterative performance for fixed source and time-dependent problems, it is largely unexplored as an eigenvalue problem acceleration scheme due to the belief that the resulting inhomogeneous source makes the problem ill posed. Recently, a preliminary feasibility study was performed on the second moment method for eigenvalue problems. The results suggested comparable performance to quasidiffusion and more robust performance than diffusion synthetic acceleration. This work extends the initial study to more realistic reactor problems using state-of-the-art discretization techniques. Finally, the results in this paper show that the second moment method is more computationally efficient than its alternatives on complex reactor problems with unstructured meshes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Hyperbolic Reformulation Approach to Enable Efficient Simulation of Groundwater Flow and Reactive Transport

We apply Cattaneo's relaxation approach to the one-dimensional coupled Boussinesq groundwater flow and advection-diffusion-reaction equations, commonly used in engineering applications to simulate contaminant transport in the subsurface. The diffusion-type governing equations are reformulated as a hyperbolic system, augmented by an equation that can be interpreted as a momentum balance. The hyperbolization enables an efficient unified computation of the primary variable and its gradients, for example piezometric head and unit discharge in the Boussinesq equation. An augmented Roe scheme is used to solve the hyperbolic system. The hyperbolized system of equations is studied in a set of steady state and transient test cases with idealized geometry. These test cases confirm the equivalence of the hyperbolic system to its original formulation. The larger time step size of the hyperbolic equation is verified theoretically by means of a stability analysis and numerically in the test cases. Finally, a reach-scale application of flow and transport across a river meander is considered. This application case shows that the performance of the hyperbolic relaxation approach holds for more realistic groundwater flow and transport problems, relevant to water resources management.

54 ENVIRONMENTAL SCIENCES↗

Numerical Analysis of Liquid Metal MHD Flow and Heat Transfer for Open-Surface Li Divertor in FNSF

Within the ongoing U.S.-based program on the development of liquid metal plasma-facing components, numerical simulations and analyses are performed to address the feasibility of the open-surface Li divertor. In the previous scoping studies (Smolentsev, 2021), heat-removal capabilities of the divertor were assessed using a simplified flow model for a slug-type velocity profile and constant flow thickness. Here, new analyses take into account forces acting on the flowing Li layer. Three reduced-order mathematical models are applied under the conditions of the U.S. Fusion Nuclear Science Facility (FNSF) to access magnetohydrodynamic (MHD) flow development effects, velocity distribution, and surface waves: 1) fully developed MHD flow; 2) quasi-2-D developing MHD flow; and 3) multiphase MHD flow. The obtained results for MHD flows and the surface heat flux computed with the plasma code scrape-off layer plasma simulation for ITER (SOLPS-ITER) are then used as input data to compute the temperature distribution in the divertor by solving the convection–diffusion energy equation.

Smolentsev, Sergey↗

Trap-Assisted Dopant Compensation Prevents Shunting in poly-Si Passivating Interdigitated Back Contact Silicon Solar Cells

Interdigitated back contact (IBC) solar cells achieve the highest efficiencies of single-junction architectures, but complicated patterning of the rear fingers and spreading of dopants during processing inhibit their mainstream adoption due to concerns of shunting between the IBC fingers. One method of simplifying patterning at the rear is by using contact masks combined with plasma-enhanced chemical vapor deposition (PECVD) or ion implantation. However, the intrinsic isolation region becomes contaminated during high-temperature annealing by lateral diffusion of dopants and during masked PECVD by spreading of dopant radicals through region between the mask and the substrate. Despite this contamination, we show through scanning spreading resistance microscopy and Kelvin probe force microscopy that a ~20 µm wide compensating region exists with high enough resistivity to prevent shunting. We model this p-i-n poly-Si system using two simulation models: a simple resistor model considering only the capture of charge carriers by trap defects in poly-Si to reduce the conductivity, and a more refined 1-dimensional finite element model using Poisson’s equation, drift-diffusion equations, and recombination of carriers. Using this model, we show that high defect density significantly decreases the current across the region between the p- and n-type fingers, preventing shunting.

atom probe↗

Optimization of four terminal rear heterojunction GaAs on Si interdigitated back contact tandem solar cells

High-efficiency, four-terminal tandem solar cells composed of thin GaAs films mechanically stacked onto interdigitated back contact silicon solar cells with a glass interlayer are demonstrated. The optimal thickness of the absorber layer of a rear heterojunction GaAs subcell for use in four terminal tandem solar cells was studied. GaAs top cells with absorber layer thicknesses of 1.5, 1.9, 2.3, 2.8, and 3.5 µm were fabricated on glass and mechanically stacked onto interdigitated back-contact Si bottom cells. All tandem cells were found to have efficiencies above 30% under the AM1.5 G spectrum demonstrating a relatively weak sensitivity to thickness in the four-terminal configuration. We found the 2.8 µm absorber layer cell to have the highest top cell and tandem cell efficiency at 26.38% and 32.57%, respectively. Optical modeling with transfer matrix method for the planar top cell and Lambertian light trapping in the textured Si subcell, along with drift-diffusion Hovel equations, were used to show photon recycling enhancement to the effective diffusion length and VOC of the top cell as a result of the low-index glass interlayer.

14 SOLAR ENERGY↗

Discovering a reaction–diffusion model for Alzheimer’s disease by combining PINNs with symbolic regression

Misfolded tau proteins play a critical role in the progression and pathology of Alzheimer's disease. Recent studies suggest that the spatio-temporal pattern of misfolded tau follows a reaction-diffusion type equation. However, the precise mathematical model and parameters that characterize the progression of misfolded protein across the brain remain incompletely understood. Here, we use deep learning and artificial intelligence to discover a mathematical model for the progression of Alzheimer's disease using longitudinal tau positron emission tomography from the Alzheimer's Disease Neuroimaging Initiative database. Specifically, we integrate physics informed neural networks (PINNs) and symbolic regression to discover a reaction-diffusion type partial differential equation for tau protein misfolding and spreading. First, we demonstrate the potential of our model and parameter discovery on synthetic data. Then, we apply our method to discover the best model and parameters to explain tau imaging data from 46 individuals who are likely to develop Alzheimer's disease and 30 healthy controls. Our symbolic regression discovers different misfolding models f(c) for two groups, with a faster misfolding for the Alzheimer's group, f(c) = 0.23c 3 – 1.34c 2 + 1.11c, than for the healthy control group, f(c) = –c 3 + 0.62c 2 + 0.39c. Our results suggest that PINNs, supplemented by symbolic regression, can discover a reaction-diffusion type model to explain misfolded tau protein concentrations in Alzheimer's disease. Furthermore, we expect our study to be the starting point for a more holistic analysis to provide image-based technologies for early diagnosis, and ideally early treatment of neurodegeneration in Alzheimer's disease and possibly other misfolding-protein based neurodegenerative disorders.

60 APPLIED LIFE SCIENCES↗

A computationally-efficient method for flamelet calculations

A new open-source code for the simulation of the diffusion flamelet equations is proposed. Emphasis is placed on using an approximate Jacobian to reduce the computational cost of the matrix operations. Performance of the proposed solvers is tested by performing flamelet calculations with kinetic mechanisms of varying sizes. For the unity Lewis number equations, the present iterative Newton solver using an approximate Jacobian greatly outperforms direct Newton solvers using exact Jacobians. The computation cost scales linearly with the number of species, leading to a reduction in solution times by two orders of magnitude for mechanisms containing thousands of species. The applicability of the Jacobian approximations to the solution of the non-unity Lewis number flamelet equations is assessed. The approximations are generally inadequate to solve the full non-unity Lewis number equations but can be used in some applications depending on the balance of terms in the flamelet equations. As an example, the flamelet solver is applied to the study of sooting tendencies in laminar co-flow diffusion flames where modified non-unity Lewis number flamelet equations, previously shown to accurately reproduce experimentally-measured Yield Sooting Indices (YSI), are solved. Here, the accelerated flamelet solver is well suited for sensitivity analysis and uncertainty quantification with large detailed kinetic mechanisms, tasks for which the computational cost was previously prohibitive.

42 ENGINEERING↗

Neutron diffusion calculation in heterogeneous geometry based on local/global iteration using proper orthogonal decomposition

This study newly proposes a heterogeneous core calculation method based on local/global iteration using proper orthogonal decomposition (POD). By using the singular value decomposition (SVD) and the low-rank approximation, appropriate POD bases for expanding the neutron flux can be obtained from snapshot data of the neutron flux obtained by fine mesh calculations. By projection using the POD bases, the dimension of the target equation (e.g., discretized neutron diffusion equation) can be dramatically reduced. In the proposed method, POD is effectively applied to each single assembly calculation (local calculation). Furthermore, using the local/global iteration, the effective neutron multiplication factor and the neutron flux distribution in the whole core geometry can be obtained by combining the numerical results of the local calculation for each fuel assembly and the global calculation for the whole core. As a feasibility study, the proposed method is applied to a one-dimensional heterogeneous core analysis, and the accuracy is investigated by changing the total number of POD bases. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

PPINN: Parareal physics-informed neural network for time-dependent PDEs

Physics-informed neural networks (PINNs) encode physical conservation laws and prior physical knowledge into the neural networks, ensuring the correct physics is represented accurately while alleviating the need for supervised learning to a great degree. While effective for relatively short-term time integration, when long time integration of the time-dependent PDEs is sought, the time–space domain may become arbitrarily large and hence training of the neural network may become prohibitively expensive. To this end, we develop a parareal physics-informed neural network (PPINN), hence decomposing a long-time problem into many independent short-time problems supervised by an inexpensive/fast coarse-grained (CG) solver. In particular, the serial CG solver is designed to provide approximate predictions of the solution at discrete times, while initiate many fine PINNs simultaneously to correct the solution iteratively. There is a two-fold benefit from training PINNs with small-data sets rather than working on a large-data set directly, i.e., training of individual PINNs with small-data is much faster, while training the fine PINNs can be readily parallelized. Consequently, compared to the original PINN approach, the proposed PPINN approach may achieve a significant speed-up for long-time integration of PDEs, assuming that the CG solver is fast and can provide reasonable predictions of the solution, hence aiding the PPINN solution to converge in just a few iterations. To investigate the PPINN performance on solving time-dependent PDEs, we first apply the PPINN to solve the Burgers equation, and subsequently we apply the PPINN to solve a two-dimensional nonlinear diffusion–reaction equation. Furthermore, our results demonstrate that PPINNs converge in a few iterations with significant speed-ups proportional to the number of time-subdomains employed.

42 ENGINEERING↗

Nonlocal Kernel Network (NKN): a Stable and Resolution-Independent Deep Neural Network.

Neural operators have recently become popular tools for designing solution maps between function spaces in the form of neural networks. Differently from classical scientific machine learning approaches that learn parameters of a known partial differential equation (PDE) for a single instance of the input parameters at a fixed resolution, neural operators approximate the solution map of a family of PDEs [6, 7]. Despite their success, the uses of neural operators are so far restricted to relatively shallow neural networks and confined to learning hidden governing laws. In this work, we propose a novel nonlocal neural operator, which we refer to as nonlocal kernel network (NKN), that is resolution independent, characterized by deep neural networks, and capable of handling a variety of tasks such as learning governing equations and classifying images. Our NKN stems from the interpretation of the neural network as a discrete nonlocal diffusion reaction equation that, in the limit of infinite layers, is equivalent to a parabolic nonlocal equation, whose stability is analyzed via nonlocal vector calculus. The resemblance with integral forms of neural operators allows NKNs to capture long-range dependencies in the feature space, while the continuous treatment of node-to-node interactions makes NKNs resolution independent. The resemblance with neural ODEs, reinterpreted in a nonlocal sense, and the stable network dynamics between layers allow for generalization of NKN’s optimal parameters from shallow to deep networks. This fact enables the use of shallow-to-deep initialization techniques [8]. Our tests show that NKNs outperform baseline methods in both learning governing equations and image classification tasks and generalize well to different resolutions and depths.

97 MATHEMATICS AND COMPUTING↗

Time-dependent water vapor desorption isotherm model of hardened cement paste

Highlights: • Short-term and long-term desorption isotherms of hardened cement paste are reviewed. • Water content at RH depends on both thermodynamic and microstructural equilibria. • An extended GAB equation is proposed to fit the cavitation drop during desorption. • A dynamic time-dependent sorption isotherm model is shown and used for simulations. • Numerical results capture anomalous drying in the same RH as seen experimentally. This study aims to enhance moisture transport modeling by elucidating the so-called anomalous water diffusion in cementitious materials. Water desorption isotherms are measured from samples at various drying stages using techniques with different durations to quantify the impact of the drying duration on the water sorption ability. A single water sorption isotherm does not solely give a relationship between the water content and relative humidity but also represents the state of microstructure. The continuous evolution of a desorption isotherm due to drying-induced microstructural rearrangement is demonstrated. For numerical modeling, the microstructural alteration can be explicitly considered through a dynamic desorption isotherm model, which governs the local thermodynamic equilibrium at the capillary meniscus. This approach is implemented into a multiphase transport code, whose ability to predict drying is validated using literature data. Finally, the effect of prolonged drying on the colloidal nature of the calcium-silicate-hydrate gel is discussed.

36 MATERIALS SCIENCE↗

Nonintrusive projection-based reduced order modeling using stable learned differential operators

Nonintrusive projection-based reduced order models (ROMs) are essential for dynamics prediction in multi-query applications where underlying governing equations are known but the access to the source of the underlying full order model (FOM) is unavailable; that is, FOM is a glass-box. This article proposes a learn-then-project approach for nonintrusive model reduction. In the first step of this approach, high-dimensional stable sparse learned differential operators (S-LDOs) are determined using the generated data. In the second step, the ordinary differential equations, comprising these S-LDOs, are used with suitable dimensionality reduction and low-dimensional subspace projection methods to provide equations for the evolution of reduced states. This approach allows easy integration into the existing intrusive ROM framework to enable nonintrusive model reduction while allowing the use of Petrov–Galerkin projections. The applicability of the proposed approach is demonstrated for Galerkin and LSPG projection-based ROMs through four numerical experiments: 1-D scalar advection, 1-D Burgers, 2-D scalar advection and 1-D scalar advection–diffusion–reaction equations. In conclusion, the results indicate that the proposed nonintrusive ROM strategy provides accurate and stable dynamics prediction.

42 ENGINEERING↗

Manifold Learning-Based Polynomial Chaos Expansions for High-Dimensional Surrogate Models

In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantities of interest of the computational or analytical model. For this purpose, we employ Grassmannian diffusion maps, a two-step nonlinear dimension reduction technique which allows us to reduce the dimensionality of the data and identify meaningful geometric descriptions in a parsimonious and inexpensive manner. Polynomial chaos expansion is then used to construct a mapping between the stochastic input parameters and the diffusion coordinates of the reduced space. An adaptive clustering technique is proposed to identify an optimal number of clusters of points in the latent space. The similarity of points allows us to construct a number of geometric harmonic emulators which are finally utilized as a set of inexpensive pretrained models to perform an inverse map of realizations of latent features to the ambient space and thus perform accurate out-of-sample predictions. Thus, the proposed method acts as an encoder-decoder system which is able to automatically handle very high-dimensional data while simultaneously operating successfully in the small-data regime. The method is demonstrated on two benchmark problems and on a system of advection-diffusion-reaction equations which model a first-order chemical reaction between two species. In all test cases, the proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.

42 ENGINEERING↗

Multilevel Convergence Analysis of Multigrid-Reduction-in-Time

This study presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time-stepping operator, analyzed directly and bounded in the norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time-stepping operator as parameters. The paper concludes with supporting numerical investigations of parabolic (anisotropic diffusion) and hyperbolic (wave equation) model problems. We assess the sharpness of the bounds and the quality of the approximate convergence factors. Observations from these numerical investigations demonstrate the value of the proposed multilevel convergence framework for estimating MGRIT convergence a priori and for the design of a convergent algorithm. We further highlight that observations in the literature are captured by the theory, including that two-level Parareal and multilevel MGRIT with F-relaxation do not yield scalable algorithms and the benefit of a stronger relaxation scheme. An important observation is that with increasing numbers of levels MGRIT convergence deteriorates for the hyperbolic model problem, while constant convergence factors can be achieved for the diffusion equation. The theory also indicates that L-stable Runge--Kutta schemes are more amendable to multilevel parallel-in-time integration with MGRIT than A-stable Runge--Kutta schemes.

97 MATHEMATICS AND COMPUTING↗

Consistent Second Moment Methods with Scalable Linear Solvers for Radiation Transport

Second moment methods (SMMs) are developed that are consistent with the discontinuous Galerkin spatial discretization of the discrete ordinates (or S\(_N\)) transport equations. The low-order (LO) diffusion system of equations is discretized with fully consistent P\(_1\), local discontinuous Galerkin (LDG), and interior penalty (IP) methods. A discrete residual approach is used to derive SMM correction terms that make each of the LO systems consistent with the high-order discretization. We show that the consistent methods are more accurate and have better solution quality than independently discretized LO systems, that they preserve the diffusion limit, and that the LDG and IP consistent SMMs can be scalably solved in parallel on a challenging, multimaterial benchmark problem.

97 MATHEMATICS AND COMPUTING↗