Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “spatial discretization”

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 91 records · Page 5

Discontinuous Galerkin Finite Element Method for Parabolic Problems

In this paper, we develop a time and its corresponding spatial discretization scheme, based upon the assumption of a certain weak singularity of parallel ut(t) parallel Lz(omega) = parallel ut parallel2, for the discontinuous Galerkin finite element method for one-dimensional parabolic problems. Optimal convergence rates in both time and spatial variables are obtained. A discussion of automatic time-step control method is also included.

Kaneko, Hideaki↗

Effect of Under-Resolved Grids on High Order Methods

There has been much discussion on verification and validation processes for establishing the credibility of CFD simulations. Since the early 1990s, many of the aeronautical and mechanical engineering related reference journals mandated that any accepted articles in numerical simulations (without known solutions to compared with) need to perform a minimum of one level of grid refinement and time step reduction. Due to the difficulty in analysis, the effect of under-resolved grids and the nonlinear behavior of available spatial discretizations, are scarcely discussed in the literature. Here, an under-resolved numerical simulation is one where the grid spacing being used is too coarse to resolve the smallest physically relevant scales of the chosen continuum governing equations that are of interest to the numerical modeler. With the advent of new developments in fourth-order or higher spatial schemes, it has become common to regard high order schemes as more accurate, reliable and require less grid points. The danger comes when one tries to perform computations with the coarsest grid possible while still hoping to maintain numerical results sufficiently accurate for complex flows, and especially, data-limited problems. On one hand, high order methods when applies to highly coupled multidimensional complex nonlinear problems might have different stability, convergence and reliability behavior than their well studied low order counterparts, especially for nonlinear schemes such as TVD, MUSCL with limiters, ENO, WENO and discrete Galerkin. On the other hand, high order methods involve more operation counts and systematic grid convergence study can be time consuming and prohibitively expansive. At the same time it is difficult to fully understand or categorize the different nonlinear behavior of finite discretizations, especially at the limits of under-resolution when different types of bifurcation phenomena might occur, depending on the combination of grid spacings, time steps, initial conditions and numerical treatments of boundary conditions.

Yee, H. C.↗

Computation of Transonic Flows Using Potential Methods

The proposed paper will describe the state of the art associated with numerical solution of the full or exact velocity potential equation for solving transonic, external-aerodynamic flows. The presentation will begin with a review of the literature emphasizing research activities of the past decade. Next, the various forms of the full or exact velocity potential equation, the equation's corresponding mathematical characteristics, and the derivation assumptions will be presented and described in detail. Impact of the derivation assumptions on simulation accuracy, especially with respect to shock wave capture, will be presented and discussed relative to the more complete Euler or Navier-Stokes formulations. The technical presentation will continue with a description of recently developed full potential numerical approach characteristics. This description will include governing equation nondimensionalization, physical-to-computational-domain mapping procedures, a limited description of grid generation requirements, the spatial discretization scheme, numerical implementation of boundary conditions, and the iteration scheme. The next portion of the presentation will present and discuss numerical results for several two- and three-dimensional aerodynamic applications. Included in the results section will be a discussion and demonstration of a typical grid refinement analysis for determining spatial convergence of the numerical solution and level of solution accuracy. Computer timings for a variety of full potential applications will be compared and contrasted with similar results for the Euler equation formulation. Finally. the presentation will end with concluding remarks and recommendations for future work.

Hoist, Terry L.↗

An implicit-explicit time splitting strategy for the far SOL plasma fluid model with DG-FEM discretization

We consider a far scrape-off layer (SOL) plasma fluid model of ions that is governed by a Braginskiitype model: a one-dimensional, nonlinear system of advection-diffusion equations coupled with a diffusion equation for neutral particles. Our motivation for studying this system arises from the coupling between the edge plasma and radio-frequency (RF) heating, where solving a far SOL plasma fluid model provides critical insights into edge plasma dynamics. Numerical simulations of plasma fluid models require advanced computational techniques to achieve both efficiency and accuracy, especially when resolving the boundary layer in magnetically confined plasmas. In this work, we propose an implicit-explicit time operator splitting strategy that allows for an efficient solution algorithm, where the diffusive terms are treated semi-implicitly requiring only a linear solve, while the advection part is handled explicitly using a strong-stability-preserving Runge-Kutta (SSP-RK3) scheme. This leads to a fully decoupled system in which the diffusion and advection sub-problems can be solved separately, simplifying the overall solution procedure and allowing for efficient parallelization, which is particularly relevant for exploring the impact of RF heating on the SOL plasma. The main challenge of the discretization is due to the strong coupling between diffusion and advection, particularly through the boundary conditions. This makes implementation of such a scheme in an accurate and stable manner nontrivial. We discuss in detail how to split the equations and manage boundary conditions to maintain stability and well-posedness for each subsystem. We also describe a spatial discretization approach, based on the discontinuous Galerkin finite element method (DG-FEM) and present numerical results for a one-dimensional system.

