Search NASA⌕ Search

SEARCH · Search NASA

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

A Test Problem for Codes Solving the Discretized Diffusion Equation in Cartesian Geometry Derived Via Discrete Green’s Functions

We obtain here a solution to a zone-centered discretization of the one dimensional time-dependent diffusion equation with arbitrary initial conditions and source, constant absorption and scattering opacity, and constant zone size and time step. The solution is obtained using the discrete Green’s functions of the discretized equation. The solution of the discretized equation is useful in the testing of computer codes, because the code can be expected to agree with the solution to the discrete equation, to within small errors caused by roundoff. This is in contrast to solutions of the differential equation, with which the code results only approximately agree. Finally, the usefulness of the solution for tests of an inertial confinement fusion code is demonstrated.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2000

A Two Colorable Fourth Order Compact Difference Scheme and Parallel Iterative Solution of the 3D Convection Diffusion Equation

A new fourth order compact difference scheme for the three dimensional convection diffusion equation with variable coefficients is presented. The novelty of this new difference scheme is that it Only requires 15 grid points and that it can be decoupled with two colors. The entire computational grid can be updated in two parallel subsweeps with the Gauss-Seidel type iterative method. This is compared with the known 19 point fourth order compact differenCe scheme which requires four colors to decouple the computational grid. Numerical results, with multigrid methods implemented on a shared memory parallel computer, are presented to compare the 15 point and the 19 point fourth order compact schemes.

Zhang, Jun↗
NASA NTRS1995

A deterministic particle method for one-dimensional reaction-diffusion equations

We derive a deterministic particle method for the solution of nonlinear reaction-diffusion equations in one spatial dimension. This deterministic method is an analog of a Monte Carlo method for the solution of these problems that has been previously investigated by the author. The deterministic method leads to the consideration of a system of ordinary differential equations for the positions of suitably defined particles. We then consider the time explicit and implicit methods for this system of ordinary differential equations and we study a Picard and Newton iteration for the solution of the implicit system. Next we solve numerically this system and study the discretization error both analytically and numerically. Numerical computation shows that this deterministic method is automatically adaptive to large gradients in the solution.

Mascagni, Michael↗
NASA NTRS1993

Wave and pseudo-diffusion equations from squeezed states

