Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Advection 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

Application of conservative finite-difference methods to advection problems

The possibility of applying the most recent conservative and widely applied numerical techniques in gas dynamics to problems encountered in meteorological computations is investigated. Solutions of the advection equation are obtained using conservative differencing methods. These results are compared to those obtained by differencing the advection equation directly. The comparison shows that better results are obtained when the conservative form of governing equation is used. In addition, better results are obtained with lower order conservative methods as compared with higher order differencing applied to the advection equation.

Fattahi, B.↗

High-speed compressible flow and other advection-dominated problems of fluid dynamics

Finite element methods are described for modeling high speed compressible flows with strong advection, problems important to aerodynamics. The situations are characterized by high pressure and temperature gradients, transients and the appearance of discontinuities, factors which require mesh refinement during computations. Techniques are developed for temporal and spatial discretization of a model problem. Several observations are made regarding the explicit and implicit features of the calculations, the use of the Lax-Wendroff scheme to produce a mass-matrix for obtaining accurate results for transients, methods of performing stability analyses, and simplification techniques. Examples are provided of solving the nonlinear shallow-water equations and describing compressible flows, particularly transonic flows. Domain splitting is defined for improving the calculations at each time step and in different parts of the flow regime while simultaneously advancing the calculations towards a solution.

Zienkiewicz, O. C.↗

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↗

Constrained Local Approximate Ideal Restriction for Advection-Diffusion Problems

Herein this paper focuses on developing a reduction-based algebraic multigrid (AMG) method that is suitable for solving general (non)symmetric linear systems and is naturally robust from pure advection to pure diffusion. Initial motivation comes from a new reduction-based AMG approach, $\ell \text{AIR}$ (local approximate ideal restriction), that was developed for solving advection-dominated problems. Though this new solver is very effective in the advection-dominated regime, its performance degrades in cases where diffusion becomes dominant. This is consistent with the fact that in general, reduction-based AMG methods tend to suffer from growth in complexity and/or convergence rates as the problem size is increased, especially for diffusion-dominated problems in two or three dimensions. Motivated by the success of $\ell \text{AIR}$ in the advective regime, our aim in this paper is to generalize the AIR framework with the goal of improving the performance of the solver in diffusion-dominated regimes. To do so, we propose a novel way to combine mode constraints as used commonly in energy-minimization AMG methods with the local approximation of ideal operators used in $\ell \text{AIR}$. The resulting constrained $\ell \text{AIR}$ algorithm is able to achieve fast scalable convergence on advective and diffusive problems. In addition, it is able to achieve standard low complexity hierarchies in the diffusive regime through aggressive coarsening, something that was previously difficult for reduction-based methods.

97 MATHEMATICS AND COMPUTING↗

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↗

Fast Multigrid Reduction-in-Time for Advection via Modified Semi-Lagrangian Coarse-Grid Operators

Many iterative parallel-in-time algorithms have been shown to be highly efficient for diffusion-dominated partial differential equations (PDEs) but are inefficient or even divergent when applied to advection-dominated PDEs. We consider the application of the multigrid reduction-in-time (MGRIT) algorithm to linear advection PDEs. Here, the key to efficient time integration with this method is using a coarse-grid operator that provides a sufficiently accurate approximation to the so-called ideal coarse-grid operator. For certain classes of semi-Lagrangian discretizations, we present a novel semi-Lagrangian-based coarse-grid operator that leads to fast and scalable multilevel time integration of linear advection PDEs. The coarse-grid operator is composed of a semi-Lagrangian discretization followed by a correction term, with the correction designed so that the leading-order truncation error of the composite operator is approximately equal to that of the ideal coarse-grid operator. Parallel results show substantial speed-ups over sequential time integration for variable-wave-speed advection problems in one and two spatial dimensions, and using high-order discretizations up to order five. The proposed approach establishes the first practical method that provides small and scalable MGRIT iteration counts for advection problems.

97 MATHEMATICS AND COMPUTING↗

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↗

Matrix-free subcell residual distribution for Bernstein finite elements: Monolithic limiting