Burkovska, Olena [ORNL] (ORCID:0000000163101130)↗

A Discrete Probability Function Method for the Equation of Radiative Transfer

A discrete probability function (DPF) method for the equation of radiative transfer is derived. The DPF is defined as the integral of the probability density function (PDF) over a discrete interval. The derivation allows the evaluation of the PDF of intensities leaving desired radiation paths including turbulence-radiation interactions without the use of computer intensive stochastic methods. The DPF method has a distinct advantage over conventional PDF methods since the creation of a partial differential equation from the equation of transfer is avoided. Further, convergence of all moments of intensity is guaranteed at the basic level of simulation unlike the stochastic method where the number of realizations for convergence of higher order moments increases rapidly. The DPF method is described for a representative path with approximately integral-length scale-sized spatial discretization. The results show good agreement with measurements in a propylene/air flame except for the effects of intermittency resulting from highly correlated realizations. The method can be extended to the treatment of spatial correlations as described in the Appendix. However, information regarding spatial correlations in turbulent flames is needed prior to the execution of this extension.

Sivathanu, Y. R.↗

A solution framework for linear PDE-constrained mixed-integer problems

Abstract We present a general numerical solution method for control problems with state variables defined by a linear PDE over a finite set of binary or continuous control variables. We show empirically that a naive approach that applies a numerical discretization scheme to the PDEs to derive constraints for a mixed-integer linear program (MILP) leads to systems that are too large to be solved with state-of-the-art solvers for MILPs, especially if we desire an accurate approximation of the state variables. Our framework comprises two techniques to mitigate the rise of computation times with increasing discretization level: First, the linear system is solved for a basis of the control space in a preprocessing step. Second, certain constraints are just imposed on demand via the IBM ILOG CPLEX feature of a lazy constraint callback. These techniques are compared with an approach where the relations obtained by the discretization of the continuous constraints are directly included in the MILP. We demonstrate our approach on two examples: modeling of the spread of wildfire and the mitigation of water contamination. In both examples the computational results demonstrate that the solution time is significantly reduced by our methods. In particular, the dependence of the computation time on the size of the spatial discretization of the PDE is significantly reduced.

97 MATHEMATICS AND COMPUTING↗

Simulations of neutron noise in the research reactor AKR-2: comparison between a discrete ordinates and a diffusion-based method

A diffusion-based and a discrete ordinates method are used to simulate a neutron noise experiment in the research reactor AKR-2 at the Technical University in Dresden, Germany. The AKR-2 reactor provides an interesting case for the comparison between the two methods because it is characterized by large heterogeneities and regions with low macroscopic neutron cross-sections. For the calculations, the same spatial discretization and the same set of two-energy macroscopic neutron cross-sections with isotropic scattering are used. Significant discrepancies between the diffusion-based and discrete ordinates methods are found in regions of the systems where the diffusion approximation is expected to be inaccurate in reproducing characteristics of the static neutron flux and neutron noise. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Development of a River Dynamical Core for E3SM to simulate compound flooding on Exascale-class heterogeneous supercomputers

Flooding events pose significant risk to human life, property, and infrastructure. Physically-consistent quantification of altered flood risks in global models requires hyper-resolution (~1 km) or fine flood simulations using two-dimensional (2D) physics schemes, both of which are unavailable in the current generation Earth System Models. Here, in this work, we have developed the River Dynamical Core (RDycore), which is an open-source, 2D shallow water equation (SWE) library for the U.S. Department of Energy's Energy Exascale Earth System Model (E3SM). RDycore uses PETSc and libCEED libraries that allows it to run efficiently on CPUs and GPUs, as well as select a time-integration algorithm at runtime without requiring any code modifications. RDycore achieves spatial error convergence rates for problems with analytical and manufactured solutions similar to those reported previously in the literature, or consistent with the implemented first-order spatial discretization scheme. RDycore's accuracy in predicting flooding for a well-studied dam break problem is comparable to existing SWE models. For a problem with 471 million grid cells, RDycore achieves a speedup of 6.6x and 7.6x on GPUs compared to CPUs when using 320 compute nodes on DOE's Perlmutter and Frontier supercomputers, respectively. The one-way coupling of the RDycore library within E3SM is demonstrated by performing multiple 5-day flooding simulations during Hurricane Harvey driven by five precipitation datasets. The E3SM--RDycore simulations at 30 m spatial resolution accurately simulate maximum water height during the hurricane when benchmarked against a previously published study and achieve a speedup of 15x (Perlmutter) and 21x (Frontier) on GPUs relative to CPUs. The work presented here is the foundational step in providing hardware and algorithmic portability framework for simulating kilometer-scale river dynamics within E3SM.

