Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “coarse-grid.”

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 19 records

Cost-effective accurate coarse-grid method for highly convective multidimensional unsteady flows

A fundamentally multidimensional convection scheme is described based on vector transient interpolation modeling rewritten in conservative control-volume form. Vector third-order upwinding is used as the basis of the algorithm; this automatically introduces important cross-difference terms that are absent from schemes using component-wise one-dimensional formulas. Third-order phase accuracy is good; this is important for coarse-grid large-eddy or full simulation. Potential overshoots or undershoots are avoided by using a recently developed universal limiter. Higher order accuracy is obtained locally, where needed, by the cost-effective strategy of adaptive stencil expansion in a direction normal to each control-volume face; this is controlled by monitoring the absolute normal gradient and curvature across the face. Higher (than third) order cross-terms do not appear to be needed. Since the wider stencil is used only in isolated narrow regions (near discontinuities), extremely high (in this case, seventh) order accuracy can be achieved for little more than the cost of a globally third-order scheme.

Leonard, B. P.↗

A coarse-grid correction/nonlinear relaxation algorithm for the three-dimensional, compressible Navier-Stokes equations

A combined coarse-grid correction/upwind relaxation strategy to provide rapid convergence for 3D high-speed viscous flowfields is discussed an evaluated. The construction and analysis of a simple two-grid acceleration procedure based on 'hyperbolic' multigrid concepts is presented. Numerical simulations of a 2D compression-corner flowfield, a 3D crossing shock/turbulent boundary layer interaction, and a 3D scramjet inlet flowfield are presented to illustrate the benefits of the approach. Results indicate that the procedure generally converges two or more times faster than the baseline algorithm.

Edwards, Jack R.↗

Multi-grid domain decomposition approach for solution of Navier-Stokes equations in primitive variable form

The new multigrid (or adaptive) pseudospectral element method was carried out for the solution of incompressible flow in terms of primitive variable formulation. The desired features of the proposed method include the following: (1) the ability to treat complex geometry; (2) high resolution adapted in the interesting areas; (3) requires minimal working space; and (4) effective in a multiprocessing environment. The approach for flow problems, complex geometry or not, is to first divide the computational domain into a number of fine-grid and coarse-grid subdomains with the inter-overlapping area. Next, it is necessary to implement the Schwarz alternating procedure (SAP) to exchange the data among subdomains, where the coarse-grid correction is used to remove the high frequency error that occurs when the data interpolation from the fine-grid subdomain to the coarse-grid subdomain is conducted. The strategy behind the coarse-grid correction is to adopt the operator of the divergence of the velocity field, which intrinsically links the pressure equation, into this process. The solution of each subdomain can be efficiently solved by the direct (or iterative) eigenfunction expansion technique with the least storage requirement, i.e. O(N(exp 3)) in 3-D and O(N(exp 2)) in 2-D. Numerical results of both driven cavity and jet flow will be presented in the paper to account for the versatility of the proposed method.

Ku, Hwar-Ching↗

Analysis of a parallel multigrid algorithm

This paper considers the parallel multigrid algorithm of Frederickson and McBryan (1987). This algorithm uses multiple coarse-grid problems (instead of one) in the hope of accelerating convergence, and is found to have a close relationship to traditional multigrid methods. Specifically, the parallel coarse-grid correction operator is identical to a traditional multigrid coarse-grid correction operator, except that the mixing of high and low frequencies caused by aliasing error is removed. Appropriate relaxation operators can be chosen to take advantage of this property. Comparisons between the standard multigrid and the new method are made.

Chan, Tony F.↗

Analysis of a parallel multigrid algorithm

The parallel multigrid algorithm of Frederickson and McBryan (1987) is considered. This algorithm uses multiple coarse-grid problems (instead of one problem) in the hope of accelerating convergence and is found to have a close relationship to traditional multigrid methods. Specifically, the parallel coarse-grid correction operator is identical to a traditional multigrid coarse-grid correction operator, except that the mixing of high and low frequencies caused by aliasing error is removed. Appropriate relaxation operators can be chosen to take advantage of this property. Comparisons between the standard multigrid and the new method are made.

Chan, Tony F.↗

Multigrid solvers on parallel computers