We show that the probability distributions P(sub n)(q,p;y) := the absolute value squared of (n(p,q;y), which are obtained from squeezed states, obey an interesting partial differential equation, to which we give two intuitive interpretations: as a wave equation in one space dimension; and as a pseudo-diffusion equation. We also study the corresponding Wehrl entropies S(sub n)(y), and we show that they have minima at zero squeezing, y = 0.

Daboul, Jamil↗
NASA NTRS1992

Effective diffusion equation in a random velocity field

The effects are studied of assumed random velocity fields on diffusion in a binary fluid. Random velocity fields can result, for example, from the high-frequency components of residual accelerations onboard spacecraft (often called g-jitter). An effective diffusion equation is derived for an average concentration which includes spatial and temporal correlations induced by the fluctuating velocity fields assumed to be Gaussianly distributed. The resulting equation becomes nonlocal, and if correlations between different components of the velocity field exist, it is also anisotropic. The simple limiting case of short correlation times is discussed and an effective diffusivity is obtained which reflects the enhanced mixing caused by the velocity fields. The results obtained in the limit of short correlation times are valid even if the probability distribution of the velocity field is not Gaussian.

Vinals, Jorge↗
NASA NTRS1987

Numerical methods for one-dimensional reaction-diffusion equations arising in combustion theory

A review of numerical methods for one-dimensional reaction-diffusion equations arising in combustion theory is presented. The methods reviewed include explicit, implicit, quasi-linearization, time linearization, operator-splitting, random walk and finite-element techniques and methods of lines. Adaptive and nonadaptive procedures are also reviewed. These techniques are applied first to solve two model problems which have exact traveling wave solutions with which the numerical results can be compared. This comparison is performed in terms of both the wave profile and computed wave speed. It is shown that the computed wave speed is not a good indicator of the accuracy of a particular method. A fourth-order time-linearized, Hermitian compact operator technique is found to be the most accurate method for a variety of time and space sizes.

Ramos, J. I.↗
NASA NTRS1995

Local multiplicative Schwarz algorithms for convection-diffusion equations

We develop a new class of overlapping Schwarz type algorithms for solving scalar convection-diffusion equations discretized by finite element or finite difference methods. The preconditioners consist of two components, namely, the usual two-level additive Schwarz preconditioner and the sum of some quadratic terms constructed by using products of ordered neighboring subdomain preconditioners. The ordering of the subdomain preconditioners is determined by considering the direction of the flow. We prove that the algorithms are optimal in the sense that the convergence rates are independent of the mesh size, as well as the number of subdomains. We show by numerical examples that the new algorithms are less sensitive to the direction of the flow than either the classical multiplicative Schwarz algorithms, and converge faster than the additive Schwarz algorithms. Thus, the new algorithms are more suitable for fluid flow applications than the classical additive or multiplicative Schwarz algorithms.

Cai, Xiao-Chuan↗
NASA NTRS1989

Compact finite volume methods for the diffusion equation

An approach to treating initial-boundary value problems by finite volume methods is described, in which the parallel between differential and difference arguments is closely maintained. By using intrinsic geometrical properties of the volume elements, it is possible to describe discrete versions of the div, curl, and grad operators which lead, using summation-by-parts techniques, to familiar energy equations as well as the div curl = 0 and curl grad = 0 identities. For the diffusion equation, these operators describe compact schemes whose convergence is assured by the energy equations and which yield both the potential and the flux vector with second order accuracy. A simplified potential form is especially useful for obtaining numerical results by multigrid and alternating direction implicit (ADI) methods. The treatment of general curvilinear coordinates is shown to result from a specialization of these general results.

Rose, Milton E.↗
NASA NTRS1989

Compact finite volume methods for the diffusion equation

The paper describes an approach to treating initial-boundary-value problems by finite volume methods in which the parallel between differential and difference arguments is closely maintained. By using intrinsic geometrical properties of the volume elements, it is possible to describe discrete versions of the div, curl, and grad operators which lead, using summation-by-parts techniques, to familiar energy equations as well as the div curl = 0 and curl grad = 0 identities. For the diffusion equation, these operators describe compact schemes whose convergence is assured by the energy equations and which yield both the potential and the flux vector with second-order accuracy. A simplified potential form is especially useful for obtaining numerical results by multigrid and ADI methods.

Rose, Milton E.↗
NASA NTRS2014

A Radiation Chemistry Code Based on the Greens Functions of the Diffusion Equation

Ionizing radiation produces several radiolytic species such as.OH, e-aq, and H. when interacting with biological matter. Following their creation, radiolytic species diffuse and chemically react with biological molecules such as DNA. Despite years of research, many questions on the DNA damage by ionizing radiation remains, notably on the indirect effect, i.e. the damage resulting from the reactions of the radiolytic species with DNA. To simulate DNA damage by ionizing radiation, we are developing a step-by-step radiation chemistry code that is based on the Green's functions of the diffusion equation (GFDE), which is able to follow the trajectories of all particles and their reactions with time. In the recent years, simulations based on the GFDE have been used extensively in biochemistry, notably to simulate biochemical networks in time and space and are often used as the "gold standard" to validate diffusion-reaction theories. The exact GFDE for partially diffusion-controlled reactions is difficult to use because of its complex form. Therefore, the radial Green's function, which is much simpler, is often used. Hence, much effort has been devoted to the sampling of the radial Green's functions, for which we have developed a sampling algorithm This algorithm only yields the inter-particle distance vector length after a time step; the sampling of the deviation angle of the inter-particle vector is not taken into consideration. In this work, we show that the radial distribution is predicted by the exact radial Green's function. We also use a technique developed by Clifford et al. to generate the inter-particle vector deviation angles, knowing the inter-particle vector length before and after a time step. The results are compared with those predicted by the exact GFDE and by the analytical angular functions for free diffusion. This first step in the creation of the radiation chemistry code should help the understanding of the contribution of the indirect effect in the formation of DNA damage and double-strand breaks.

Plante, Ianik↗
NASA NTRS1983

Adaptive grid relocation algorithms for transonic full potential calculations using one-dimensional or two-dimensional diffusion equation

The effect of solution-adaptive grids using an interpolative grid relocation algorithm on two-dimensional transonic full potential flow calculations is studied with extensions to three dimensions in mind. One-dimensional or two-dimensional diffusion equation is solved to obtain the grid density control function for generating adaptive grids. The results of flow solution for NACA-0012 and Gates-Leajet airfoils show a significant improvement of accuracy in the CP distributions. However, further studies are recommended on the questions (1) what information from the initial flow solution should be passed on to the solution-adaptive grid generation scheme, and (2) how to optimize the accuracy of the solution through the use of adaptive grids.

Nakamura, S.↗
NASA NTRS1995

On the Dynamics of Some Discretizations of Convection-Diffusion Equations

Numerical discretizations of differential equations which model physical processes can possess dynamics quite different from that of the equations themselves. Recently the emphasis has been on the the dynamics of numerical discretizations for Ordinary Differential Equations (ODEs). For Partial Differential Equations (PDEs) using a method of lines approach the situation is more complex. First, the spatial discretisation may introduce dynamics not present in the original equations; second, the solution of the resulting system of ODEs is open to the modified dynamics of the ODE solver used. These two effects may interact in a complex manner. In this talk we present some results of our recent work on the dynamics of discretizations of convection-diffusion equations, including those produced using Total Variation Diminishing (TVD) schemes and adaptive grid techniques. A more general overview of the area may be found on our accompanying poster presentation.

Sweby, Peter K.↗
NASA NTRS1984

Multigrid techniques for the numerical solution of the diffusion equation

An accurate numerical solution of diffusion problems containing large local gradients can be obtained with a significant reduction in computational time by using a multigrid computational scheme. The spatial domain is covered with sets of uniform square grids of different sizes. The finer grid patterns overlap the coarse grid patterns. The finite-difference expressions for each grid pattern are solved independently by iterative techniques. Two interpolation methods were used to establish the values of the potential function on the fine grid boundaries with information obtained from the coarse grid solution. The accuracy and computational requirements for solving a test problem by a simple multigrid and a multilevel-multigrid method were compared. The multilevel-multigrid method combined with a Taylor series interpolation scheme was found to be best.

Phillips, R. E.↗
NASA NTRS1976

Periodic solutions to systems of reaction-diffusion equations

Necessary and sufficient conditions are derived for the existence of temporally periodic 'dissipative structure' solutions in weak diffusion with the reaction rate terms dominant in a generic system of reaction-diffusion differential equations. The enumerator index i of the equations denotes the density or concentration of the ith participating molecular or biological species, and D sub i is the diffusivity constant for the ith species while Q sub i (c), an algebraic function of the n-tuple c, expresses the local rate of production of the ith species due to chemical reactions or biological interactions.

Rosen, G.↗
DOE OSTI2025

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

An efficient high-order numerical solver for diffusion equations with strong anisotropy

In this paper, we present an interior penalty discontinuous Galerkin finite element scheme for solving diffusion problems with strong anisotropy arising in magnetized plasmas for fusion applications. Additionally, we demonstrate the accuracy produced by the high-order scheme and develop an efficient preconditioning technique to solve the corresponding linear system, which is robust to the mesh size and anisotropy of the problem. Several numerical tests are provided to validate the accuracy and efficiency of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