Flood Simulation↗

Stability of semidiscrete approximations for hyperbolic initial-boundary-value problems: An eigenvalue analysis

A hyperbolic initial-boundary-value problem can be approximated by a system of ordinary differential equations (ODEs) by replacing the spatial derivatives by finite-difference approximations. The resulting system of ODEs is called a semidiscrete approximation. A complication is the fact that more boundary conditions are required for the spatially discrete approximation than are specified for the partial differential equation. Consequently, additional numerical boundary conditions are required and improper treatment of these additional conditions can lead to instability. For a linear initial-boundary-value problem (IBVP) with homogeneous analytical boundary conditions, the semidiscrete approximation results in a system of ODEs of the form du/dt = Au whose solution can be written as u(t) = exp(At)u(O). Lax-Richtmyer stability requires that the matrix norm of exp(At) be uniformly bounded for O less than or = t less than or = T independent of the spatial mesh size. Although the classical Lax-Richtmyer stability definition involves a conventional vector norm, there is no known algebraic test for the uniform boundedness of the matrix norm of exp(At) for hyperbolic IBVPs. An alternative but more complicated stability definition is used in the theory developed by Gustafsson, Kreiss, and Sundstrom (GKS). The two methods are compared.

Warming, Robert F.↗

Scalability of OpenFOAM Density-Based Solver with Runge–Kutta Temporal Discretization Scheme

Compressible density-based solvers are widely used in OpenFOAM, and the parallel scalability of these solvers is crucial for large-scale simulations. In this paper, we report our experiences with the scalability of OpenFOAM’s native rhoCentralFoam solver, and by making a small number of modifications to it, we show the degree to which the scalability of the solver can be improved. The main modification made is to replace the first-order accurate Euler scheme in rhoCentralFoam with a third-order accurate, four-stage Runge-Kutta or RK4 scheme for the time integration. The scaling test we used is the transonic flow over the ONERA M6 wing. This is a common validation test for compressible flows solvers in aerospace and other engineering applications. Numerical experiments show that our modified solver, referred to as rhoCentralRK4Foam, for the same spatial discretization, achieves as much as a 123.2% improvement in scalability over the rhoCentralFoam solver. As expected, the better time resolution of the Runge–Kutta scheme makes it more suitable for unsteady problems such as the Taylor–Green vortex decay where the new solver showed a 50% decrease in the overall time-to-solution compared to rhoCentralFoam to get to the final solution with the same numerical accuracy. Finally, the improved scalability can be traced to the improvement of the computation to communication ratio obtained by substituting the RK4 scheme in place of the Euler scheme. All numerical tests were conducted on a Cray XC40 parallel system, Theta, at Argonne National Laboratory.

Li, Sibo↗

Sensitivity analysis for the dynamic response of viscoplastic shells of revolution

A computational procedure is presented for evaluating the sensitivity coefficients of the dynamic axisymmetric response of viscoplastic shells of revolution. The analytical formulation is based on Reissner's large deformation shell theory with the effects of transverse shear deformation, rotatory inertia and moments turning around the normal to the middle surface included. The material model is chosen to be isothermal viscoplasticity, and an associated flow rule is used with a von Mises effective stress. A mixed formulation is used with the fundamental unknowns consisting of six stress resultants, three generalized displacements and three velocity components. Spatial discretization is performed using finite elements, with discontinuous stress resultants across element interfaces. The temporal integration is performed by using an explicit central difference scheme (leap-frog method) with an implicit constitutive update. The sensitivity coefficients are evaluated using a direct differentiation approach. Numerical results are presented for a spherical cap subjected to step loading, and a circular plate subjected to impulsive loading. The sensitivity coefficients are generated by evaluating the derivatives of the response quantities with respect to thickness, mass density, Young's modulus, and two of the material parameters characterizing the viscoplastic response. Time histories of the response and sensitivity coefficients are presented, along with spatial distributions of these quantities at selected times.

Kulkarni, Makarand↗