This paper is focused on the aspects of limiting in residual distribution (RD) schemes for high-order finite element approximations to advection problems. Both continuous and discontinuous Galerkin methods are considered in this work. Discrete maximum principles are enforced using algebraic manipulations of element contributions to the global nonlinear system. The required modifications can be carried out without calculating the element matrices and assembling their global counterparts. The components of element vectors associated with the standard Galerkin discretization are manipulated directly using localized subcell weights to achieve optimal accuracy. Low-order nonlinear RD schemes of this kind were originally developed to calculate local extremum diminishing predictors for flux-corrected transport (FCT) algorithms. In the present paper, we incorporate limiters directly into the residual distribution procedure, which makes it applicable to stationary problems and leads to well-posed nonlinear discrete problems. To circumvent the second-order accuracy barrier, the correction factors of monolithic limiting approaches and FCT schemes are adjusted using smoothness sensors based on second derivatives. Finally, the convergence behavior of presented methods is illustrated by numerical studies for two-dimensional test problems.

97 MATHEMATICS AND COMPUTING↗

Latent Space Dynamics Identification

LaSDI is a data-driven physical simulation software that forms a latent space for a given high-fidelity model and discovers a set of ordinary differential equations for the latent space dynamics. It allows a fast and accurate solution process, which is useful for multi-query decision making applications, such as design optimization and uncertainty quantification. The performance of the LaSDI framework is demonstrated on four different problems, i.e., 1D and 2D Burgers equations, nonlinear heat conduction, and radial advection problems. Both linear and nonlinear compression techniques, such as neural network and proper orthogonal decomposition, are used to form a latent space. A concept of local dynamics identification procedure is introduced to enable a parametric model, which enhances the accuracy level over a given parameter space.

Fries, William↗

A numerical treatment of geodynamic viscous flow problems involving the advection of material interfaces

Effective numerical treatment of multicomponent viscous flow problems involving the advection of sharp interfaces between materials of differing physical properties requires correction techniques to prevent spurious diffusion and dispersion. We develop a particular algorithm, based on modern shock-capture techniques, employing a two-step nonlinear method. The first step involves the global application of a high-order upwind scheme to a hyperbolic advection equation used to model the distribution of distinct material components in a flow field. The second step is corrective and involves the application of a global filter designed to remove dispersion errors that result from the advection of discontinuities (e.g., material interfaces) by high-order, minimally dissipative schemes. The filter introduces no additional diffusion error. Nonuniform viscosity across a material interface is allowed for by the implementation of a compositionally weighted-inverse interface viscosity scheme. The combined method approaches the optimal accuracy of modern shock-capture techniques with a minimal increase in computational time and memory. A key advantage of this method is its simplicity to incorporate into preexisting codes be they finite difference, element, or volume of two or three dimensions.

Lenardic, A.↗

LaSDI: Parametric Latent Space Dynamics Identification

Enabling fast and accurate physical simulations with data has become an important area of computational physics to aid in inverse problems, design-optimization, uncertainty quantification, and other various decision-making applications. This paper presents a data-driven framework for parametric latent space dynamics identification procedure that enables fast and accurate simulations. The parametric model is achieved by building a set of local latent space model and designing an interaction among them. An individual local latent space dynamics model achieves accurate solution in a trust region. By letting the set of trust region to cover the whole parameter space, our model shows an increase in accuracy with an increase in training data. Herein we introduce two different types of interaction mechanisms, i.e., point-wise and region-based approach. Both linear and nonlinear data compression techniques are used. We illustrate the framework of Latent Space Dynamics Identification (LaSDI) enable a fast and accurate solution process on various partial differential equations, i.e., Burgers’ equations, radial advection problem, and nonlinear heat conduction problem, achieving 0 (100)x speed-up and 0 (1)% relative error with respect to the corresponding full order models.

97 MATHEMATICS AND COMPUTING↗

High-Fidelity Simulations of Gravity Currents Using a High-Order Finite-Difference Spectral Vanishing Viscosity Approach

