Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “implicit meshing”

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 235 records · Page 13

A Finite-Element Approach for Modeling Inviscid and Viscous Compressible Flows using Prismatic Grids

The Galerkin finite-element method is used to solve the Euler and Navier-Stokes equations on prismatic meshes. It is shown that the prismatic grid is advantageous for correctly and efficiently capturing the boundary layers in high Reynolds number flows. It can be captured accurately because of the ability to cluster grid points normal to the body. The efficiency derives from the implicit treatment of the normal direction. To treat the normal direction implicitly, a semi-implicit Runge-Kutta time stepping scheme is developed. The semi-implicit algorithm is validated on simple geometries for inviscid and viscous flows and its convergence history is compared to that of the explicit Runge-Kutta scheme. The semi-implicit scheme is shown to be a factor of 3 to 4 faster in terms of CPU time to convergence.

Pandya, S. A.↗

The latent variable proximal point algorithm for variational problems with inequality constraints

The latent variable proximal point (LVPP) algorithm is a framework for solving infinite-dimensional variational problems with pointwise inequality constraints. The algorithm is a saddle point reformulation of the Bregman proximal point algorithm. At the continuous level, the two formulations are equivalent, but the saddle point formulation is more amenable to discretization because it introduces a structure-preserving transformation between a latent function space and the feasible set. Working in this latent space is much more convenient for enforcing inequality constraints than the feasible set, as discretizations can employ general linear combinations of suitable basis functions, and nonlinear solvers can involve general additive updates. LVPP yields numerical methods with observed mesh-independence for obstacle problems, contact, fracture, plasticity, and others besides; in many cases, for the first time. The framework also extends to more complex constraints, providing means to enforce convexity in the Monge–Ampère equation and handling quasi-variational inequalities, where the underlying constraint depends implicitly on the unknown solution. Here, in this paper, we describe the LVPP algorithm in a general form and apply it to ten problems from across mathematics.

Inequality constraints↗

Multigrid solution of compressible turbulent flow on unstructured meshes using a two-equation model

The system of equations consisting of the full Navier-Stokes equations and two turbulence equations was solved for in the steady state using a multigrid strategy on unstructured meshes. The flow equations and turbulence equations are solved in a loosely coupled manner. The flow equations are advanced in time using a multistage Runge-Kutta time stepping scheme with a stability bound local time step, while the turbulence equations are advanced in a point-implicit scheme with a time step which guarantees stability and positively. Low Reynolds number modifications to the original two equation model are incorporated in a manner which results in well behaved equations for arbitrarily small wall distances. A variety of aerodynamic flows are solved for, initializing all quantities with uniform freestream values, and resulting in rapid and uniform convergence rates for the flow and turbulence equations.

Mavriplis, D. J.↗

Multigrid solution of compressible turbulent flow on unstructured meshes using a two-equation model

The system of equations consisting of the full Navier-Stokes equations and two turbulence equations has been solved for in the steady-state using a multigrid strategy on unstructured meshes. The flow equations and turbulence equations are solved in a loosely coupled manner. The flow equations are advanced in time using a multistage Runge-Kutta time stepping scheme with a stability bound local time-step, while the turbulence equations are advanced in a point-implicit scheme with a time-step which guarantees stability and positivity. Low Reynolds number modifications to the original two-equation model are incorporated in a manner which results in well behaved equations for arbitrarily small wall distances. A variety of aerodynamic flows are solved for, initializing all quantities with uniform freestream values, and resulting in rapid and uniform convergence rates for the flow and turbulence equations.

Mavriplis, D. J.↗

Towards a generalized computational fluid dynamics technique for all Mach numbers

