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 19 records

First-Order Hyperbolic System Method for Time-Dependent Advection-Diffusion Problems

A time-dependent extension of the first-order hyperbolic system method for advection-diffusion problems is introduced. Diffusive/viscous terms are written and discretized as a hyperbolic system, which recovers the original equation in the steady state. The resulting scheme offers advantages over traditional schemes: a dramatic simplification in the discretization, high-order accuracy in the solution gradients, and orders-of-magnitude convergence acceleration. The hyperbolic advection-diffusion system is discretized by the second-order upwind residual-distribution scheme in a unified manner, and the system of implicit-residual-equations is solved by Newton's method over every physical time step. The numerical results are presented for linear and nonlinear advection-diffusion problems, demonstrating solutions and gradients produced to the same order of accuracy, with rapid convergence over each physical time step, typically less than five Newton iterations.

Mazaheri, Alireza↗

Efficient shallow Ritz method for 1D diffusion problems

This paper studies the shallow Ritz method for solving the one-dimensional diffusion problem. It is shown that the shallow Ritz method improves the order of approximation dramatically for non-smooth problems. To realize this optimal or nearly optimal order of the shallow Ritz approximation, we develop a damped block Newton (dBN) method that alternates between updates of the linear and non-linear parameters. Per each iteration, the linear and the non-linear parameters are updated by exact inversion and one step of a modified, damped Newton method applied to a reduced non-linear system, respectively. The computational cost of each dBN iteration is $\mathcal{O}$(n). Starting with the non-linear parameters as a uniform partition of the interval, numerical experiments show that the dBN is capable of efficiently moving mesh points to nearly optimal locations. In conclusion, to improve the efficiency of the dBN further, we propose an adaptive damped block Newton (AdBN) method by combining the dBN with the adaptive neuron enhancement (ANE) method [28].

Diffusion problems↗

Existence, uniqueness and regularity of a time-periodic probability density distribution arising in a sedimentation-diffusion problem

The sedimentation and diffusion of a nonneutrally buoyant Brownian particle in vertical fluid-filled cylinder of finite length which is instantaneously inverted at regular intervals are investigated analytically. A one-dimensional convective-diffusive equation is derived to describe the temporal and spatial evolution of the probability density; a periodicity condition is formulated; the applicability of Fredholm theory is established; and the parameter-space regions are determined within which the existence and uniqueness of solutions are guaranteed. Numerical results for sample problems are presented graphically and briefly characterized.

Nitsche, Ludwig C.↗

Multigrid approaches to non-linear diffusion problems on unstructured meshes

The efficiency of three multigrid methods for solving highly non-linear diffusion problems on two-dimensional unstructured meshes is examined. The three multigrid methods differ mainly in the manner in which the nonlinearities of the governing equations are handled. These comprise a non-linear full approximation storage (FAS) multigrid method which is used to solve the non-linear equations directly, a linear multigrid method which is used to solve the linear system arising from a Newton linearization of the non-linear system, and a hybrid scheme which is based on a non-linear FAS multigrid scheme, but employs a linear solver on each level as a smoother. Results indicate that all methods are equally effective at converging the non-linear residual in a given number of grid sweeps, but that the linear solver is more efficient in cpu time due to the lower cost of linear versus non-linear grid sweeps.

Mavriplis, Dimitri J.↗

A GPU Accelerated Mixed‐Precision Finite Difference Informed Random Walker (FDiRW) Solver for Strongly Inhomogeneous Diffusion Problems

