Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Cartesian grids”

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 55 records · Page 3

The Multigrid-Mask Numerical Method for Solution of Incompressible Navier-Stokes Equations

A multigrid-mask method for solution of incompressible Navier-Stokes equations in primitive variable form has been developed. The main objective is to apply this method in conjunction with the pseudospectral element method solving flow past multiple objects. There are two key steps involved in calculating flow past multiple objects. The first step utilizes only Cartesian grid points. This homogeneous or mask method step permits flow into the interior rectangular elements contained in objects, but with the restriction that the velocity for those Cartesian elements within and on the surface of an object should be small or zero. This step easily produces an approximate flow field on Cartesian grid points covering the entire flow field. The second or heterogeneous step corrects the approximate flow field to account for the actual shape of the objects by solving the flow field based on the local coordinates surrounding each object and adapted to it. The noise occurring in data communication between the global (low frequency) coordinates and the local (high frequency) coordinates is eliminated by the multigrid method when the Schwarz Alternating Procedure (SAP) is implemented. Two dimensional flow past circular and elliptic cylinders will be presented to demonstrate the versatility of the proposed method. An interesting phenomenon is found that when the second elliptic cylinder is placed in the wake of the first elliptic cylinder a traction force results in a negative drag coefficient.

Ku, Hwar-Ching↗

3D Euler flow solutions using unstructured Cartesian and prismatic grids

A hyperbolic prismatic grid generation technique is combined with a background Cartesian grid for the study of inviscid three-dimensional flows. The mathematics of the hyperbolic prismatic grid generation algorithm are described, and some simple inviscid demonstration cases are presented. By combining the simplicity of the Cartesian background grid with the geometric flexibility and computational efficiencies inherent to prismatic grids, this approach shows promise for improving computational aerodynamic simulations.

Melton, John E.↗

An Adaptive Semi-Implicit Scheme for Simulations of Unsteady Viscous Compressible Flows

A numerical scheme for simulation of unsteady, viscous, compressible flows is considered. The scheme employs an explicit discretization of the inviscid terms of the Navier-Stokes equations and an implicit discretization of the viscous terms. The discretization is second order accurate in both space and time. Under appropriate assumptions, the implicit system of equations can be decoupled into two linear systems of reduced rank. These are solved efficiently using a Gauss-Seidel method with multigrid convergence acceleration. When coupled with a solution-adaptive mesh refinement technique, the hybrid explicit-implicit scheme provides an effective methodology for accurate simulations of unsteady viscous flows. The methodology is demonstrated for both body-fitted structured grids and for rectangular (Cartesian) grids.

Steinthorsson, Erlendur↗

An immersed interface method for microstructure-scale electrochemical battery models: numerical formulation and performance portable implementation

We present the numerical formulation, verification, and performance portable implementation of an immersed interface method for microstructure scale electrochemical modeling of batteries. The innovation in this approach is the resolution of chemical species and electrostatic potential discontinuities at active interfaces without the use of interface conforming unstructured grids. A unified formulation on Cartesian grids for all domains (electrodes and electrolyte) is used with interfacial flux conditions applied using volume fraction or “color” function gradients. We have developed one dimensional and two dimensional test cases with analytic solutions for electrochemical modeling using which we verified the consistency and accuracy of our scheme. Our solver is also validated against solutions from a macroscale model and an unstructured multi-subdomain solver for a full lithium ion cell. We then demonstrated the utility of our solver on an image-based complex battery electrode microstructure at high charging rate. Our technique also exhibits good scalability on distributed memory architectures using central processing units (CPU), with problem sizes up to 1.8 billion degrees of freedom and with 5400 ranks. Initial performance studies of our open-source performance portable solver showed about 70 times speed up using a graphics processing unit (GPU) compared to single compute core for a problem with 4 million cells.

25 ENERGY STORAGE↗

A multigrid and upwind viscous flow solver on 3-D embedded and overlapped grids

A numerically efficient method is presented for solving the three-dimensional governing equations of the viscous compressible flow about complex configurations with topologically different components. The physical domain is decomposed into regions for which the grid generation is relatively simple and virtually with no significant restrictions. The Navier-Stokes equations are solved by an implicit, approximately factored, upwind, finite-volume scheme. The block inversions and the diagonalized scalar inversions of the coefficient matrices are modified to allow the holes created in the computational domain by the embedded and overlapped grids. The convergence is accelerated by a multigrid algorithm despite the existence of such holes. The solution for s supersonic flow past a blunt-nose-cylinder at high angle-of-attack is obtained using a C-O grid embedded in a global Cartesian grid.

Baysal, Oktay↗

Unstructured Cartesian/prismatic grid generation for complex geometries