Currently there exists no single unified approach for efficiently and accurately solving computational fluid dynamics (CFD) problems across the Mach number regime, from truly low speed incompressible flows to hypersonic speeds. There are several CFD codes that have evolved into sophisticated prediction tools with a wide variety of features including multiblock capabilities, generalized chemistry and thermodynamics models among other features. However, as these codes evolve, the demand placed on the end user also increases simply because of the myriad of features that are incorporated into these codes. In order for a user to be able to solve a wide range of problems, several codes may be needed requiring the user to be familiar with the intricacies of each code and their rather complicated input files. Moreover, the cost of training users and maintaining several codes becomes prohibitive. The objective of the current work is to extend the compressible, characteristic-based, thermochemical nonequilibrium Navier-Stokes code GASP to very low speed flows and simultaneously improve convergence at all speeds. Before this work began, the practical speed range of GASP was Mach numbers on the order of 0.1 and higher. In addition, a number of new techniques have been developed for more accurate physical and numerical modeling. The primary focus has been on the development of optimal preconditioning techniques for the Euler and the Navier-Stokes equations with general finite-rate chemistry models and both equilibrium and nonequilibrium thermodynamics models. We began with the work of Van Leer, Lee, and Roe for inviscid, one-dimensional perfect gases and extended their approach to include three-dimensional reacting flows. The basic steps required to accomplish this task were a transformation to stream-aligned coordinates, the formulation of the preconditioning matrix, incorporation into both explicit and implicit temporal integration schemes, and modification of the numerical flux formulae. In addition, we improved the convergence rate of the implicit time integration schemes in GASP through the use of inner iteration strategies and the use of the GMRES (General Minimized Resisual) which belongs to the class of algorithms referred to as Krylov subspace iteration. Finally, we significantly improved the practical utility of GASP through the addition of mesh sequencing, a technique in which computations begin on a coarse grid and get interpolated onto successively finer grids. The fluid dynamic problems of interest to the propulsion community involve complex flow physics spanning different velocity regimes and possibly involving chemical reactions. This class of problems results in widely disparate time scales causing numerical stiffness. Even in the absence of chemical reactions, eigenvalue stiffness manifests itself at transonic and very low speed flows which can be quantified by the large condition number of the system and evidenced by slow convergence rates. This results in the need for thorough numerical analysis and subsequent implementation of sophisticated numerical techniques for these difficult yet practical problems. As a result of this work, we have been able to extend the range of applicability of compressible codes to very low speed inviscid flows (M = .001) and reacting flows.

Walters, R. W.↗

Calculation of winged-body-like flow fields using an implicit upwind space-marching code

The Mach-8 flow past a 60-deg swept fin mounted on a 12-degree ramp has been simulated using a parabolized Navier-Stokes solver employing an upwind algorithm in order to investigate the interference patterns that develop when a bow shock impinges on a wing shock. Good agreement with experimental data is found downstream of the interaction for each of three meshes of varying grid point density and computed surface pressure and heat transfer. In the wedge flow region, some disagreement with experimental data is noted for both pressure and heat transfer.

Lawrence, Scott L.↗

Implicit LES of Turbulent, Separated Flow: Wall-Mounted Hump Configuration

Direct simulations (ILES) of turbulent, separated flow over the wall-mounted hump configuration is conducted to investigate the physics of separated flows. A chord-based Reynolds number of Re(sub c) = 47,500 is set up, with a turbulent in flow of Re(sub theta) = 1,400 (theta/c = 3%). FDL3DI, a code that solves the compressible Navier-Stokes equations using high- order compact-difference scheme and filter, with the standard recycling/rescaling method of turbulence generation, is used. Two different configurations of the upper-wall are analyzed, and results are compared with both a higher Re(sub c) (= 936,000, Re(sub theta) = 7,200, theta/c = 0.77%) experiment for major flow features, and RANS (k-omega SST) results. A lower Rec allows for DNS-like mesh resolution, and an adequately wide span. Both ILES and RANS show delayed reattachment compared to experiment, and significantly higher skin friction in the forebody of the hump, as expected. The upper-wall shape influences the C(sub p) distribution only. Results from this study are being used to setup higher Rec (lower theta/c) ILES.

Implicit LES↗

An implicit finite-difference code for inviscid and viscous cascade flow

An implicit finite-difference code is developed to solve either inviscid or viscous flow about two-dimensional cascade blade elements. General coordinate transformations are used so that boundaries can coincide with coordinate lines, and an automatic grid generation routine based on elliptic partial differential equations is employed to mesh arbitrary cascade elements. Characteristic combinations of the differential equations are used at inflow and outflow boundaries. Computed results for both inviscid and viscous flow are compared with other existing cascade solutions and experimental data.

Steger, J. L.↗

Preconditioned conjugate gradient methods for the compressible Navier-Stokes equations

The compressible Navier-Stokes equations are solved for a variety of two-dimensional inviscid and viscous problems by preconditioned conjugate gradient-like algorithms. Roe's flux difference splitting technique is used to discretize the inviscid fluxes. The viscous terms are discretized by using central differences. An algebraic turbulence model is also incorporated. The system of linear equations which arises out of the linearization of a fully implicit scheme is solved iteratively by the well known methods of GMRES (Generalized Minimum Residual technique) and Chebyschev iteration. Incomplete LU factorization and block diagonal factorization are used as preconditioners. The resulting algorithm is competitive with the best current schemes, but has wide applications in parallel computing and unstructured mesh computations.