In nature, many complex multi‐physics coupling problems exhibit significant diffusivity inhomogeneity, where one process occurs several orders of magnitude faster than others temporally. Simulating rapid diffusion alongside slower processes demands intensive computational resources due to the necessity for small time steps. To address these computational challenges, we have developed an efficient numerical solver named Finite Difference informed Random Walker (FDiRW). In this study, we propose a GPU‐accelerated, mixed‐precision configuration for the FDiRW solver to maximize efficiency through GPU multi‐threaded parallel computation and lower precision computation. Numerical evaluation results reveal that the proposed GPU‐accelerated mixed‐precision FDiRW solver can achieve a 117× speedup over the CPU baseline, while an additional 1.75× speedup is achieved by employing lower precision GPU computation. Notably, for large model sizes, the GPU‐accelerated mixed‐precision FDiRW solver demonstrates strong scaling with the number of nodes used in simulation. When simulating radionuclide absorption processes by porous wasteform particles with a medium‐sized model of 192 × 192 × 192, this approach reduces the total computational time to 10 min, enabling the simulation of larger systems with strongly inhomogeneous diffusivity.

97 MATHEMATICS AND COMPUTING↗

A finite difference informed random walker (FDiRW) solver for strongly inhomogeneous diffusion problems

In nature, many complex multi-physics coupling problems exhibit strong diffusivity inhomogeneity. For instance, in the context of radionuclide absorption by porous wasteform materials within a flowing waste stream, the difference of species’ diffusivity in solid and liquid phases spans by 3~8 orders of magnitude. To solve the diffusion equations with strongly inhomogeneous diffusivity, traditional discretization-based methods, such as the Finite Difference Method (FDM), require infinitesimally small time steps (<10 -10 ) as high spatial resolutions are employed in most microstructure evolution processes, leading to prohibitively high computational costs. Here, this work developed an integrated numerical approach (FDiRW: Finite Difference informed Random Walk) to tackle this challenge. The idea is that utilizing the Random Walk concept, the fast diffusion is modeled as a superposition of point source’s solution for a concentration distribution while FDM is used to obtain the point source’s solution at each node. A mesh-coarsening algorithm is developed to generate an exclusive coarse mesh for FDiRW approach to maximize its efficiency. The effectiveness of the coarse mesh-based FDiRW approach is validated by benchmarking Finite Difference solutions. Numerical results demonstrated that FDiRW achieves a remarkable 1000x computational efficiency improvement over FDM while preserving desired accuracy for a medium-sized model of 192 × 192 × 192 grids. Finally, as models scale up, a floating-point operations (PLOPs) analysis of the FDiRW algorithm reveals that its computational complexity grows quadratically in terms of the number of nodes employed in computation.

36 MATERIALS SCIENCE↗

An integral solution to a nonlinear diffusion problem

The generalized Galerkin method (or the method of integral relations) is applied to the type of problem described by quasilinear parabolic equations. As an example the problem of nonlinear transient slab diffusion with a general reservoir boundary condition is worked out. The integral relations are given for an arbitrary number of strips, and solutions using up to seven strips have been obtained in order to investigate the convergence of the method.

Hussaini, M. Y.↗

Application of the space-time conservation element and solution element method to two-dimensional advection-diffusion problems

The existing 2-D alpha-mu scheme and alpha-epsilon scheme based on the method of space-time conservation element and solution element, which were constructed for solving the linear 2-D unsteady advection-diffusion equation and unsteady advection equation, respectively, are tested. Also, the alpha-epsilon scheme is modified to become the V-E scheme for solving the nonlinear 2-D inviscid Burgers equation. Numerical solutions of six test problems are presented in comparison with their exact solutions or numerical solutions obtained by traditional finite-difference or finite-element methods. It is demonstrated that the 2-D alpha-mu, alpha-epsilon, and nu-epsilon schemes can be used to obtain numerical results which are more accurate than those based on some of the traditional methods but without using any artificial tuning in the computation. Similar to the previous 1-D test problems, the high accuracy and simplicity features of the space-time conservation element and solution element method have been revealed again in the present 2-D test results.

Wang, Xiao-Yen↗

Application of the Space-Time Conservation Element and Solution Element Method to One-Dimensional Advection-Diffusion Problems

Test problems are used to examine the performance of several one-dimensional numerical schemes based on the space-time conservation and solution element (CE/SE) method. Investigated in this paper are the CE/SE schemes constructed previously for solving the linear unsteady advection-diffusion equation and the schemes derived here for solving the nonlinear viscous and inviscid Burgers equations. In comparison with the numerical solutions obtained using several traditional finite-difference schemes with similar accuracy, the CE/SE solutions display much lower numerical dissipation and dispersion errors.