The generation of a hybrid grid system for discretizing complex three dimensional (3D) geometries is described. The primary grid system is an unstructured Cartesian grid automatically generated using recursive cell subdivision. This grid system is sufficient for computing Euler solutions about extremely complex 3D geometries. A secondary grid system, using triangular-prismatic elements, may be added for resolving the boundary layer region of viscous flows near surfaces of solid bodies. This paper describes the grid generation processes used to generate each grid type. Several example grids are shown, demonstrating the ability of the method to discretize complex geometries, with very little pre-processing required by the user.

Karman, Steve L., Jr.↗

Advances in Automation of Overset Structured Volume Mesh Generation and Domain Connectivity

Automation of overset structured surface mesh generation has recently been accomplished by the creation of face, edge, and node meshes based on Boundary Representation solids as the geometry input. The current work continues the automation effort in overset volume mesh generation and domain connectivity based on the auto-generated surface meshes. All near-body curvilinear volume meshes are automatically generated using hyperbolic methods. Automation of this step is enabled by appropriate surface grid point distribution, and selection of boundary-splay and smoothing parameters based on concave and convex surface features. The off-body domain is covered by two automatically generated grid systems. The first contains a single Cartesian mesh with a uniform core enclosing all near-body volume meshes and stretched layers that extend to the far field, while the second consists of a set of small stretched Cartesian grids covering pockets of off-body orphan points. With high quality mesh overlap mostly guaranteed by the surface meshing scheme, orphan points that need to be covered by the second Cartesian mesh system are located away from the fine grid spacing region near the wall. Using line-segment and ray-pierce tests against the surface grids, hole-cutting is accomplished on both near and off-body volume grids resulting in appropriate clearances from the wall. The complete mesh generation automation process is demonstrated on five test cases where flow solutions are also computed and compared with solutions obtained using other methods.

TTT↗

Three-Dimensional Deformable Grid Electromagnetic Particle-in-cell for Parallel Computers

We describe a new parallel, non-orthogonal grid, three-dimensional electromagnetic particle-in-cell (EMPIC) code based on a finite-volume formulation. This code uses a logically Cartesian grid of deformable hexahedral cells, a discrete surface integral (DSI) algorithm to calculate the electromagnetic field, and a hybrid logical-physical space algorithm to push particles.

Cartesian grid Grid Electromagnetic electromagneti↗

Parameter Studies, time-dependent simulations and design with automated Cartesian methods

Over the past decade, NASA has made a substantial investment in developing adaptive Cartesian grid methods for aerodynamic simulation. Cartesian-based methods played a key role in both the Space Shuttle Accident Investigation and in NASA's return to flight activities. The talk will provide an overview of recent technological developments focusing on the generation of large-scale aerodynamic databases, automated CAD-based design, and time-dependent simulations with of bodies in relative motion. Automation, scalability and robustness underly all of these applications and research in each of these topics will be presented.

Aftosmis, Michael↗

Test problems for inviscid transonic flow

The paper discusses some results obtained in the solving of test problems for inviscid transonic flow with shock waves using the TRANDES program. The method used employs the full inviscid perturbation-potential flow equation in a Cartesian grid system that is stretched to infinity. The equation is represented by a nonconservative system of finite-difference equations that includes at supersonic points a rotated difference scheme and is solved by column relaxation. Except for the NACA 0012 case with the freestream Mach number equal to 0.95, all test problems were solved straightforwardly and appeared to be converged or close to convergence. The only difficulty was some sensitivity to grid placement, which is typical of the Cartesian formulation

Carlson, L. A.↗

Improved Bounds for Burning Fence Graphs

Graph burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The burning process takes place in synchronous, discrete rounds. In each round, a fire breaks out at a vertex, and the fire spreads to all vertices that are adjacent to a burning vertex. Additionally, the burning number of a graph G is the minimum number of rounds necessary for each vertex of G to burn. We consider the burning number of the \(m \times n\) Cartesian grid graphs, written \(G_{m,n}\) . For \(m = \omega (\sqrt{n})\) , the asymptotic value of the burning number of \(G_{m,n}\) was determined, but only the growth rate of the burning number was investigated in the case \(m = O(\sqrt{n})\) , which we refer to as fence graphs. We provide new explicit bounds on the burning number of fence graphs \(G_{c\sqrt{n},n}\) , where \(c > 0\) .

79 ASTRONOMY AND ASTROPHYSICS↗

Algorithms and data structures for adaptive multigrid elliptic solvers

Adaptive refinement and the complicated data structures required to support it are discussed. These data structures must be carefully tuned, especially in three dimensions where the time and storage requirements of algorithms are crucial. Another major issue is grid generation. The options available seem to be curvilinear fitted grids, constructed on iterative graphics systems, and unfitted Cartesian grids, which can be constructed automatically. On several grounds, including storage requirements, the second option seems preferrable for the well behaved scalar elliptic problems considered here. A variety of techniques for treatment of boundary conditions on such grids are reviewed. A new approach, which may overcome some of the difficulties encountered with previous approaches, is also presented.

Vanrosendale, J.↗

Three-dimensional inviscid flow analysis of turbofan forced mixers

