Search NASASearch

SEARCH · Search NASA

Results for “Advection-diffusion equations”

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

Shadowing and the role of small diffusivity in the chaotic advection of scalars

Using techniques from shadowing theory, the solution of the scalar advection-diffusion equation is studied. It is shown that, under certain circumstances, the effect of small scalar diffusivity is to smooth the zero-diffusivity solution by averaging local fine-scaled structure against a Gaussian. The method of study depends on shadowing and thus fails for nonuniformly stretching systems, its failure suggesting the ways in which the effects of asymptotically small molecular diffusion can become nonlocal in chaotic fluid flows.

Klapper, I.

Recent developments in high order K-exact reconstruction on unstructured meshes

This paper presents recent improvements in high-order K-exact reconstruction on unstructured meshes. The new reconstruction procedures are incorporated into a basic upwind finite-volume scheme suitable for solving scalar advection-diffusion equations as well as the Euler and Navier-Stokes equations. Numerical calculations are performed comparing the present method with lower order accurate reconstruction procedures (piecewise constant and piecewise linear) and various competing technologies such as the fluctuation splitting method of Roe (1987) and Deconinck et al. (1992) and a system-variant of the streamline diffusion Petrov-Galerkin method developed by Hansbo (1991) and Hansbo and Johnson (1991). Five test problems are used in the numerical comparisons: scalar circular advection, transonic and supersonic Euler flow, laminar boundary-layer flow, and general compressible Navier-Stokes flow.

Barth, Timothy J.

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

A Stable and Conservative Interface Treatment of Arbitrary Spatial Accuracy

Stable and accurate interface conditions are derived for the linear advection-diffusion equation. The conditions are functionally independent of the spatial order of accuracy and rely only on the form of the discrete operator. We focus on high-order finite-difference operators that satisfy the summation-by-parts (SBP) property. We prove that stability is a natural consequence of the SBP operators used in conjunction with the new boundary conditions. In addition, we show that the interface treatments are conservative. New finite-difference operators of spatial accuracy up to sixth order are constructed: these operators satisfy the SBP property. Finite-difference operators are shown to admit design accuracy (p(sup th)-order global accuracy) when (p - 1)(sup th)-order stencil closures are used near the boundaries if the physical boundary conditions are implemented to at least p(sup th)-order accuracy. Stability and accuracy are demonstrated on the nonlinear Burgers' equation for an twelve-subdomain problem with randomly distributed interfaces.

Carpenter, Mark H.

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

A Parallel Non-Overlapping Domain-Decomposition Algorithm for Compressible Fluid Flow Problems on Triangulated Domains

This paper considers an algebraic preconditioning algorithm for hyperbolic-elliptic fluid flow problems. The algorithm is based on a parallel non-overlapping Schur complement domain-decomposition technique for triangulated domains. In the Schur complement technique, the triangulation is first partitioned into a number of non-overlapping subdomains and interfaces. This suggests a reordering of triangulation vertices which separates subdomain and interface solution unknowns. The reordering induces a natural 2 x 2 block partitioning of the discretization matrix. Exact LU factorization of this block system yields a Schur complement matrix which couples subdomains and the interface together. The remaining sections of this paper present a family of approximate techniques for both constructing and applying the Schur complement as a domain-decomposition preconditioner. The approximate Schur complement serves as an algebraic coarse space operator, thus avoiding the known difficulties associated with the direct formation of a coarse space discretization. In developing Schur complement approximations, particular attention has been given to improving sequential and parallel efficiency of implementations without significantly degrading the quality of the preconditioner. A computer code based on these developments has been tested on the IBM SP2 using MPI message passing protocol. A number of 2-D calculations are presented for both scalar advection-diffusion equations as well as the Euler equations governing compressible fluid flow to demonstrate performance of the preconditioning algorithm.

Barth, Timothy J.

A Hybrid Parallel Preconditioning Algorithm For CFD

