Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Cartesian mesh”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

GSRP/David Marshall: Fully Automated Cartesian Grid CFD Application for MDO in High Speed Flows

With the renewed interest in Cartesian gridding methodologies for the ease and speed of gridding complex geometries in addition to the simplicity of the control volumes used in the computations, it has become important to investigate ways of extending the existing Cartesian grid solver functionalities. This includes developing methods of modeling the viscous effects in order to utilize Cartesian grids solvers for accurate drag predictions and addressing the issues related to the distributed memory parallelization of Cartesian solvers. This research presents advances in two areas of interest in Cartesian grid solvers, viscous effects modeling and MPI parallelization. The development of viscous effects modeling using solely Cartesian grids has been hampered by the widely varying control volume sizes associated with the mesh refinement and the cut cells associated with the solid surface. This problem is being addressed by using physically based modeling techniques to update the state vectors of the cut cells and removing them from the finite volume integration scheme. This work is performed on a new Cartesian grid solver, NASCART-GT, with modifications to its cut cell functionality. The development of MPI parallelization addresses issues associated with utilizing Cartesian solvers on distributed memory parallel environments. This work is performed on an existing Cartesian grid solver, CART3D, with modifications to its parallelization methodology.

Source record↗
NASA NTRS1990

Galerkin finite difference Laplacian operators on isolated unstructured triangular meshes by linear combinations

The Galerkin weighted residual technique using linear triangular weight functions is employed to develop finite difference formulae in Cartesian coordinates for the Laplacian operator on isolated unstructured triangular grids. The weighted residual coefficients associated with the weak formulation of the Laplacian operator along with linear combinations of the residual equations are used to develop the algorithm. The algorithm was tested for a wide variety of unstructured meshes and found to give satisfactory results.

Baumeister, Kenneth J.↗
NASA NTRS1976

Some recent progress in transonic flow computation

Although the development of a finite difference relaxation procedure to solve the steady form of equations of motion gave birth to the study of computational transonic aerodynamics and considerable progress has been made using the small disturbance theory, no general analytical solution method yet exists for transonic flows that include three dimensional unsteady, and viscous effects. Two techniques are described which are useful in computational transonic aerodynamics applications. The finite volume method simplifies the application of boundary conditions without introducing the constriction associated with small disturbance theory. Governing equations are solved in a Cartesian coordinate system using a body-oriented and shock-oriented mesh network. Only the volume and surface normal directions of the volume elements must be known. The other method, configuration design by numerical optimization, can be used by aircraft designers to develop configurations that satisfy specific geometric performance constraints. Two examples of airfoil design by numerical optimization are presented.

Ballhaus, W. F.↗
NASA NTRS2000

A New Method for Accurate Treatment of Flow Equations in Cylindrical Coordinates Using Series Expansions

The motivation of this work is the ongoing effort at the Center for Turbulence Research (CTR) to use large eddy simulation (LES) techniques to calculate the noise radiated by jet engines. The focus on engine exhaust noise reduction is motivated by the fact that a significant reduction has been achieved over the last decade on the other main sources of acoustic emissions of jet engines, such as the fan and turbomachinery noise, which gives increased priority to jet noise. To be able to propose methods to reduce the jet noise based on results of numerical simulations, one first has to be able to accurately predict the spatio-temporal distribution of the noise sources in the jet. Though a great deal of understanding of the fundamental turbulence mechanisms in high-speed jets was obtained from direct numerical simulations (DNS) at low Reynolds numbers, LES seems to be the only realistic available tool to obtain the necessary near-field information that is required to estimate the acoustic radiation of the turbulent compressible engine exhaust jets. The quality of jet-noise predictions is determined by the accuracy of the numerical method that has to capture the wide range of pressure fluctuations associated with the turbulence in the jet and with the resulting radiated noise, and by the boundary condition treatment and the quality of the mesh. Higher Reynolds numbers and coarser grids put in turn a higher burden on the robustness and accuracy of the numerical method used in this kind of jet LES simulations. As these calculations are often done in cylindrical coordinates, one of the most important requirements for the numerical method is to provide a flow solution that is not contaminated by numerical artifacts. The coordinate singularity is known to be a source of such artifacts. In the present work we use 6th order Pade schemes in the non-periodic directions to discretize the full compressible flow equations. It turns out that the quality of jet-noise predictions using these schemes is especially sensitive to the type of equation treatment at the singularity axis. The objective of this work is to develop a generally applicable numerical method for treating the singularities present at the polar axis, which is particularly suitable for highly accurate finite-differences schemes (e.g., Pade schemes) on non-staggered grids. The main idea is to reinterpret the regularity conditions developed in the context of pseudo-spectral methods. A set of exact equations at the singularity axis is derived using the appropriate series expansions for the variables in the original set of equations. The present treatment of the equations preserves the same level of accuracy as for the interior scheme. We also want to point out the wider utility of the method, proposed here in the context of compressible flow equations, as its extension for incompressible flows or for any other set of equations that are solved on a non-staggered mesh in cylindrical coordinates with finite-differences schemes of various level of accuracy is straightforward. The robustness and accuracy of the proposed technique is assessed by comparing results from simulations of laminar forced-jets and turbulent compressible jets using LES with similar calculations in which the equations are solved in Cartesian coordinates at the polar axis, or in which the singularity is removed by employing a staggered mesh in the radial direction without a mesh point at r = 0.