A three-dimensional potential analysis has been formulated and applied to the inviscid flow over a turbofan forced mixer. The method uses a unique small disturbance formulation to analytically uncouple the circumferential flow from the radial and axial flow problem, thereby reducing the analysis to the solution of a series of axisymmetric problems. These equations are discretized using a flux volume formulation along a Cartesian grid. The method extends earlier applications of the Cartesian method to complex cambered geometries. The effects of power addition are also included within the potential formulation. Good agreement is obtained with an alternate small disturbance analysis for a symmetric mixer in a planar duct. In addition calculations showing pressure distributions and induced secondary vorticity fields are presented for practical turbofan mixer configurations, and where possible, comparison has been made with available experimental data.

Barber, T. J.↗

Turbofan forced mixer lobe flow modeling. 2: Three-dimensional inviscid mixer analysis (FLOMIX)

A three-dimensional potential analysis (FLOMIX) was formulated and applied to the inviscid flow over a turbofan foced mixer. The method uses a small disturbance formulation to analytically uncouple the circumferential flow from the radial and axial flow problem, thereby reducing the analysis to the solution of a series of axisymmetric problems. These equations are discretized using a flux volume formulation along a Cartesian grid. The method extends earlier applications of the Cartesian method to complex cambered geometries. The effects of power addition are also included within the potential formulation. Good agreement is obtained with an alternate small disturbance analysis for a high penetration symmetric mixer in a planar duct. In addition, calculations showing pressure distributions and induced secondary vorticity fields are presented for practical trubofan mixer configurations, and where possible, comparison was made with available experimental data. A detailed description of the required data input and coordinate definition is presented along with a sample data set for a practical forced mixer configuration. A brief description of the program structure and subroutines is also provided.

Barber, T.↗

Numerical solution of the full potential equation using a chimera grid approach

A numerical scheme utilizing a chimera zonal grid approach for solving the full potential equation in two spatial dimensions is described. Within each grid zone a fully-implicit approximate factorization scheme is used to advance the solution one interaction. This is followed by the explicit advance of all common zonal grid boundaries using a bilinear interpolation of the velocity potential. The presentation is highlighted with numerical results simulating the flow about a two-dimensional, nonlifting, circular cylinder. For this problem, the flow domain is divided into two parts: an inner portion covered by a polar grid and an outer portion covered by a Cartesian grid. Both incompressible and compressible (transonic) flow solutions are included. Comparisons made with an analytic solution as well as single grid results indicate that the chimera zonal grid approach is a viable technique for solving the full potential equation.

Holst, Terry L.↗

Local grid refinement for transonic flow problems

The present use of locally refined Cartesian grids to solve transonic flow problems about three-dimensional aircraft configurations obviates surface-conforming grid generation through an embedding of surface-geometry paneling in the grid. Accurate resolution of flow close to the boundary, and in regions with strong velocity gradients, is achieved via hierarchical local refinement which subdivides a given grid cell into eight cells. Fast and reliable convergence is obtained by combining several preconditioners and damping strategies. Methods are suggested for preclusion of global convergence problems.

Melvin, Robin G.↗

Development and Applications of 3D Cartesian CFD Technology

The urgent need for dramatic reductions in aircraft design cycle time is focusing scrutiny upon all aspects of computational fluid dynamics (CFD). These reductions will most likely come not from increased reliance upon user-interactive (and therefore time-expensive) methods, but instead from methods that can be fully automated and incorporated into 'black box' solutions. In comparison with tetrahedral methods, three-dimensional Cartesian grid approaches are in relative infancy, but initial experiences with automated Cartesian techniques are quite promising. Our research is targeted at furthering the development of Cartesian methods so that they can become key elements of a completely automatic grid generation/flow solution procedure applicable to the Euler analysis of complex aircraft geometries.

Melton, John E.↗

An analysis of finite-difference and finite-volume formulations of conservation laws

Finite-difference and finite-volume formulations are analyzed in order to clear up the confusion concerning their application to the numerical solution of conservation laws. A new coordinate-free formulation of systems of conservation laws is developed, which clearly distinguishes the role of physical vectors from that of algebraic vectors which characterize the system. The analysis considers general types of equations--potential, Euler, and Navier-Stokes. Three-dimensional unsteady flows with time-varying grids are described using a single, consistent nomeclature for both formulations. Grid motion due to a non-inertial reference frame as well as flow adaptation is covered. In comparing the two formulations, it is found useful to distinguish between differences in numerical methods and differences in grid definition. The former plays a role for non-Cartesian grids, and results in only cosmetic differences in the manner in which geometric terms are handled. The differences in grid definition for the two formulations is found to be more important, since it affects the manner in which boundary conditions, zonal procedures, and grid singularities are handled at computational boundaries. The proper interpretation of strong and weak conservation-law forms for quasi-one-dimensional and axisymmetric flows is brought out.

Vinokur, Marcel↗