Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Diffusion problems”

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 217 records · Page 12

Rigid format alter packets for the analysis of electromagnetic field problems

The computer program NASTRAN is used to solve electromagnetic field problems. The diffusion equation and the boundary conditions valid for problems of these kinds together with a replacing potential energy function are given. The extent to which an analogy with finite element displacement and temperature approaches holds is indicated. The outputting of complex quantities is made possible after adjustment of standard rigid format 1 input data blocks to module SDR2. The applications made involve the study of the proximity effect in a system of three parallel conductors and the analysis of the magnetic field in the vicinity of the points of contact in circuit breakers.

Spreeuw, E.↗

Effects of particle drift on cosmic ray transport. II - Analytical solution to the modulation problem with no latitudinal diffusion

An analytical solution to a model of the modulation of galactic cosmic rays in the presence of particle drifts is presented and discussed. The solution assumes an energy-independent radial diffusion coefficient proportional to distance and no latitudinal diffusion, and includes energy-independent particle drift velocities similar to those expected in a Parker spiral magnetic field with an equatorial current sheet. The solutions clearly demonstrate the large effects of drifts on the modulated cosmic-ray intensity. For values of the radial diffusion coefficient and particle drift velocity which are plausible for 1-GV-rigidity protons, the logarithmic radial gradient in the inner solar system is reduced by more than a factor of 5 over the value calculated in the absence of drifts. It is found that even for much smaller values of particle drift velocity and radial diffusion coefficient, such as might be expected for protons with energies of the order of 10 MeV, the effects of the drifts can be substantial.

Isenberg, P. A.↗

Non-oscillatory and non-diffusive solution of convection problems by the iteratively reweighted least-squares finite element method

A comparative description is presented for the least-squares FEM (LSFEM) for 2D steady-state pure convection problems. In addition to exhibiting better control of the streamline derivative than the streamline upwinding Petrov-Galerkin method, numerical convergence rates are obtained which show the LSFEM to be virtually optimal. The LSFEM is used as a framework for an iteratively reweighted LSFEM yielding nonoscillatory and nondiffusive solutions for problems with contact discontinuities; this method is shown to convect contact discontinuities without error when using triangular and bilinear elements.

Jiang, Bo-Nan↗

The SMM Model as a Boundary Value Problem Using the Discrete Diffusion Equation

A generalized single step stepwise mutation model (SMM) is developed that takes into account an arbitrary initial state to a certain partial difference equation. This is solved in both the approximate continuum limit and the more exact discrete form. A time evolution model is developed for Y DNA or mtDNA that takes into account the reflective boundary modeling minimum microsatellite length and the original difference equation. A comparison is made between the more widely known continuum Gaussian model and a discrete model, which is based on modified Bessel functions of the first kind. A correction is made to the SMM model for the probability that two individuals are related that takes into account a reflecting boundary modeling minimum microsatellite length. This method is generalized to take into account the general n-step model and exact solutions are found. A new model is proposed for the step distribution.

Campbell, Joel↗

Diffusion Driven Combustion Waves in Porous Media

Filtration of gas containing oxidizer, to the reaction zone in a porous medium, due, e.g., to a buoyancy force or to an external pressure gradient, leads to the propagation of Filtration combustion (FC) waves. The exothermic reaction occurs between the fuel component of the solid matrix and the oxidizer. In this paper, we analyze the ability of a reaction wave to propagate in a porous medium without the aid of filtration. We find that one possible mechanism of propagation is that the wave is driven by diffusion of oxidizer from the environment. The solution of the combustion problem describing diffusion driven waves is similar to the solution of the Stefan problem describing the propagation of phase transition waves, in that the temperature on the interface between the burned and unburned regions is constant, the combustion wave is described by a similarity solution which is a function of the similarity variable x/square root of(t) and the wave velocity decays as 1/square root of(t). The difference between the two problems is that in the combustion problem the temperature is not prescribed, but rather, is determined as part of the solution. We will show that the length of samples in which such self-sustained combustion waves can occur, must exceed a critical value which strongly depends on the combustion temperature T(sub b). Smaller values of T(sub b) require longer sample lengths for diffusion driven combustion waves to exist. Because of their relatively small velocity, diffusion driven waves are considered to be relevant for the case of low heat losses, which occur for large diameter samples or in microgravity conditions, Another possible mechanism of porous medium combustion describes waves which propagate by consuming the oxidizer initially stored in the pores of the sample. This occurs for abnormally high pressure and gas density. In this case, uniformly propagating planar waves, which are kinetically controlled, can propagate, Diffusion of oxidizer decreases the wave velocity. In addition to the reaction and diffusion layers, the uniformly propagating wave structure includes a layer with a pressure gradient, where the gas motion is induced by the production or consumption of the gas in the reaction as well as by thermal expansion of the gas. The width of this zone determines the scale of the combustion wave in the porous medium.