Constantinescu, G.S.↗
NASA NTRS2004

Balanced Central Schemes for the Shallow Water Equations on Unstructured Grids

We present a two-dimensional, well-balanced, central-upwind scheme for approximating solutions of the shallow water equations in the presence of a stationary bottom topography on triangular meshes. Our starting point is the recent central scheme of Kurganov and Petrova (KP) for approximating solutions of conservation laws on triangular meshes. In order to extend this scheme from systems of conservation laws to systems of balance laws one has to find an appropriate discretization of the source terms. We first show that for general triangulations there is no discretization of the source terms that corresponds to a well-balanced form of the KP scheme. We then derive a new variant of a central scheme that can be balanced on triangular meshes. We note in passing that it is straightforward to extend the KP scheme to general unstructured conformal meshes. This extension allows us to recover our previous well-balanced scheme on Cartesian grids. We conclude with several simulations, verifying the second-order accuracy of our scheme as well as its well-balanced properties.

Bryson, Steve↗
NASA NTRS1998

A Domain-Decomposed Multi-Level Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

The work presents a new method for on-the-fly domain decomposition technique for mapping grids and solution algorithms to parallel machines, and is applicable to both shared-memory and message-passing architectures. It will be demonstrated on the Cray T3E, HP Exemplar, and SGI Origin 2000. Computing time has been secured on all these platforms. The decomposition technique is an outgrowth of techniques used in computational physics for simulations of N-body problems and the event horizons of black holes, and has not been previously used by the CFD community. Since the technique offers on-the-fly partitioning, it offers a substantial increase in flexibility for computing in heterogeneous environments, where the number of available processors may not be known at the time of job submission. In addition, since it is dynamic it permits the job to be repartitioned without global communication in cases where additional processors become available after the simulation has begun, or in cases where dynamic mesh adaptation changes the mesh size during the course of a simulation. The platform for this partitioning strategy is a completely new Cartesian Euler solver tarcreted at parallel machines which may be used in conjunction with Ames' "Cart3D" arbitrary geometry simulation package.

Aftosmis, M. J.↗
NASA NTRS2001

A Highly Accurate Technique for the Treatment of Flow Equations at the Polar Axis in Cylindrical Coordinates using Series Expansions

Numerical methods for solving the flow equations in cylindrical or spherical coordinates should be able to capture the behavior of the exact solution near the regions where the particular form of the governing equations is singular. In this work we focus on the treatment of these numerical singularities for finite-differences methods by reinterpreting the regularity conditions developed in the context of pseudo-spectral methods. A generally applicable numerical method for treating the singularities present at the polar axis, when nonaxisymmetric flows are solved in cylindrical, coordinates using highly accurate finite differences schemes (e.g., Pade schemes) on non-staggered grids, is presented. Governing equations for the flow at the polar axis are derived using series expansions near r=0. The only information needed to calculate the coefficients in these equations are the values of the flow variables and their radial derivatives at the previous iteration (or time) level. These derivatives, which are multi-valued at the polar axis, are calculated without dropping the accuracy of the numerical method using a mapping of the flow domain from (0,R)*(0,2pi) to (-R,R)*(0,pi), where R is the radius of the computational domain. This allows the radial derivatives to be evaluated using high-order differencing schemes (e.g., compact schemes) at points located on the polar axis. The proposed technique is illustrated by results from simulations of laminar-forced jets and turbulent compressible jets using large eddy simulation (LES) methods. In term of the general robustness of the numerical method and smoothness of the solution close to the polar axis, the present results compare very favorably to similar calculations in which the equations are solved in Cartesian coordinates at the polar axis, or in which the singularity is removed by employing a staggered mesh in the radial direction without a mesh point at r=0, following the method proposed recently by Mohseni and Colonius (1). Extension of the method described here for incompressible flows or for any other set of equations that are solved on a non-staggered mesh in cylindrical or spherical coordinates with finite-differences schemes of various level of accuracy is immediate.