This numerical work investigates the potential of a high-order finite-difference spectral vanishing viscosity approach to simulate gravity currents at high Reynolds numbers. The method introduces targeted numerical dissipation at small scales through altering the discretisation of the second derivatives of the viscous terms in the incompressible Navier-Stokes equations to mimic the spectral vanishing viscosity (SVV) operator, originally designed for the regularisation of spectral element method (SEM) solutions of pure advection problems. Using a sixth-order accurate finite-difference scheme, the adoption of the SVV method is straightforward and comes with a negligible additional computational cost. In order to assess the ability of this high-order finite-difference spectral vanishing viscosity approach, we performed large-eddy simulations (LES) of a gravity current in a channelised lock-exchange set-up with our SVV model and with the well-known explicit static and dynamic Smagorinsky sub-grid scale (SGS) models. The obtained data are compared with a direct numerical simulation (DNS) based on more than 800 million mesh nodes, and with experimental measurements. A framework for the energy budget is introduced to investigate the behaviour of the gravity current. First, it is found that the DNS is in good agreement with the experimental data for the evolution of the front location and velocity field as well as for the stirring and mixing inside the gravity current. Secondly, the LES performed with less than 0.4% of the total number of mesh nodes compared to the DNS, can reproduce the main features of the gravity currents, with the SVV model yielding slightly more accurate results. It is also found that the dynamic Smagorinsky model performs better than its static version. For the present study, the static and dynamic Smagorinsky models are 1.8 and 2.5 times more expensive than the SVV model, because the latter does not require the calculation of explicit SGS terms in the Navier-Stokes equations nor spatial filtering operations.

direct numerical simulation↗

The simulation of 3D hypervelocity spallation using a hydrocode PAGOSA with FLIP+MPM

n this work, a hydrocode PAGOSA with FLIP+MPM is presented and exercised to investigate the fracture in ductile material. The merit of PAGOSA with FLIP+MPM to solve the advection problem is first illustrated by a solid piston periodically moving in a sealed tube with air. Furthermore, the ability of PAGOSA with FLIP+MPM to capture the fracture in material is shown by a simple stretching fracture in ductile material. In both of two benchmark problems, the PAGOSA results and analytical solutions are also presented for comparison. Then PAGOSA with FLIP+MPM is used to model complex spall in ductile material, which is a challenging problem in engineering applications. The convergences of PAGOSA with FLIP+MPM—based on both the mesh size and the marker density—are investigated by monitoring free surface velocity. To further show the ability of PAGOSA with FLIP+MPM to predict fracture in ductile material, the numerical results are compared with the experimental results and other published numerical results. Moreover, the effect of the spall parameter in PAGOSA with FLIP+MPM on the numerical simulation is also analyzed by investigating the free surface velocity. Finally, the effects of the peak compressive stress, the tensile strain rate, and the loading rate on the spallation are further investigated. The numerical results show that PAGOSA with FLIP+MPM can improve PAGOSA's performance when applied to predicting fracture in ductile materials, and is robust enough to accurately predict spall fracture in ductile materials.

42 ENGINEERING↗

Hierarchical model reduction driven by a proper orthogonal decomposition for parametrized advection-diffusion-reaction problems

This work combines the Hierarchical Model (HiMod) reduction technique with a standard Proper Orthogonal Decomposition (POD) to solve parametrized partial differential equations for the modeling of advection-diffusion-reaction phenomena in elongated domains (e.g., pipes). This combination leads to what we define as HiPOD model reduction, which merges the reliability of HiMod reduction with the computational efficiency of POD. Two HiPOD techniques are presented and assessed by an extensive numerical verification.

97 MATHEMATICS AND COMPUTING↗

Hierarchical Model Reduction Driven by Machine Learning for Parametric Advection-Diffusion-Reaction Problems in the Presence of Noisy Data

Abstract We propose a new approach to generate a reliable reduced model for a parametric elliptic problem, in the presence of noisy data. The reference model reduction procedure is the directional HiPOD method, which combines Hierarchical Model reduction with a standard Proper Orthogonal Decomposition, according to an offline/online paradigm. In this paper we show that directional HiPOD looses in terms of accuracy when problem data are affected by noise. This is due to the interpolation driving the online phase, since it replicates, by definition, the noise trend. To overcome this limit, we replace interpolation with Machine Learning fitting models which better discriminate relevant physical features in the data from irrelevant unstructured noise. The numerical assessment, although preliminary, confirms the potentialities of the new approach.

97 MATHEMATICS AND COMPUTING↗