Aldushin, A. P.↗

Parallelized domain decomposition for multi-dimensional Lagrangian random walk mass-transfer particle tracking schemes

Lagrangian particle tracking schemes allow a wide range of flow and transport processes to be simulated accurately, but a major challenge is numerically implementing the inter-particle interactions in an efficient manner. This article develops a multi-dimensional, parallelized domain decomposition (DDC) strategy for mass-transfer particle tracking (MTPT) methods in which particles exchange mass dynamically. We show that this can be efficiently parallelized by employing large numbers of CPU cores to accelerate run times. In order to validate the approach and our theoretical predictions we focus our efforts on a well-known benchmark problem with pure diffusion, where analytical solutions in any number of dimensions are well established. In this work, we investigate different procedures for “tiling” the domain in two and three dimensions (2-D and 3-D), as this type of formal DDC construction is currently limited to 1-D. An optimal tiling is prescribed based on physical problem parameters and the number of available CPU cores, as each tiling provides distinct results in both accuracy and run time. We further extend the most efficient technique to 3-D for comparison, leading to an analytical discussion of the effect of dimensionality on strategies for implementing DDC schemes. Increasing computational resources (cores) within the DDC method produces a trade-off between inter-node communication and on-node work. For an optimally subdivided diffusion problem, the 2-D parallelized algorithm achieves nearly perfect linear speedup in comparison with the serial run-up to around 2700 cores, reducing a 5 h simulation to 8 s, while the 3-D algorithm maintains appreciable speedup up to 1700 cores.

97 MATHEMATICS AND COMPUTING↗

Model reduction of dynamical systems on nonlinear manifolds using deep convolutional autoencoders

Nearly all model-reduction techniques project the governing equations onto a linear subspace of the original state space. Such subspaces are typically computed using methods such as balanced truncation, rational interpolation, the reduced-basis method, and (balanced) proper orthogonal decomposition (POD). Unfortunately, restricting the state to evolve in a linear subspace imposes a fundamental limitation to the accuracy of the resulting reduced-order model (ROM). In particular, linear-subspace ROMs can be expected to produce low-dimensional models with high accuracy only if the problem admits a fast decaying Kolmogorov n -width (e.g., diffusion-dominated problems). Unfortunately, many problems of interest exhibit a slowly decaying Kolmogorov n-width (e.g., advection-dominated problems). To address this, we propose a novel framework for projecting dynamical systems onto nonlinear manifolds using minimum-residual formulations at the time-continuous and time-discrete levels; the former leads to manifold Galerkin projection, while the latter leads to manifold least-squares Petrov–Galerkin (LSPG) projection. We perform analyses that provide insight into the relationship between these proposed approaches and classical linear-subspace reduced-order models; we also derive a posteriori discrete-time error bounds for the proposed approaches. In addition, we propose a computationally practical approach for computing the nonlinear manifold, which is based on convolutional autoencoders from deep learning. Lastly, we demonstrate the ability of the method to significantly outperform even the optimal linear-subspace ROM on benchmark advection-dominated problems, thereby demonstrating the method's ability to overcome the intrinsic n -width limitations of linear subspaces.

97 MATHEMATICS AND COMPUTING↗