A new hybrid preconditioning algorithm will be presented which combines the favorable attributes of incomplete lower-upper (ILU) factorization with the favorable attributes of the approximate inverse method recently advocated by numerous researchers. The quality of the preconditioner is adjustable and can be increased at the cost of additional computation while at the same time the storage required is roughly constant and approximately equal to the storage required for the original matrix. In addition, the preconditioning algorithm suggests an efficient and natural parallel implementation with reduced communication. Sample calculations will be presented for the numerical solution of multi-dimensional advection-diffusion equations. The matrix solver has also been embedded into a Newton algorithm for solving the nonlinear Euler and Navier-Stokes equations governing compressible flow. The full paper will show numerous examples in CFD to demonstrate the efficiency and robustness of the method.

Barth,Timothy J.

Computations of Wall Distances Based on Differential Equations

The use of differential equations such as Eikonal, Hamilton-Jacobi and Poisson for the economical calculation of the nearest wall distance d, which is needed by some turbulence models, is explored. Modifications that could palliate some turbulence-modeling anomalies are also discussed. Economy is of especial value for deforming/adaptive grid problems. For these, ideally, d is repeatedly computed. It is shown that the Eikonal and Hamilton-Jacobi equations can be easy to implement when written in implicit (or iterated) advection and advection-diffusion equation analogous forms, respectively. These, like the Poisson Laplacian term, are commonly occurring in CFD solvers, allowing the re-use of efficient algorithms and code components. The use of the NASA CFL3D CFD program to solve the implicit Eikonal and Hamilton-Jacobi equations is explored. The re-formulated d equations are easy to implement, and are found to have robust convergence. For accurate Eikonal solutions, upwind metric differences are required. The Poisson approach is also found effective, and easiest to implement. Modified distances are not found to affect global outputs such as lift and drag significantly, at least in common situations such as airfoil flows.

Tucker, Paul G.

Basal melt beneath whillans ice stream and ice streams A and C

We have used a recently derived map of the velocity of Whillans Ice Stream and Ice Streams A and C to help estimate basal melt. Temperature was modeled with a simple vertical advection-diffusion equation, 'tuned' to match temperature profiles. We find that most of the melt occurs beneath the tributaries where larger basal shear stresses and thicker ice favors greater melt (e.g., 10-20 mm/yr). The occurrence of basal freezing is predicted beneath much of the ice plains of Ice Stream C and Whillans Ice Stream. Modelled melt rates for when Ice Stream C was active suggest there was just enough melt water generated in its tributaries to balance basal freezing on its ice plain. Net basal melt for Whillans Ice Stream is positive due to smaller basal temperature gradients. Modelled temperatures on Whillans Ice Stream, however, were constrained by a single temperature profile at UpB. Basal temperature gradients for Whillans B1 and Ice Stream A may have conditions more similar to those beneath Ice Streams C and D, in which case, there may not be sufficient melt to sustain motion. This would be consistent with the steady deceleration of Whillans stream over the last few decades.

glaciers ice sheets

Some Experiences with Nonoverlapping Schur Complement Parallel Preconditioning for CFD Calculations

In this work we consider solving matrices which arise from the discretization of advection-diffusion field equations on arbitrary triangulated domains using stabilized numerical methods. The talk will discuss several candidate matrix preconditioning algorithms based on the 2 x 2 block factorization induced by an apriori partitioning of the triangulated domain. Application of the 2 x 2 block preconditioner requires the formation and inversion of the Schur complement submatrix. We consider several strategies for simplifying this task: incomplete Schur complement factorizations, drop tolerance element filling, Schur complement probing, and localized Schur complement inversion. Numerical results will be shown comparing performance and efficiency of these approximations. The matrix preconditioner has also been embedded into a Newton algorithm for solving the nonlinear Euler and Navier-Stokes equations governing compressible flow. The remainder of the talk will show numerous examples in CFD to demonstrate the efficiency and robustness of the techniques.

Barth, Timothy J.

Evaluation of a Multigrid Scheme for the Incompressible Navier-Stokes Equations

A fast multigrid solver for the steady, incompressible Navier-Stokes equations is presented. The multigrid solver is based upon a factorizable discrete scheme for the velocity-pressure form of the Navier-Stokes equations. This scheme correctly distinguishes between the advection-diffusion and elliptic parts of the operator, allowing efficient smoothers to be constructed. To evaluate the multigrid algorithm, solutions are computed for flow over a flat plate, parabola, and a Karman-Trefftz airfoil. Both nonlifting and lifting airfoil flows are considered, with a Reynolds number range of 200 to 800. Convergence and accuracy of the algorithm are discussed. Using Gauss-Seidel line relaxation in alternating directions, multigrid convergence behavior approaching that of O(N) methods is achieved. The computational efficiency of the numerical scheme is compared with that of Runge-Kutta and implicit upwind based multigrid methods.