Massively parallel computers, as considered in this investigation, are not yet available. However, a large-scale parallel computer cannot usefully be designed before the hypothetical algorithms which will employ it are studied. Most of the studies of parallel partial differential equations (PDE) solvers are based on solution techniques much slower (on sequential machines) than multigrid methods. Multigrid methods are highly parallelizable. Each of their processes can simultaneously be performed at all grid points. The present investigation is concerned with a preliminary exploration of the potential of multigrid, or, more generally, Multi-Level Adaptive Techniques (MLAT) on computers with many processors. Basic processes are considered, taking into account coarse-grid approximation, relaxation, coarse-grid corrections, full multigrid algorithms, nonlinear problems and eigenvalue problems, fine-to-coarse correction, and chains of problems. Details of parallel multigrid processing are also examined.

Brandt, A.↗

Grid refinement studies of turbine rotor-stator interaction

Results from a three-dimensional, time-accurate Navier-Stokes simulation of rotor-stator interaction in an axial turbine stage are presented. The present study uses a fine grid in the spanwise direction to better resolve endwall and tip cllearance effects and complements coarse-grid calculations that were reported earlier. A realistic turbine stage with 22 stator vanes and 28 rotor blades is simulated as a single-stator, single-rotor airfoil combination with the stator geometry modified to properly account for blockage effects. This is in contrast to the earlier coarse-grid calculations where the rotor geometry was modified. The improved grid resolution and the unmodified rotor geometry result in a more accurate simulation of the flow field, particularly in the rotor channel where the interaction effects are more severe. The numerical results are compared to experimental data wherever possible and to earlier calculations.

Madavan, N. K.↗

Convergence acceleration of viscous flow computations

A multiple-grid convergence acceleration technique introduced for application to the solution of the Euler equations by means of Lax-Wendroff algorithms is extended to treat compressible viscous flow. Computational results are presented for the solution of the thin-layer version of the Navier-Stokes equations using the explicit MacCormack algorithm, accelerated by a convective coarse-grid scheme. Extensions and generalizations are mentioned.

Johnson, G. M.↗

Multiple-grid convergence acceleration of viscous and inviscid flow computations

A multiple-grid algorithm for use in efficiently obtaining steady solution to the Euler and Navier-Stokes equations is presented. The convergence of a simple, explicit fine-grid solution procedure is accelerated on a sequence of successively coarser grids by a coarse-grid information propagation method which rapidly eliminates transients from the computational domain. This use of multiple-gridding to increase the convergence rate results in substantially reduced work requirements for the numerical solution of a wide range of flow problems. Computational results are presented for subsonic and transonic inviscid flows and for laminar and turbulent, attached and separated, subsonic viscous flows. Work reduction factors as large as eight, in comparison to the basic fine-grid algorithm, were obtained. Possibilities for further performance improvement are discussed.

Johnson, G. M.↗

Spectral multigrid methods for elliptic equations 2

A detailed description of spectral multigrid methods is provided. This includes the interpolation and coarse-grid operators for both periodic and Dirichlet problems. The spectral methods for periodic problems use Fourier series and those for Dirichlet problems are based upon Chebyshev polynomials. An improved preconditioning for Dirichlet problems is given. Numerical examples and practical advice are included.

Zang, T. A.↗

Multiple-grid convergence acceleration of viscous and inviscid flow computations

A multiple-grid algorithm for use in efficiently obtaining steady solution to the Euler and Navier-Stokes equations is presented. The convergence of a simple, explicit fine-grid solution procedure is accelerated on a sequence of successively coarser grids by a coarse-grid information propagation method which rapidly eliminates transients from the computational domain. This use of multiple-gridding to increase the convergence rate results is substantially reduced work requirements for the numerical solution of a wide range of flow problems. Computational results are presented for subsonic and transonic inviscid flows and for laminar and turbulent, attached and separated, subsonic viscous flows. Work reduction factors as large as eight, in comparison to the basic fine-grid algorithm, were obtained. Possibilities for further performance improvement are discussed. Previously announced in STAR as N83-21847

Johnson, G. M.↗

Spectral multigrid methods for elliptic equations II