Efficient Space–Time Reduced Order Model for Linear Dynamical Systems in Python Using Less than 120 Lines of Code

A classical reduced order model (ROM) for dynamical problems typically involves only the spatial reduction of a given problem. Recently, a novel space–time ROM for linear dynamical problems has been developed [Choi et al., Space–tume reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems, Journal of Computational Physics, 2020], which further reduces the problem size by introducing a temporal reduction in addition to a spatial reduction without much loss in accuracy. The authors show an order of a thousand speed-up with a relative error of less than 10−5 for a large-scale Boltzmann transport problem. In this work, we present for the first time the derivation of the space–time least-squares Petrov–Galerkin (LSPG) projection for linear dynamical systems and its corresponding block structures. Utilizing these block structures, we demonstrate the ease of construction of the space–time ROM method with two model problems: 2D diffusion and 2D convection diffusion, with and without a linear source term. For each problem, we demonstrate the entire process of generating the full order model (FOM) data, constructing the space–time ROM, and predicting the reduced-order solutions, all in less than 120 lines of Python code. We compare our LSPG method with the traditional Galerkin method and show that the space–time ROMs can achieve O(10−3) to O(10−4) relative errors for these problems. Depending on parameter–separability, online speed-ups may or may not be achieved. For the FOMs with parameter–separability, the space–time ROMs can achieve O(10) online speed-ups. Finally, we present an error analysis for the space–time LSPG projection and derive an error bound, which shows an improvement compared to traditional spatial Galerkin ROM methods.

97 MATHEMATICS AND COMPUTING↗

SUPG stabilization for the nonconforming virtual element method for advection–diffusion–reaction equations

We present here the design, convergence analysis and numerical investigations of the nonconforming virtual element method with Streamline Upwind/Petrov–Galerkin (VEM-SUPG) stabilization for the numerical resolution of convection–diffusion–reaction problems in the convective-dominated regime. According to the virtual discretization approach, the bilinear form is split as the sum of a consistency and a stability term. The consistency term is given by substituting the functions of the virtual space and their gradients with their polynomial projection in each term of the bilinear form (including the SUPG stabilization term). Polynomial projections can be computed exactly from the degrees of freedom. The stability term is also built from the degrees of freedom by ensuring the correct scalability properties with respect to the mesh size and the equation coefficients. The nonconforming formulation relaxes the continuity conditions at cell interfaces and a weaker regularity condition is considered involving polynomial moments of the solution jumps at cell interface. Optimal convergence properties of the method are proved in a suitable norm, which includes contribution from the advective stabilization terms. Experimental results confirm the theoretical convergence rates.

97 MATHEMATICS AND COMPUTING↗

Plasma Diffusion in Self-Consistent Fluctuations

The problem of particle diffusion in position space, as a consequence ofeleclromagnetic fluctuations is addressed. Numerical results obtained with a self-consistent hybrid code are presented, and a method to calculate diffusion coefficient in the direction perpendicular to the mean magnetic field is proposed. The diffusion is estimated for two different types of fluctuations. The first type (resuiting from an agyrotropic in itiai setting)is stationary, wide band white noise, and associated to Gaussian probability distribution function for the magnetic fluctuations. The second type (result ing from a Kelvin-Helmholtz instability) is non-stationary, with a power-law spectrum, and a non-Gaussian probabi lity distribution function. The results of the study allow revisiting the question of loading particles of solar wind origin in the Earth magnetosphere.

Smets, R.↗

Extension of the PINN diffusion model to k-eigenvalue problems

