Search NASA⌕ Search

SEARCH · Search NASA

Results for “grid solutions”

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 325 records · Page 18

Solution of viscous internal flows on curvilinear grids generated by the Schwarz-Christoffel transformation

The combination of an orthogonal, curvilinear coordinate generation procedure with a stable forward marching viscous flow solution technique is presently employed in the solution of flow fields for arbitrary, axisymmetric ducts. Coordinate generation is accomplished by means of both potential lines and plane potential flow streamlines. Since the coordinate streamlines approximate actual ones, the equations of motion for viscous compressible flow can be parabolized in order to solve for both the boundary layer and the core flow in a single streamwise pass. The method's versatility is demonstrated by two examples of viscous compressible swirling flow through complex radial gas turbine passages.

Anderson, O. L.↗

Flow solution on a dual-block grid around an airplane

The compressible flow around a complex fighter-aircraft configuration (fuselage, cranked delta wing, canard, and inlet) is simulated numerically using a novel grid scheme and a finite-volume Euler solver. The patched dual-block grid is generated by an algebraic procedure based on transfinite interpolation, and the explicit Runge-Kutta time-stepping Euler solver is implemented with a high degree of vectorization on a Cyber 205 processor. Results are presented in extensive graphs and diagrams and characterized in detail. The concentration of grid points near the wing apex in the present scheme is shown to facilitate capture of the vortex generated by the leading edge at high angles of attack and modeling of its interaction with the canard wake.

Eriksson, Lars-Erik↗

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.↗

Gridding strategies and associated results for winged entry vehicles

Two volume grid strategies based on similar software are presented for a geometrically complex entry vehicle. It is shown that quick relatively simple grid generation techniques can be used to construct computational grids about entry vehicles with nontrivial geometric complexity. Particular attention is given to both single- and dual-block grid topologies for a lifting body and solution generated on each grid. Results indicate that the grid topology can have an effect on the nature of the solution.

Weilmuenster, K. J.↗

Using adaptive grid in modeling rocket nozzle flow

The mechanical behavior of a rocket motor internal flow field results in a system of nonlinear partial differential equations which cannot be solved analytically. However, this system of equations called the Navier-Stokes equations can be solved numerically. The accuracy and the convergence of the solution of the system of equations will depend largely on how precisely the sharp gradients in the domain of interest can be resolved. With the advances in computer technology, more sophisticated algorithms are available to improve the accuracy and convergence of the solutions. An adaptive grid generation is one of the schemes which can be incorporated into the algorithm to enhance the capability of numerical modeling. It is equivalent to putting intelligence into the algorithm to optimize the use of computer memory. With this scheme, the finite difference domain of the flow field called the grid does neither have to be very fine nor strategically placed at the location of sharp gradients. The grid is self adapting as the solution evolves. This scheme significantly improves the methodology of solving flow problems in rocket nozzles by taking the refinement part of grid generation out of the hands of computational fluid dynamics (CFD) specialists and place it into the computer algorithm itself.

Chow, Alan S.↗

Design of Rail Instrumentation for Wind Tunnel Sonic Boom Measurements and Computational-Experimental Comparisons

An innovative pressure rail concept for wind tunnel sonic boom testing of modern aircraft configurations with very low overpressures was designed with an adjoint-based solution-adapted Cartesian grid method. The computational method requires accurate free-air calculations of a test article as well as solutions modeling the influence of rail and tunnel walls. Specialized grids for accurate Euler and Navier-Stokes sonic boom computations were used on several test articles including complete aircraft models with flow-through nacelles. The computed pressure signatures are compared with recent results from the NASA 9- x 7-foot Supersonic Wind Tunnel using the advanced rail design.

Cliff, Susan E.↗

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Viscous Fluxes

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and complexity are studied for four nominally second-order accurate schemes: a node-centered scheme and three cell-centered schemes - a node-averaging scheme and two schemes with nearest-neighbor and adaptive compact stencils for least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Tests from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The tests of the second class are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes may degenerate on mixed grids, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to that of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping based on a distance function commonly available in practical schemes or modifying the scheme stencil to reflect the direction of strong coupling. The major conclusion is that accuracies of the node centered and the best cell-centered schemes are comparable at equivalent number of degrees of freedom.

Diskin, Boris↗

Grid spacing control with variation diminishing splines

Methods used to specify and control two and three dimensional grids on which numerical solutions of partial differential equations may be obtained were studied. While initially focusing on grid generation, the research will evolve into a consideration of the interaction of grid generation with the solution of a partial differential equation. The multisurface method of grid generation was used to continuously patch a grid onto an existing grid. In the resulting grid the elements of the Jacobian matrix must be continuous across the boundary between the original grid and the patched grid. Programs were written which accept as input the coordinates of the original grid and the desired new boundary, and then use the three-surface or four-surface version of the multisurface method to extend the original grid out to a new boundary.

Smith, P. W.↗

MegaWatt Mayhem: Grid Operator Challenges Center Loads

This report provides a summary of the challenges faced by United States electricity grid operators in accommodating and anticipating the rapid deployment of large loads, particularly data centers, based on academic literature and industry working groups. The report highlights the unique requirements and operational characteristics of data centers, which differ significantly from traditional industrial loads. Key issues addressed utility planning considerations, with emphasis on the implications for grid operators, impacts to normal operations for grid operators, reliability considerations during periods of grid stress, and resilience considerations for the changing operational paradigms based on data centers. Real-world examples are used to highlight these challenges and the changes that grid operators must address. The findings underscore the necessity for coordinated efforts and innovative solutions from both grid operators and regulatory bodies to ensure the stable integration of large loads into the grid. This report is the first in a series that will explore the challenges of data center deployments based on several key power system perspectives.