Constantinescu, George S.↗
NASA NTRS1990

A three-dimensional dynamic solution-adaptive mesh algorithm

A solution-adaptive grid algorithm has been developed for use in two and three dimensions. The algorithm uses a transformation from the cartesian coordinate system to a general coordinate space, which will be defined as a parallelepiped. A weighting function for adaption of the grid is developed that will allow adaption to the gradients of any combination of dependent variables in the flow. The adaption is carried out in the parametric space and a simple inverse mapping to return the new parametric space to the physical space is derived. The concept used to relocate the grid-points in the parametric space is based on the center of mass of distributed weights. Solution-adaptive results are presented for various laminar flows in two dimensions and for mathematical weighting functions in three dimensions.

Benson, Rusty A.↗
NASA NTRS1994

Nonlinear hydrodynamics of cosmological sheets. 1: Numerical techniques and tests

We present the numerical techniques and tests used to construct and validate a computer code designed to study the multidimensional nonlinear hydrodynamics of large-scale sheet structures in the universe, especially the fragmentation of such structures under various instabilities. This code is composed of two codes, the hydrodynamical code ZEUS-2D and a particle-mesh code. The ZEUS-2D code solves the hydrodynamical equations in two dimensions using explicit Eulerian finite-difference techniques, with modifications made to incorporate the expansion of the universe and the gas cooling due to Compton scattering, bremsstrahlung, and hydrogen and helium cooling. The particle-mesh code solves the equation of motion for the collisionless dark matter. The code uses two-dimensional Cartesian coordinates with a nonuniform grid in one direction to provide high resolution for the sheet structures. A series of one-dimensional and two-dimensional linear perturbation tests are presented which are designed to test the hydro solver and the Poisson solver with and without the expansion of the universe. We also present a radiative shock wave test which is designed to ensure the code's capability to handle radiative cooling properly. And finally a series of one-dimensional Zel'dovich pancake tests used to test the dark matter code and the hydro solver in the nonlinear regime are discussed and compared with the results of Bond et al. (1984) and Shapiro & Struck-Marcell (1985). Overall, the code is shown to produce accurate and stable results, which provide us a powerful tool to further our studies.

Anninos, Wenbo Y.↗
NASA NTRS2017

An ODE-Based Wall Model for Turbulent Flow Simulations

Fully automated meshing for Reynolds-Averaged Navier-Stokes Simulations, Mesh generation for complex geometry continues to be the biggest bottleneck in the RANS simulation process; Fully automated Cartesian methods routinely used for inviscid simulations about arbitrarily complex geometry; These methods lack of an obvious & robust way to achieve near wall anisotropy; Goal: Extend these methods for RANS simulation without sacrificing automation, at an affordable cost; Note: Nothing here is limited to Cartesian methods, and much becomes simpler in a body-fitted setting.

Wall Model↗
NASA NTRS1981

Mesh generation by conformal and quasiconformal mappings

It is pointed out that many recent advances in the finite-difference solution of elliptic equations have been limited to regions whose boundary contours coincide with coordinate lines of the Cartesian coordinate system. The reason for this is related to the fact that in the case of an arbitrary curvilinear coordinate system the original equation becomes much more complex. However, there is no added complexity if an orthogonal coordinate system is generated from a conformal mapping. In the present investigation, a finite difference method developed for the construction of conformal mappings has been generalized to construct quasi-conformal mappings. It is expected that the use of more sophisticated numerical algorithms could lead to improvements in both speed and accuracy. Quasi-conformal mappings have applications not only in the solution of elliptic equations but also in other areas such as orthogonal mesh generation on surfaces and the solution of certain fluid flow problems.

Mastin, C. W.↗
NASA NTRS1997

RIACS