Venkatakrishnan, V.↗

On a fourth order accurate implicit finite difference scheme for hyperbolic conservation laws. I - Nonstiff strongly dynamic problems

An implicit finite difference method of fourth order accuracy in space and time is introduced for the numerical solution of one-dimensional systems of hyperbolic conservation laws. The basic form of the method is a two-level scheme which is unconditionally stable and nondissipative. The scheme uses only three mesh points at level t and three mesh points at level t + delta t. The dissipative version of the basic method given is conditionally stable under the CFL (Courant-Friedrichs-Lewy) condition. This version is particularly useful for the numerical solution of problems with strong but nonstiff dynamic features, where the CFL restriction is reasonable on accuracy grounds. Numerical results are provided to illustrate properties of the proposed method.

Harten, A.↗

Quasi-Helmholtz decomposition, Gauss' laws and charge conservation for finite element particle-in-cell

Development of particle-in-cell (PIC) methods using finite element based methods (FEMs) have been a topic of renewed interest; this has largely been driven by (a) the ability of finite element methods to better model geometry, (b) better understanding of function spaces that are necessary to represent all Maxwell quantities, and (c) more recently, the fundamental rubrics that should be obeyed in space and time so as to satisfy Gauss' laws and the equation of continuity. In that vein, methods have been developed recently that satisfy these equations and are agnostic to time stepping methods. While this development is indeed a significant advance, it should be noted that implicit FEM transient solvers support an underlying null space that corresponds to a gradient of a scalar potential ∇Φ(r) (or t∇Φ(r) in the case of wave equation solvers). While explicit schemes do not suffer from this drawback, they are only conditionally stable with time step sizes that are mesh dependent and very small. Furthermore, the null space produces spurious charge that can corrupt the desired physics of a PIC simulation. The way to overcome this bottleneck, and indeed, satisfy all four Maxwell's equation is to use a quasi-Helmholtz formulation on a tessellation. In the re-formulation presented, we strictly satisfy the equation of continuity and Gauss' laws for both the electric and magnetic flux densities. Results illustrating the efficacy of this scheme will be demonstrated by analyzing non-neutral beams with space-charge and the adiabatic expansion of a neutral plasma with realistic parameters (Debye length and real mass ratios).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Navier-Stokes solver for cascade flows

A computer code for solving the Reynolds averaged full Navier-Stokes equations has been developed and applied using sheared H-type grids. The Baldwin-Lomax eddy-viscosity model is used for turbulence closure. The integration in time is based on an explicit four-stage Runge-Kutta scheme. Local time stepping, variable coefficient implicit residual smoothing, and a full multigrid method have been implemented to accelerate steady state calculations. Comparisons with experimental data show that the code is an accurate viscous solver and can give very good blade-to-blade predictions for engineering applications in less than 100 multigrid cycles on the finest mesh.

Arnone, A.↗

Numerical simulation of the tip vortex off a low-aspect-ratio wing at transonic speed

The viscous transonic flow around a low aspect ratio wing was computed by an implicit, three dimensional, thin-layer Navier-Stokes solver. The grid around the geometry of interest is obtained numerically as a solution to a Dirichlet problem for the cube. A low aspect ratio wing with large sweep, twist, taper, and camber is the chosen geometry. The topology chosen to wrap the mesh around the wing with good tip resolution is a C-O type mesh. The flow around the wing was computed for a free stream Mach number of 0.82 at an angle of attack of 5 deg. At this Mach number, an oblique shock forms on the upper surface of the wing, and a tip vortex and three dimensional flow separation off the wind surface are observed. Particle path lines indicate that the three dimensional flow separation on the wing surface is part of the roots of the tip vortex formation. The lifting of the tip vortex before the wing trailing edge is observed by following the trajectory of particles release around the wing tip.

Mansour, N. N.↗

A Fourth-Order Embedded Boundary Finite Volume Method for the Unsteady Stokes Equations with Complex Geometries