This paper extends our recent work on the Physics-Informed Neural Networks (PINN) approach for the fixed source diffusion models and applies it to the diffusion theory based k-eigenvalue problems. To make the PINN equitable for the eigenvalue problems, we introduce a novel integral regularization term to the loss function in the framework, and allow the direct inference of the principal eigenvalue and the associated eigenfunction. The regularization term enforces a pre-defined value on the integration of the model predictions, and this value can be directly related to a physical property of the system. We also introduce an additional learnable parameter to approximate the principal eigenvalue. As a proof of principle, we solve the one-group two-dimensional k-eigenvalue neutron diffusion equation in this work. We then provide two numerical examples to demonstrate the applicability of the PINN approach. In each example, we solve the k-eigenvalue diffusion equation in a multi-region configuration constrained with a set of Robin boundary conditions for generality. We use a FEM solution based on the power-iteration method to verify the results of the PINN solution. The results showed relative percentage error in the predicted eigenvalue of about 0.77% and about 1.2% for example 1 and example 2, respectively. The mean absolute error in the predicted flux for example 1 is ∼ 0.002 and for example 2 is ∼ 0.0024. These results indicate some preliminary successes of the PINN application to k-eigenvalue problems. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Holographic interferometry of transparent media with reflection from imbedded test objects

In applying holographic interferometry, opaque objects blocking a portion of the optical beam used to form the interferogram give rise to incomplete data for standard computer tomography algorithms. An experimental technique for circumventing the problem of data blocked by opaque objects is presented. The missing data are completed by forming an interferogram using light backscattered from the opaque object, which is assumed to be diffuse. The problem of fringe localization is considered.

Prikryl, I.↗

Planck 2015 results: X. Diffuse component separation: Foreground maps

We report that Planck has mapped the microwave sky in temperature over nine frequency bands between 30 and 857 GHz and in polarization over seven frequency bands between 30 and 353 GHz in polarization. In this paper we consider the problem of diffuse astrophysical component separation, and process these maps within a Bayesian framework to derive an internally consistent set of full-sky astrophysical component maps. Component separation dedicated to cosmic microwave background (CMB) reconstruction is described in a companion paper. For the temperature analysis, we combine the Planck observations with the 9-yr Wilkinson Microwave Anisotropy Probe (WMAP) sky maps and the Haslam et al. 408 MHz map, to derive a joint model of CMB, synchrotron, free-free, spinning dust, CO, line emission in the 94 and 100 GHz channels, and thermal dust emission. Full-sky maps are provided for each component, with an angular resolution varying between 7.5 and 1deg. Global parameters (monopoles, dipoles, relative calibration, and bandpass errors) are fitted jointly with the sky model, and best-fit values are tabulated. For polarization, the model includes CMB, synchrotron, and thermal dust emission. These models provide excellent fits to the observed data, with rms temperature residuals smaller than 4μK over 93% of the sky for all Planck frequencies up to 353 GHz, and fractional errors smaller than 1% in the remaining 7% of the sky. The main limitations of the temperature model at the lower frequencies are internal degeneracies among the spinning dust, free-free, and synchrotron components; additional observations from external low-frequency experiments will be essential to break these degeneracies. The main limitations of the temperature model at the higher frequencies are uncertainties in the 545 and 857 GHz calibration and zero-points. For polarization, the main outstanding issues are instrumental systematics in the 100–353 GHz bands on large angular scales in the form of temperature-to-polarization leakage, uncertainties in the analogue-to-digital conversion, and corrections for the very long time constant of the bolometer detectors, all of which are expected to improve in the near future.

79 ASTRONOMY AND ASTROPHYSICS↗

Resolution of a few problems in the application of quasilinear theory to calculating diffusion coefficients in heliophysics [Slides]