Entropy Stable h/p-Nonconforming Discretization with the Summation-by-Parts Property for the Compressible Euler and Navier–Stokes Equations

In this paper, we extend the entropy conservative/stable algorithms presented by Del Rey Fernandez and coauthors for the compressible Euler and Navier-Stokes equations on nonconforming p-refined/coarsened curvilinear grids to h/p refinement/coarsening. The main difficulty in developing nonconforming algorithms is the construction of appropriate coupling procedures across nonconforming interfaces. Here, we utilize a computationally simple and efficient approach based upon using decoupled interpolation operators. The resulting scheme is entropy conservative/stable and elementwise conservative. Numerical simulations of the isentropic vortex and viscous shock propagation con firm the entropy conservation/stability and accuracy properties of the method (achieving ~ p + 1 convergence), which are comparable to those of the original conforming scheme. Simulations of the Taylor{Green vortex at R(e) = 1,600 and turbulent flow past a sphere at R(e(infinity)) = 2,000 show the robustness and stability properties of the overall spatial discretization for unstructured grids. Finally, to demonstrate the entropy conservation property of a fully-discrete explicit entropy stable algorithm with h=p refinement/coarsening, we present the time evolution of the entropy function obtained by simulating the propagation of the isentropic vortex using a relaxation Runge-Kutta scheme.

Nonconforming interfaces↗

Concurrent two-way coupling of global and local models across internal boundaries with non-matching discretizations

Coupling local and global models enables efficient simulation of multiscale systems, where global models capture large-scale behavior and local models, with enhanced physics, resolve finer details over a smaller region. Here, this paper presents a mathematically consistent method for coupling physics-based models of varying fidelity across adjacent, non-overlapping subdomains, even when discretizations do not match at the immersed interdomain interfaces. Incompressible Navier-Stokes equations (NSE) constitute the global model while residual-based turbulence model serves as the local high-fidelity model. In addition, a scalar advection-diffusion equation that models the convection of an active scalar field is appended to the turbulence model in the local domain. This scalar field does not have its complement in the global model, giving rise to unequal number of equations at the immersed boundary between local and global models. Interdomain coupling terms are derived via the Variational Multiscale Discontinuous Galerkin (VMDG) method with new developments in scale representation and efficient fine-scale estimation. While transient laminar flows modeled with NSE in the global domain can be resolved with relatively coarse mesh, turbulent flow calculations in the local model require much finer spatial discretizations as well as smaller time-step for appropriately resolving the turbulent flow physics. The proposed framework also accommodates non-matching meshes at the immersed boundaries. Test problems in 2D and 3D numerically showcase the concurrent two-way coupling of unknown fields across the immersed boundaries. The 3D test presents a case with an unequal number of equations, where the scalar field represents the convection of contaminant concentration. This provides more detailed physics in the local region and highlights its application in climate modeling and atmospheric sciences.

Variational Multiscale Discontinuous Galerkin (VMD↗

Runge-Kutta methods combined with compact difference schemes for the unsteady Euler equations

Recent development using compact difference schemes to solve the Navier-Stokes equations show spectral-like accuracy. A study was made of the numerical characteristics of various combinations of the Runge-Kutta (RK) methods and compact difference schemes to calculate the unsteady Euler equations. The accuracy of finite difference schemes is assessed based on the evaluations of dissipative error. The objectives are reducing the numerical damping and, at the same time, preserving numerical stability. While this approach has tremendous success solving steady flows, numerical characteristics of unsteady calculations remain largely unclear. For unsteady flows, in addition to the dissipative errors, phase velocity and harmonic content of the numerical results are of concern. As a result of the discretization procedure, the simulated unsteady flow motions actually propagate in a dispersive numerical medium. Consequently, the dispersion characteristics of the numerical schemes which relate the phase velocity and wave number may greatly impact the numerical accuracy. The aim is to assess the numerical accuracy of the simulated results. To this end, the Fourier analysis is to provide the dispersive correlations of various numerical schemes. First, a detailed investigation of the existing RK methods is carried out. A generalized form of an N-step RK method is derived. With this generalized form, the criteria are derived for the three and four-step RK methods to be third and fourth-order time accurate for the non-linear equations, e.g., flow equations. These criteria are then applied to commonly used RK methods such as Jameson's 3-step and 4-step schemes and Wray's algorithm to identify the accuracy of the methods. For the spatial discretization, compact difference schemes are presented. The schemes are formulated in the operator-type to render themselves suitable for the Fourier analyses. The performance of the numerical methods is shown by numerical examples. These examples are detailed. described. The third case is a two-dimensional simulation of a Lamb vortex in an uniform flow. This calculation provides a realistic assessment of various finite difference schemes in terms of the conservation of the vortex strength and the harmonic content after travelling a substantial distance. The numerical implementation of Giles' non-refelctive equations coupled with the characteristic equations as the boundary condition is discussed in detail. Finally, the single vortex calculation is extended to simulate vortex pairing. For the distance between two vortices less than a threshold value, numerical results show crisp resolution of the vortex merging.

Yu, Sheng-Tao↗

Response Surface Methods For Spatially-Resolved Optical Measurement Techniques

Response surface methods (or methodology), RSM, have been applied to improve data quality for two vastly different spatially-resolved optical measurement techniques. In the first application, modern design of experiments (MDOE) methods, including RSM, are employed to map the temperature field in a direct-connect supersonic combustion test facility at NASA Langley Research Center. The laser-based measurement technique known as coherent anti-Stokes Raman spectroscopy (CARS) is used to measure temperature at various locations in the combustor. RSM is then used to develop temperature maps of the flow. Even though the temperature fluctuations at a single point in the flowfield have a standard deviation on the order of 300 K, RSM provides analytic fits to the data having 95% confidence interval half width uncertainties in the fit as low as +/- 30 K. Methods of optimizing future CARS experiments are explored. The second application of RSM is to quantify the shape of a 5-meter diameter, ultra-lightweight, inflatable space antenna at NASA Langley Research Center. Photogrammetry is used to simultaneously measure the shape of the antenna at approximately 500 discrete spatial locations. RSM allows an analytic model to be developed that describes the shape of the majority of the antenna with an uncertainty of 0.4 mm, with 95% confidence. This model would allow a quantitative comparison between the actual shape of the antenna and the original design shape. Accurately determining this shape also allows confident interpolation between the measured points. Such a model could, for example, be used for ray tracing of radio-frequency waves up to 95 GHz. to predict the performance of the antenna.

Danehy, P. M.↗

Simulation of Sweep-Jet Flow Control, Single Jet and Full Vertical Tail

This work is a simulation technology demonstrator, of sweep jets used to suppress boundary layer separation and increase maximum achievable load coefficients. A sweep jet is a discrete Coanda jet that oscillates in the plane parallel to an aerodynamic surface. It injects mass and momentum in the approximate stream wise direction. It also generate turbulent eddies at the oscillation frequency, which are typically large relative to boundary layer turbulence, and which augmenting mixing across the boundary layer to attack flow separation. Simulations of a fluidic oscillator, the sweep jet emerging from the oscillator, and the suppression of boundary layer separation by an array of sweep jets are performed. Simulation results are compared to data from a dedicated CFD validation experiment of a single oscillator and its sweep jet, and from a study of a full-scale Boeing 757 vertical tail augmented with an array of sweep jets.2, 20 A critical step in the work is the development of realistic time-dependent sweep-jet in flow boundary conditions, derived from the results of the single-oscillator simulations, which create the sweep jets in the full-tail simulations. Simulations were performed using the Over flow CFD solver, with high-order spatial discretization and a range of turbulence modeling. Good results were obtained for all flows simulated, when suitable turbulence modeling was used.

flow control↗

Simulation of Sweep-Jet Flow Control, Single Jet and Full Vertical Tail

This work is a simulation technology demonstrator, of sweep jet flow control used to suppress boundary layer separation and increase the maximum achievable load coefficients. A sweep jet is a discrete Coanda jet that oscillates in the plane parallel to an aerodynamic surface. It injects mass and momentum in the approximate streamwise direction. It also generates turbulent eddies at the oscillation frequency, which are typically large relative to the scales of boundary layer turbulence, and which augment mixing across the boundary layer to attack flow separation. Simulations of a fluidic oscillator, the sweep jet emerging from a nozzle downstream of the oscillator, and an array of sweep jets which suppresses boundary layer separation are performed. Simulation results are compared to data from a dedicated validation experiment of a single oscillator and its sweep jet, and from a wind tunnel test of a full-scale Boeing 757 vertical tail augmented with an array of sweep jets. A critical step in the work is the development of realistic time-dependent sweep jet inflow boundary conditions, derived from the results of the single-oscillator simulations, which create the sweep jets in the full-tail simulations. Simulations were performed using the computational fluid dynamics (CFD) solver Overow, with high-order spatial discretization and a range of turbulence modeling. Good results were obtained for all flows simulated, when suitable turbulence modeling was used.

flow control↗

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