24 - POWER TRANSMISSION AND DISTRIBUTION↗

Quadrature-Free Implementation of the Discontinuous Galerkin Method for Hyperbolic Equations

A discontinuous Galerkin formulation that avoids the use of discrete quadrature formulas is described and applied to linear and nonlinear test problems in one and two space dimensions. This approach requires less computational time and storage than conventional implementations but preserves the compactness and robustness inherent to the discontinuous Galerkin method. Test problems include both linear and nonlinear one-dimensional scalar advection of botH smooth and discontinuous initial value problems, two-dimensional scalar advection of smooth initial value problems discretized by using unstructured grids with varying degrees of smoothness and regularity, and two-dimensional linear Euler solutions on unstructured grids.

Atkins, H. L.↗

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Viscous Fluxes - Part 1

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and efficiency are studied for six nominally second-order accurate schemes: a node-centered scheme, cell-centered node-averaging schemes with and without clipping, and cell-centered schemes with unweighted, weighted, and approximately mapped least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Results from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The second class of tests are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes are less accurate, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to the complexity of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping of the surface anisotropy or modifying the scheme stencil to reflect the direction of strong coupling.

Diskin, Boris↗

Transonic flow solutions on general 3D regions using composite-block grids

The construction of computational fluid dynamics (CFD) codes for complicated regions is greatly simplified by a composite-block grid structure since, with the use of a surrounding layer of points on each block, a flow code is then only required basically to operate on rectangular computational regions. The necessary correspondence of points on the surrounding layers (image points) with interior points (object points) is set up by the grid code and made available to the CFD solution code.

Thompson, Joe F.↗

An Approach for Dynamic Grids

An approach is presented for the generation of two-dimensional, structured, dynamic grids. The grid motion may be due to the motion of the boundaries of the computational domain or to the adaptation of the grid to the transient, physical solution. A time-dependent grid is computed through the time integration of the grid speeds which are computed from a system of grid speed equations. The grid speed equations are derived from the time-differentiation of the grid equations so as to ensure that the dynamic grid maintains the desired qualities of the static grid. The grid equations are the Euler-Lagrange equations derived from a variational statement for the grid. The dynamic grid method is demonstrated for a model problem involving boundary motion, an inviscid flow in a converging-diverging nozzle during startup, and a viscous flow over a flat plate with an impinging shock wave. It is shown that the approach is more accurate for transient flows than an approach in which the grid speeds are computed using a finite difference with respect to time of the grid. However, the approach requires significantly more computational effort.

Slater, John W.↗

A CFD study of complex missile and store configurations in relative motion

An investigation was conducted from May 16, 1990 to August 31, 1994 on the development of computational fluid dynamics (CFD) methodologies for complex missiles and the store separation problem. These flowfields involved multiple-component configurations, where at least one of the objects was engaged in relative motion. The two most important issues that had to be addressed were: (1) the unsteadiness of the flowfields (time-accurate and efficient CFD algorithms for the unsteady equations), and (2) the generation of grid systems which would permit multiple and moving bodies in the computational domain (dynamic domain decomposition). The study produced two competing and promising methodologies, and their proof-of-concept cases, which have been reported in the open literature: (1) Unsteady solutions on dynamic, overlapped grids, which may also be perceived as moving, locally-structured grids, and (2) Unsteady solutions on dynamic, unstructured grids.

Baysal, Oktay↗

3D Structured Grid Adaptation

Grid adaptation for structured meshes is the art of using information from an existing, but poorly resolved, solution to automatically redistribute the grid points in such a way as to improve the resolution in regions of high error, and thus the quality of the solution. This involves: (1) generate a grid vis some standard algorithm, (2) calculate a solution on this grid, (3) adapt the grid to this solution, (4) recalculate the solution on this adapted grid, and (5) repeat steps 3 and 4 to satisfaction. Steps 3 and 4 can be repeated until some 'optimal' grid is converged to but typically this is not worth the effort and just two or three repeat calculations are necessary. They also may be repeated every 5-10 time steps for unsteady calculations.

Banks, D. W.↗

Development of generalized block correction procedures for the solution of discretized Navier-Stokes equations

Effort is directed towards developing a solution method which combines advantages of both the iterative and the direct methods. It involves iterative solution on the fine grid, convergence of which is enhanced by a direct solution for correction quantities on a coarse grid. The proposed block correction procedure was applied to compute recirculating flow in a driven cavity.

Kelkar, Kanchan M.↗

Transonic Navier-Stokes flow computations over wing-fuselage geometries

The steady-state transonic viscous flows over two wing-fuselage configurations are solved numerically. The 3D compressible thin-layer Navier-Stokes equations are solved by means of multistage timestepping similar to the Runge-Kutta method. The timestepping technique is applied with a multigrid scheme to make the transonic Navier-Stokes computations using the Baldwin-Lomax turbulence for closure and converging the solution on a grid of 1.52 million grid points with a C-O topology. Both generic and fighter wing-fuselage geometries are solved, and the results are compared to experimental studies. Solution convergence is found to be fast, and the fine grid generates accurate results for both configurations by means of the Baldwin-Lomax turbulence model. Results from the Johnson-King model calculations produce results that are more consistent with experimental results for the fighter configuration.

Agrawal, S.↗