Three problems with the historical literature were discussed. Kennel and Engelmann (1966): ‘notational error’ that implies that diffusion coefficients depend on the distribution of wave power with respect to ψ. This dependence is unphysical and is not present in Lyons+ 1971. Kennel and Engelmann (1966) assume that only a single frequency can be associated with each wave vector: not necessarily true for EMIC, e.g. Lyons (1974a, 1974b) incorrectly used the Jacobian to relate the power spectral density in (ω,χ) space to that into (κ ⊥ , κ ∥ space. The correct use of the Jacobian: (1) Eliminates undesirable properties associated with N(ω) : lack of integrability, lack of superposition; and (2) Can produce orders of magnitude changes to the diffusion coefficients, but depends on the wave distribution: bigger effect for more oblique waves, and depends on the plasma parameter: bigger effect for smaller $ω_{pe}/ω_{ce}$.

79 ASTRONOMY AND ASTROPHYSICS↗

Dirichlet absorbing boundary conditions for classical and peridynamic diffusion-type models

Diffusion-type problems in (nearly) unbounded domains play important roles in various fields of fluid dynamics, biology, and materials science. The aim of this paper is to construct accurate absorbing boundary conditions (ABCs) suitable for classical (local) as well as nonlocal peridynamic (PD) diffusion models. The main focus of the present study is on the PD diffusion formulation. The majority of the PD diffusion models proposed so far are applied to bounded domains only. In this study, we propose an effective way to handle unbounded domains both with PD and classical diffusion models. For the former, we employ a meshfree discretization, whereas for the latter the finite element method (FEM) is employed. The proposed ABCs are time-dependent and Dirichlet-type, making the approach easy to implement in the available models. The performance of the approach, in terms of accuracy and stability, is illustrated by numerical examples in 1D, 2D, and 3D.

36 MATERIALS SCIENCE↗

Random element method for numerical modeling of diffusional processes

The random element method is a generalization of the random vortex method that was developed for the numerical modeling of momentum transport processes as expressed in terms of the Navier-Stokes equations. The method is based on the concept that random walk, as exemplified by Brownian motion, is the stochastic manifestation of diffusional processes. The algorithm based on this method is grid-free and does not require the diffusion equation to be discritized over a mesh, it is thus devoid of numerical diffusion associated with finite difference methods. Moreover, the algorithm is self-adaptive in space and explicit in time, resulting in an improved numerical resolution of gradients as well as a simple and efficient computational procedure. The method is applied here to an assortment of problems of diffusion of momentum and energy in one-dimension as well as heat conduction in two-dimensions in order to assess its validity and accuracy. The numerical solutions obtained are found to be in good agreement with exact solution except for a statistical error introduced by using a finite number of elements, the error can be reduced by increasing the number of elements or by using ensemble averaging over a number of solutions.

Ghoniem, A. F.↗

Two-Level Convergence Theory for Multigrid Reduction in Time (MGRIT)

Here we develop a two-grid convergence theory for the parallel-in-time scheme known as multigrid reduction in time (MGRIT), as it is implemented in the open-source package [XBraid: Parallel Multigrid in Time, http://llnl.gov/casc/xbraid]. MGRIT is a scalable and multilevel approach to parallel-in-time simulations that nonintrusively uses existing time-stepping schemes, and in a specific two-level setting it is equivalent to the widely known parareal algorithm. The goal of this paper is twofold. First, we present a two-level MGRIT convergence analysis for linear problems where the spatial discretization matrix can be diagonalized, and then apply this analysis to our two basic model problems, the heat equation and the advection equation. One important assumption is that the coarse and fine time-grid propagators can be diagaonalized by the same set of eigenvectors, which is often the case when the same spatial discretization operator is used on the coarse and fine time grids. In many cases, the MGRIT algorithm is guaranteed to converge, and we demonstrate numerically that the theoretically predicted convergence rates are sharp in practice for our model problems. Second, we explore how the convergence of MGRIT compares to the stability of the chosen time-stepping scheme. In particular, we demonstrate that a stable time-stepping scheme does not necessarily imply convergence of MGRIT, although MGRIT with FCF-relaxation always converges for the diffusion dominated problems considered here.

97 MATHEMATICS AND COMPUTING↗

Extension of modified power method to two-dimensional problems

In this study, the generalized modified power method was extended to two-dimensional problems. A direct application of the method to two-dimensional problems was shown to be unstable when the number of requested eigenmodes is larger than a certain problem dependent number. The root cause of this instability has been identified as the degeneracy of the transfer matrix. In order to resolve this instability, the number of sub-regions for the transfer matrix was increased to be larger than the number of requested eigenmodes; and a new transfer matrix was introduced accordingly which can be calculated by the least square method. The stability of the new method has been successfully demonstrated with a neutron diffusion eigenvalue problem and the 2D C5G7 benchmark problem. - Graphical abstract:.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