A detailed description of spectral multigrid methods is provided. This includes the interpolation and coarse-grid operators for both periodic and Dirichlet problems. The spectral methods for periodic problems use Fourier series and those for Dirichlet problems are based upon Chebyshev polynomials. An improved preconditioning for Dirichlet problems is given. Numerical examples and practical advice are included.

Zang, T. A.↗

Multigrid method for nearly singular and slightly indefinite problems

This paper deals with nearly singular, possibly indefinite problems for which the usual multigrid solvers converge very slowly or even diverge. The main difficulty is related to some badly approximated smooth functions which correspond to eigenfunctions with nearly zero eigenvalues. A correction to the usual coarse-grid equations is derived, both in the correction scheme and in the full approximation scheme. The performance of the new algorithm using this correction is essentially as that of usual multigrid for definite problems.

Brandt, A.↗

Euler solutions using an implicit multigrid technique

A coarse-grid correction algorithm has been implemented into an implicit upwind Euler solver and tested for transonic airfoil problems. The Euler solver uses split-flux formulation and penta-diagonal scalar equations, respectively, for the explicit and implicit operators. The multigrid sequence starts at the fine grid level, then steps down to each coarse grid level to smooth error components using implicit operators. Estimate of residuals can be obtained by two approaches, which differ in the level where the residuals are collected. Both approaches will lead to a work reduction factor of 12 for a Mach 0.75 flow at 2 degrees incidence on a 65x26 grid. The work reduction factor is found to increase proportional to the number of grid levels.

Li, Chien-Peng↗

Multigrid method for nearly singular and slightly indefinite problems

This paper deals with nearly singular, possibly indefinite problems for which the usual multigrid solvers converge very slowly or even diverge. The main difficulty is related to some badly approximated smooth functions which correspond to eigenfunctions with nearly zero eigenvalues. A correction to the usual coarse-grid equations is derived, both in the correction scheme and in the full approximation scheme. The performance of the new algorithm using this correction is essentially as that of usual multigrid for definite problems.

Brandt, A.↗

Navier-Stokes computation of flow around a round-edged double-delta wing

Computations of three-dimensional vortical flows over a thin round-edged double-delta wing with an aspect ratio of 2.05 are performed using an implicit upwind-relaxation finite-difference scheme. The effects of grid and angle of attack on the Navier-Stokes computations are studied. Coarse-grid calculations can not predict the detailed structures of the vortical flowfields for lack of grid resolution. On the contrary, fine-grid computations show that key features of vortex formation, interaction, and breakdown are simulated. Furthermore, computed lift coefficients and spanswise surface static pressure distributions are in good agreement with the experimental data up to alpha = 25 deg.

Hsu, C.-H.↗

Solution of the Neumann pressure problem in general orthogonal coordinates using the multigrid technique

The multigrid (MG) technique has been advanced for use with Neumann boundary-value problems in clustered curvilinear orthogonal coordinates. This comprises an important step in the analysis of incompressible flow using the velocity-pressure formulation of the Navier-Stokes equations. The finite-difference representation of the problem and the formulation of the restriction and coarse-grid correction operators are examined in detail. Maintaining consistency between these and the integral constraint associated with the Neumann problem is found to be critical for the success of the MG technique. The influence of the smoothing operator is examined by employing Gauss-Seidel, alternating-direction implicit, and strongly implicit techniques. The MG procedure enhances the efficiency of fine-grid solutions of the Neumann problem by a factor of 3 to 14, depending on the type of smoothing operator employed and the values of the problem parameters.

Ghia, U.↗

Supercomputer applications in gas turbine flowfield simulation

The numerical simulation of the unsteady three-dimensional viscous flow in a gas turbine stage is considered. Results from a three-dimensional time-accurate Navier-Stokes simulation of rotor-stator interaction in an axial turbine stage are presented. The present study uses a fine grid in the spanwise direction to better resolve the complex three-dimensional flowfield, and complements earlier reported coarse-grid calculations. Several different features of the flowfield are analyzed and compared to earlier calculations and to experimental data whenever possible. Computer animation techniques are used to visualize various unsteady three-dimensional features of the flow. The results demonstrate the capabilities of current computing hardware in obtaining accurate simulations of unsteady flows in turbomachines.

Madavan, Nateri K.↗