Topics considered include: high-performance computing; cognitive and perceptual prostheses (computational aids designed to leverage human abilities); autonomous systems. Also included: development of a 3D unstructured grid code based on a finite volume formulation and applied to the Navier-stokes equations; Cartesian grid methods for complex geometry; multigrid methods for solving elliptic problems on unstructured grids; algebraic non-overlapping domain decomposition methods for compressible fluid flow problems on unstructured meshes; numerical methods for the compressible navier-stokes equations with application to aerodynamic flows; research in aerodynamic shape optimization; S-HARP: a parallel dynamic spectral partitioner; numerical schemes for the Hamilton-Jacobi and level set equations on triangulated domains; application of high-order shock capturing schemes to direct simulation of turbulence; multicast technology; network testbeds; supercomputer consolidation project.

Oliger, Joseph↗
NASA NTRS2003

Implicit Approaches for Moving Boundaries in a 3-D Cartesian Method

This work considers numerical simulation of three-dimensional flows with time-evolving boundaries. Such problems pose a variety of challenges for numerical schemes, and have received a substantial amount of attention in the recent literature. Since such simulations are unsteady, time-accurate solution of the governing equations is required. In special cases, the body motion can be treated by a uniform rigid motion of the computational domain. For the more general situation of relative-body motion, however, this simplification is unavailable and the simulations require a mechanism for ensuring that the mesh evolves with the moving boundaries. This involves a "remeshing" of the computational domain (either localized or global) at each physical timestep, and places a premium on both the speed and robustness of the remeshing algorithms. This work presents a method which includes unsteady flow simulation, rigid domain motion, and relative body motion using a time-evolving Cartesian grid system in three dimensions.

Murman, Scott M.↗
NASA NTRS1987

Inviscid transonic wing design using inverse methods in curvilinear coordinates

An inverse wing design method has been developed around an existing transonic wing analysis code. The original analysis code, TAWFIVE, has as its core the numerical potential flow solver, FLO30, developed by Jameson and Caughey. Features of the analysis code include a finite-volume formulation; wing and fuselage fitted, curvilinear grid mesh; and a viscous boundary layer correction that also accounts for viscous wake thickness and curvature. The development of the inverse methods as an extension of previous methods existing for design in Cartesian coordinates is presented. Results are shown for inviscid wing design cases in super-critical flow regimes. The test cases selected also demonstrate the versatility of the design method in designing an entire wing or discontinuous sections of a wing.

Gally, Thomas A.↗
NASA NTRS1989

Development of direct-inverse 3-D methods for applied transonic aerodynamic wing design and analysis

An inverse wing design method was developed around an existing transonic wing analysis code. The original analysis code, TAWFIVE, has as its core the numerical potential flow solver, FLO30, developed by Jameson and Caughey. Features of the analysis code include a finite-volume formulation; wing and fuselage fitted, curvilinear grid mesh; and a viscous boundary layer correction that also accounts for viscous wake thickness and curvature. The development of the inverse methods as an extension of previous methods existing for design in Cartesian coordinates is presented. Results are shown for inviscid wing design cases in super-critical flow regimes. The test cases selected also demonstrate the versatility of the design method in designing an entire wing or discontinuous sections of a wing.

Carlson, Leland A.↗
NASA NTRS1994

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: a gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗
NASA NTRS1995

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: A gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗
NASA NTRS1995

Emerging CFD technologies and aerospace vehicle design

With the recent focus on the needs of design and applications CFD, research groups have begun to address the traditional bottlenecks of grid generation and surface modeling. Now, a host of emerging technologies promise to shortcut or dramatically simplify the simulation process. This paper discusses the current status of these emerging technologies. It will argue that some tools are already available which can have positive impact on portions of the design cycle. However, in most cases, these tools need to be integrated into specific engineering systems and process cycles to be used effectively. The rapidly maturing status of unstructured and Cartesian approaches for inviscid simulations makes suggests the possibility of highly automated Euler-boundary layer simulations with application to loads estimation and even preliminary design. Similarly, technology is available to link block structured mesh generation algorithms with topology libraries to avoid tedious re-meshing of topologically similar configurations. Work in algorithmic based auto-blocking suggests that domain decomposition and point placement operations in multi-block mesh generation may be properly posed as problems in Computational Geometry, and following this approach may lead to robust algorithmic processes for automatic mesh generation.

Aftosmis, Michael J.↗