A fourth-order finite volume embedded boundary (EB) method is presented for the unsteady Stokes equations. The algorithm represents complex geometries on a Cartesian grid using EB, employing a technique to mitigate the ``small cut-cell"" problem without mesh modifications, cell merging, or state redistribution. Spatial discretizations are based on a weighted least-squares technique that has been extended to fourth-order operators and boundary conditions, including an approximate projection to enforce the divergence-free constraint. Solutions are advanced in time using a fourth-order additive implicit-explicit Runge-Kutta method, with the viscous and source terms treated implicitly and explicitly, respectively. Formal accuracy of the method is demonstrated with several grid convergence studies, and results are shown for an application with a complex bio-inspired material. In conclusion, the developed method achieves fourth-order accuracy and is stable despite the pervasive small cells arising from complex geometries.

97 MATHEMATICS AND COMPUTING↗

Application of viscous-inviscid interaction methods to transonic turbulent flows

Two different viscous-inviscid interaction schemes were developed for the analysis of steady, turbulent, transonic, separated flows over axisymmetric bodies. The viscous and inviscid solutions are coupled through the displacement concept using a transpiration velocity approach. In the semi-inverse interaction scheme, the viscous and inviscid equations are solved in an explicitly separate manner and the displacement thickness distribution is iteratively updated by a simple coupling algorithm. In the simultaneous interaction method, local solutions of viscous and inviscid equations are treated simultaneously, and the displacement thickness is treated as an unknown and is obtained as a part of the solution through a global iteration procedure. The inviscid flow region is described by a direct finite-difference solution of a velocity potential equation in conservative form. The potential equation is solved on a numerically generated mesh by an approximate factorization (AF2) scheme in the semi-inverse interaction method and by a successive line overrelaxation (SLOR) scheme in the simultaneous interaction method. The boundary-layer equations are used for the viscous flow region. The continuity and momentum equations are solved inversely in a coupled manner using a fully implicit finite-difference scheme.

Lee, D.↗

Operator induced multigrid algorithms using semirefinement

A variant of multigrid, based on zebra relaxation, and a new family of restriction/prolongation operators is described. Using zebra relaxation in combination with an operator-induced prolongation leads to fast convergence, since the coarse grid can correct all error components. The resulting algorithms are not only fast, but are also robust, in the sense that the convergence rate is insensitive to the mesh aspect ratio. This is true even though line relaxation is performed in only one direction. Multigrid becomes a direct method if an operator-induced prolongation is used, together with the induced coarse grid operators. Unfortunately, this approach leads to stencils which double in size on each coarser grid. The use of an implicit three point restriction can be used to factor these large stencils, in order to retain the usual five or nine point stencils, while still achieving fast convergence. This algorithm achieves a V-cycle convergence rate of 0.03 on Poisson's equation, using 1.5 zebra sweeps per level, while the convergence rate improves to 0.003 if optimal nine point stencils are used. Numerical results for two and three dimensional model problems are presented, together with a two level analysis explaining these results.

Decker, Naomi↗

Operator induced multigrid algorithms using semirefinement

A variant of multigrid, based on zebra relaxation, and a new family of restriction/prolongation operators is described. Using zebra relaxation in combination with an operator-induced prolongation leads to fast convergence, since the coarse grid can correct all error components. The resulting algorithms are not only fast, but are also robust, in the sense that the convergence rate is insensitive to the mesh aspect ratio. This is true even though line relaxation is performed in only one direction. Multigrid becomes a direct method if an operator-induced prolongation is used, together with the induced coarse grid operators. Unfortunately, this approach leads to stencils which double in size on each coarser grid. The use of an implicit three point restriction can be used to factor these large stencils, in order to retain the usual five or nine point stencils, while still achieving fast convergence. This algorithm achieves a V-cycle convergence rate of 0.03 on Poisson's equation, using 1.5 zebra sweeps per level, while the convergence rate improves to 0.003 if optimal nine point stencils are used. Numerical results for two- and three-dimensional model problems are presented, together with a two level analysis explaining these results.

Decker, Naomi Henderson↗

A Solution Adaptive Structured/Unstructured Overset Grid Flow Solver with Applications to Helicopter Rotor Flows

This paper summarizes a method that solves both the three dimensional thin-layer Navier-Stokes equations and the Euler equations using overset structured and solution adaptive unstructured grids with applications to helicopter rotor flowfields. The overset structured grids use an implicit finite-difference method to solve the thin-layer Navier-Stokes/Euler equations while the unstructured grid uses an explicit finite-volume method to solve the Euler equations. Solutions on a helicopter rotor in hover show the ability to accurately convect the rotor wake. However, isotropic subdivision of the tetrahedral mesh rapidly increases the overall problem size.

Duque, Earl P. N.↗