Swanson, R. C.

High-Order Residual-Distribution Hyperbolic Advection-Diffusion Schemes: 3rd-, 4th-, and 6th-Order

In this paper, spatially high-order Residual-Distribution (RD) schemes using the first-order hyperbolic system method are proposed for general time-dependent advection-diffusion problems. The corresponding second-order time-dependent hyperbolic advection- diffusion scheme was first introduced in [NASA/TM-2014-218175, 2014], where rapid convergences over each physical time step, with typically less than five Newton iterations, were shown. In that method, the time-dependent hyperbolic advection-diffusion system (linear and nonlinear) was discretized by the second-order upwind RD scheme in a unified manner, and the system of implicit-residual-equations was solved efficiently by Newton's method over every physical time step. In this paper, two techniques for the source term discretization are proposed; 1) reformulation of the source terms with their divergence forms, and 2) correction to the trapezoidal rule for the source term discretization. Third-, fourth, and sixth-order RD schemes are then proposed with the above techniques that, relative to the second-order RD scheme, only cost the evaluation of either the first derivative or both the first and the second derivatives of the source terms. A special fourth-order RD scheme is also proposed that is even less computationally expensive than the third-order RD schemes. The second-order Jacobian formulation was used for all the proposed high-order schemes. The numerical results are then presented for both steady and time-dependent linear and nonlinear advection-diffusion problems. It is shown that these newly developed high-order RD schemes are remarkably efficient and capable of producing the solutions and the gradients to the same order of accuracy of the proposed RD schemes with rapid convergence over each physical time step, typically less than ten Newton iterations.

Mazaheri, Alireza R.

An Optimization-Based Coupling of Reduced Order Models with an Efficient Reduced Adjoint Basis Generation Approach

Optimization-based coupling (OBC) is an attractive alternative to traditional Lagrange multiplier approaches in multiple modeling and simulation contexts. However, application of OBC to time-dependent problems has been hindered by the computational cost of finding the stationary points of the associated Lagrangian, which requires primal and adjoint solves. This issue can be mitigated by using OBC in conjunction with computationally efficient reduced order models (ROMs). To demonstrate the potential of this combination, in this paper, we develop an optimization-based ROM-ROM coupling for a transient advection-diffusion transmission problem. We pursue the “optimize-then-reduce” path toward solving the minimization problem at each time step and solve reduced space adjoint system of equations, where the main challenge in this formulation is the generation of adjoint snapshots and reduced bases for the adjoint systems required by the optimizer. One of the main contributions of the paper is a new technique for an efficient adjoint snapshot collection for gradient-based optimizers in the context of optimization-based ROM-ROM couplings. In conclusion, we present numerical studies demonstrating the accuracy of the approach along with comparison between various approaches for selecting a reduced order basis for the adjoint systems, including decay of snapshot energy, average iteration counts, and timings.

coupled problems

Comments on the Diffusive Behavior of Two Upwind Schemes

The diffusive characteristics of two upwind schemes, multi-dimensional fluctuation splitting and locally one-dimensional finite volume, are compared for scalar advection-diffusion problems. Algorithms for the two schemes are developed for node-based data representation on median-dual meshes associated with unstructured triangulations in two spatial dimensions. Four model equations are considered: linear advection, non-linear advection, diffusion, and advection-diffusion. Modular coding is employed to isolate the effects of the two approaches for upwind flux evaluation, allowing for head-to-head accuracy and efficiency comparisons. Both the stability of compressive limiters and the amount of artificial diffusion generated by the schemes is found to be grid-orientation dependent, with the fluctuation splitting scheme producing less artificial diffusion than the finite volume scheme. Convergence rates are compared for the combined advection-diffusion problem, with a speedup of 2.5 seen for fluctuation splitting versus finite volume when solved on the same mesh. However, accurate solutions to problems with small diffusion coefficients can be achieved on coarser meshes using fluctuation splitting rather than finite volume, so that when comparing convergence rates to reach a given accuracy, fluctuation splitting shows a speedup of 29 over finite volume.