Wang, Xiao-Yen↗

Extrapolation techniques applied to matrix methods in neutron diffusion problems

A general matrix method is developed for the solution of characteristic-value problems of the type arising in many physical applications. The scheme employed is essentially that of Gauss and Seidel with appropriate modifications needed to make it applicable to characteristic-value problems. An iterative procedure produces a sequence of estimates to the answer; and extrapolation techniques, based upon previous behavior of iterants, are utilized in speeding convergence. Theoretically sound limits are placed on the magnitude of the extrapolation that may be tolerated. This matrix method is applied to the problem of finding criticality and neutron fluxes in a nuclear reactor with control rods. The two-dimensional finite-difference approximation to the two-group neutron fluxes in a nuclear reactor with control rods. The two-dimensional finite-difference approximation to the two-group neutron-diffusion equations is treated. Results for this example are indicated.

Mccready, Robert R↗

Higher order methods for convection-diffusion problems

This paper applies C1 cubic Hermite polynomials embedded in an orthogonal collocation scheme to the spatial discretization of the unsteady nonlinear Burgers equation as a model of the equations of fluid mechanics. The temporal discretization is carried out by means of either a noniterative finite difference or an iterative finite difference procedure. Results of this method are compared with those of a second-order finite difference scheme and a splined-cubic Taylor's series scheme. Stability limits are derived and the matrix structure of the several schemes are compared.

Murphy, J. D.↗

An adaptive pseudo-spectral method for reaction diffusion problems

The spectral interpolation error was considered for both the Chebyshev pseudo-spectral and Galerkin approximations. A family of functionals I sub r (u), with the property that the maximum norm of the error is bounded by I sub r (u)/J sub r, where r is an integer and J is the degree of the polynomial approximation, was developed. These functionals are used in the adaptive procedure whereby the problem is dynamically transformed to minimize I sub r (u). The number of collocation points is then chosen to maintain a prescribed error bound. The method is illustrated by various examples from combustion problems in one and two dimensions.

Bayliss, A.↗

An adaptive pseudo-spectral method for reaction diffusion problems

The spectral interpolation error was considered for both the Chebyshev pseudo-spectral and Galerkin approximations. A family of functionals I sub r (u), with the property that the maximum norm of the error is bounded by I sub r (u)/J sub r, where r is an integer and J is the degree of the polynomial approximation, was developed. These functionals are used in the adaptive procedure whereby the problem is dynamically transformed to minimize I sub r (u). The number of collocation points is then chosen to maintain a prescribed error bound. The method is illustrated by various examples from combustion problems in one and two dimensions.

Bayliss, A.↗

Application of the Space-Time Conservation Element and Solution Element Method to One-Dimensional Convection-Diffusion Problems

In the space-time conservation element and solution element (CE/SE) method, the independent marching variables used comprise not only the mesh value of the physical dependent variables but also, in contrast to it typical numerical method, the Mesh values of the spatial derivatives of the physical variables The use of the extra marching variables results from the need to construct the two-level explicit and nondissipative schemes which are at the core of the CE/SE development. It also results from the need to minimize the stencil while maintaining accuracy. In this paper using the 1D(sub (alpha)-mu) scheme as an example, the effect of this added complication on consistency, accuracy and operation count is assessed. As part of this effort, an equivalent yet more efficient form of the alpha-mu scheme in which the independent marching variables are the local fluxes tied to each mesh point is introduced. Also, the intriguing relations that exist among the alpha-mu. Leapfrog, and DuFort-Frankel schemes are further explored. In addition, the redundance of the Leapfrog, DUFort-Frankel, and Lax scheme and the remedy for this redundance are discussed. This paper is concluded with the construction and evaluation of a CE/SE solver for the inviscid Burger equation.

Chang, Sin-Chung↗