Wood, William A.

Transport Equation Based Wall Distance Computations Aimed at Flows With Time-Dependent Geometry

Eikonal, Hamilton-Jacobi and Poisson equations can be used for economical nearest wall distance computation and modification. Economical computations may be especially useful for aeroelastic and adaptive grid problems for which the grid deforms, and the nearest wall distance needs to be repeatedly computed. Modifications are directed at remedying turbulence model defects. For complex grid structures, implementation of the Eikonal and Hamilton-Jacobi approaches is not straightforward. This prohibits their use in industrial CFD solvers. However, both the Eikonal and Hamilton-Jacobi equations can be written in advection and advection-diffusion forms, respectively. These, like the Poisson s Laplacian, are commonly occurring industrial CFD solver elements. Use of the NASA CFL3D code to solve the Eikonal and Hamilton-Jacobi equations in advective-based forms is explored. The advection-based distance equations are found to have robust convergence. Geometries studied include single and two element airfoils, wing body and double delta configurations along with a complex electronics system. It is shown that for Eikonal accuracy, upwind metric differences are required. The Poisson approach is found effective and, since it does not require offset metric evaluations, easiest to implement. The sensitivity of flow solutions to wall distance assumptions is explored. Generally, results are not greatly affected by wall distance traits.

Tucker, Paul G.

Transport Equation Based Wall Distance Computations Aimed at Flows With Time-Dependent Geometry

Eikonal, Hamilton-Jacobi and Poisson equations can be used for economical nearest wall distance computation and modification. Economical computations may be especially useful for aeroelastic and adaptive grid problems for which the grid deforms, and the nearest wall distance needs to be repeatedly computed. Modifications are directed at remedying turbulence model defects. For complex grid structures, implementation of the Eikonal and Hamilton-Jacobi approaches is not straightforward. This prohibits their use in industrial CFD solvers. However, both the Eikonal and Hamilton-Jacobi equations can be written in advection and advection-diffusion forms, respectively. These, like the Poisson's Laplacian, are commonly occurring industrial CFD solver elements. Use of the NASA CFL3D code to solve the Eikonal and Hamilton-Jacobi equations in advective-based forms is explored. The advection-based distance equations are found to have robust convergence. Geometries studied include single and two element airfoils, wing body and double delta configurations along with a complex electronics system. It is shown that for Eikonal accuracy, upwind metric differences are required. The Poisson approach is found effective and, since it does not require offset metric evaluations, easiest to implement. The sensitivity of flow solutions to wall distance assumptions is explored. Generally, results are not greatly affected by wall distance traits.

Tucker, Paul G.

Diffusion Characteristics of Upwind Schemes on Unstructured Triangulations

The diffusive characteristics of two upwind schemes, multi-dimensional fluctuation splitting and dimensionally-split finite volume, are compared for scalar advection-diffusion problems. Algorithms for the two schemes are developed for node-based data representation on median-dual meshes associated with unstructured triangulations in two spatial dimensions. Four model equations are considered: linear advection, non-linear advection, diffusion, and advection-diffusion. Modular coding is employed to isolate the effects of the two approaches for upwind flux evaluation, allowing for head-to-head accuracy and efficiency comparisons. Both the stability of compressive limiters and the amount of artificial diffusion generated by the schemes is found to be grid-orientation dependent, with the fluctuation splitting scheme producing less artificial diffusion than the dimensionally-split finite volume scheme. Convergence rates are compared for the combined advection-diffusion problem, with a speedup of 2-3 seen for fluctuation splitting versus finite volume when solved on the same mesh. However, accurate solutions to problems with small diffusion coefficients can be achieved on coarser meshes using fluctuation splitting rather than finite volume, so that when comparing convergence rates to reach a given accuracy, fluctuation splitting shows a 20-25 speedup over finite volume.

Wood, William A.

Matching Multistage Schemes to Viscous Flow

Multistage, explicit time stepping can be tailored to accelerate convergence for scalar advection-diffusion problems by using optimized multistage coefficients that vary with the local cell Reynolds number. And, when combined with local preconditioning, variable-coefficient multistage schemes for computational fluid dynamics codes can also provide an order of magnitude faster convergence, relative to standard, fixed-coefficient schemes, for the Navier-Stokes system of equations.

Kleb, William L.