Search NASA⌕ Search

SEARCH · Search NASA

Results for “Multigrid”

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

A diagonally inverted LU implicit multigrid scheme for the 3-D Navier-Stokes equations and a two equation model of turbulence

An LU implicit multigrid algorithm is developed to calculate 3-D compressible viscous flows. This scheme solves the full 3-D Reynolds-Averaged Navier-Stokes equation with a two-equation kappa-epsilon model of turbulence. The flow equations are integrated by an efficient, diagonally inverted, LU implicit multigrid scheme while the kappa-epsilon equations are solved, uncoupled from the flow equations, by a block LU implicit algorithm. The flow equations are solved within the framework of the multigrid method using a four-grid level W-cycle, while the kappa-epsilon equations are iterated only on the finest grid. This treatment of the Reynolds-Averaged Navier-Stokes equations proves to be an efficient method for calculating 3-D compressible viscous flows.

Yokota, Jeffrey W.↗

Zonal multigrid solution of compressible flow problems on unstructured and adaptive meshes

The simultaneous use of adaptive meshing techniques with a multigrid strategy for solving the 2-D Euler equations in the context of unstructured meshes is studied. To obtain optimal efficiency, methods capable of computing locally improved solutions without recourse to global recalculations are pursued. A method for locally refining an existing unstructured mesh, without regenerating a new global mesh is employed, and the domain is automatically partitioned into refined and unrefined regions. Two multigrid strategies are developed. In the first, time-stepping is performed on a global fine mesh covering the entire domain, and convergence acceleration is achieved through the use of zonal coarse grid accelerator meshes, which lie under the adaptively refined regions of the global fine mesh. Both schemes are shown to produce similar convergence rates to each other, and also with respect to a previously developed global multigrid algorithm, which performs time-stepping throughout the entire domain, on each mesh level. However, the present schemes exhibit higher computational efficiency due to the smaller number of operations on each level.

Mavriplis, Dimitri J.↗

A diagonally inverted LU implicit multigrid scheme for the 3-D Navier-Stokes equations and a two equation model of turbulence

An LU implicit multigrid algorithm is developed to calculate 3-D compressible viscous flows. This scheme solves the full 3-D Reynolds-Averaged Navier-Stokes equation with a two-equation kappa-epsilon model of turbulence. The flow equations are integrated by an efficient, diagonally inverted, LU implicit multigrid scheme while the kappa-epsilon equations are solved, uncoupled from the flow equations, by a block LU implicit algorithm. The flow equations are solved within the framework of the multigrid method using a four-grid level W-cycle, while the kappa-epsilon equations are iterated only on the finest grid. This treatment of the Reynolds-Averaged Navier-Stokes equations proves to be an efficient method for calculating 3-D compressible viscous flows.

Yokota, Jeffrey W.↗

Development of an efficient multigrid code for 3-D Navier-Stokes equations

A multigrid acceleration technique has been developed to solve the three-dimensional Navier-Stokes equations efficiently. An explicit multistage Runge-Kutta type of time-stepping scheme is used as the basic algorithm in conjunction with the multigrid scheme. Solutions for flow over a finite wing have been obtained on extremely fine meshes in order to achieve grid convergence of the solutions. Present solutions indicate that the number of multigrid cycles required to achieve a given level of convergence does not increase with the number of mesh points employed, making it a very attractive scheme for fine meshes.

Vatsa, Veer N.↗

On the parallel efficiency of the Frederickson-McBryan multigrid

To take full advantage of the parallelism in a standard multigrid algorithm requires as many processors as points. However, since coarse grids contain fewer points, most processors are idle during the coarse grid iterations. Frederickson and McBryan claim that retaining all points on all grid levels (using all processors) can lead to a superconvergent algorithm. The purpose of this work is to show that the parellel superconvergent multigrid (PSMG) algorithm of Frederickson and McBryan, though it achieves perfect processor utilization, is no more efficient than a parallel implementation of standard multigrid methods. PSMG is simply a new and perhaps simpler way of achieving the same results.

Decker, Naomi H.↗

Extension of multigrid methodology to supersonic/hypersonic 3-D viscous flows

A multigrid acceleration technique developed for solving 3-D Navier-Stokes equations for subsonic/transonic flows was extended to supersonic/hypersonic flows. An explicit multistage Runge-Kutta type of time stepping scheme is used as the basic algorithm in conjunction with the multigrid scheme. Solutions were obtained for a blunt conical frustum at Mach 6 to demonstrate the applicability of the multigrid scheme to high speed flows. Computations were performed for a generic High Speed Civil Transport configuration designed to cruise at Mach 3. These solutions show both the efficiency and accuracy of the present scheme for computing high speed viscous flows over configurations of practical interest.

Vatsa, Veer N.↗

Convergence acceleration of the Proteus computer code with multigrid methods

Presented here is the first part of a study to implement convergence acceleration techniques based on the multigrid concept in the Proteus computer code. A review is given of previous studies on the implementation of multigrid methods in computer codes for compressible flow analysis. Also presented is a detailed stability analysis of upwind and central-difference based numerical schemes for solving the Euler and Navier-Stokes equations. Results are given of a convergence study of the Proteus code on computational grids of different sizes. The results presented here form the foundation for the implementation of multigrid methods in the Proteus code.

Demuren, A. O.↗

Parallel computing strategies for block multigrid implicit solution of the Euler equations

A multigrid diagonal implicit algorithm has been developed to solve the three-dimensional Euler equations of inviscid compressible flow on block-structured grids. An improved method of advancing the multigrid cycle has been examined with respect to convergence rates, accuracy, and efficiency. In this method, the multigrid cycle is advanced independently in each of the blocks, and the information exchange between the blocks is done using buffer arrays, allowing for the asynchronous updating of interface boundary conditions. This updating scheme is used to eliminate the convergence problems found in a previous implementation of the algorithm while retaining its potential for efficient parallel execution. Results are computed for transonic flows past wings and include pressure distributions to verify the accuracy of the scheme and convergence histories to demonstrate the efficiency of the method. Efficiencies that were obtained using a modest number of processors in parallel are also presented and discussed.

Yadlin, Yoram↗

On waveform multigrid method

Waveform multigrid method is an efficient method for solving certain classes of time dependent PDEs. This paper studies the relationship between this method and the analogous multigrid method for steady-state problems. Using a Fourier-Laplace analysis, practical convergence rate estimates of the waveform multigrid iterations are obtained. Experimental results show that the analysis yields accurate performance prediction.

Taasan, Shlomo↗

An implicit multigrid scheme for hypersonic strong-interaction flowfields

An implicit multigrid method for the compressible Navier-Stokes equations is applied to a series of two-dimensional, steady, laminar hypersonic flows over a compression ramp, including both attached and separated flow conditions. The algorithm uses upwind-biased differencing for the convective and pressure terms and central differencing for the shear-stress and heat-transfer terms. An implicit spatially factored scheme is used to advance the solution in terms on a given mesh, and a V-cycle multigrid strategy is used to accelerate convergence. The multigrid algorithm provided an order of magnitude decrease in the computational time required to obtain a converged position of the separation location and enabled a substantially grid-independent result to be obtained for each of the flows considered.

Thomas, James L.↗

Application of the multigrid solution technique to hypersonic entry vehicles

A multigrid solution procedure has been incorporated in a version of the Langley Aerothermodynamic Upwind Relaxation Algorithm. The multigrid scheme is based on the Full Approximation Storage approach and uses Full Multigrid to obtain a well defined fine mesh starting solution. Predictions were obtained using standard transfer operators and a 'V-cycle' was used to control grid sequencing. Computed hypersonic flow solutions compared with experimental data for a 15 degree sphere cone, blended-wing body, and shuttle-like geometries are presented. It is shown that the algorithm accurately predicts heating rates, and when compared with the single grid algorithm computes solutions in one-third the computational time.

Greene, Francis A.↗

Multigrid methods and high order finite difference for flow in transition - Effects of isolated and distributed roughness elements

The high order finite difference and multigrid methods have been successfully applied to direct numerical simulation (DNS) for flow transition in 3D channels and 3D boundary layers with 2D and 3D isolated and distributed roughness in a curvilinear coordinate system. A fourth-order finite difference technique on stretched and staggered grids, a fully-implicit time marching scheme, a semicoarsening multigrid method associated with line distributive relaxation scheme, and a new treatment of the outflow boundary condition, which needs only a very short buffer domain to damp all wave reflection, are developed. These approaches make the multigrid DNS code very accurate and efficient. This makes us not only able to do spatial DNS for the 3D channel and flat plate at low computational costs, but also able to do spatial DNS for transition in the 3D boundary layer with 3D single and multiple roughness elements. Numerical results show good agreement with the linear stability theory, the secondary instability theory, and a number of laboratory experiments.

Liu, C.↗

Multigrid convergence of an implicit symmetric relaxation scheme

Multigrid has been applied to an existing three-dimensional compressible Euler solver to accelerate the convergence of the implicit symmetric relaxation scheme. This lower-upper symmetric Gauss-Seidel implicit scheme is shown to be an effective multigrid driver in three-dimensions. A grid refinement study is performed including the effects of large cell aspect ratio meshes. Performance figures of the present multigrid code on Cray computers including the new C90 are presented. A reduction of three orders of of magnitude in the residual for a three-dimensional transonic inviscid flow using 920K grid points is obtained in less than 4 minutes on a Cray C90.

Yoon, Seokkwan↗

Multiblock, Multigrid Solution Of Euler Equations

Method of numerical solution of Euler equations of three-dimensional flow of compressible fluid involves combination of multiblock and multigrid strategies. In multiblock strategy, flow field divided, into multiple smaller, more computationally-convenient zones and computational grid fitted to applicable flow boundaries generated in each block. In multigrid strategy used here, different quantities computed, variously, on finer or coarser grids. Minimizing cost of computation by using fewest grid points yielding acceptably accurate values of affected variable. Multigrid strategy found effective in accelerating convergence to steady state, while multiblock strategy provides geometric flexibility.

Melson, N. Duane↗

A multigrid solver for the semiconductor equations

We present a multigrid solver for the exponential fitting method. The solver is applied to the current continuity equations of semiconductor device simulation in two dimensions. The exponential fitting method is based on a mixed finite element discretization using the lowest-order Raviart-Thomas triangular element. This discretization method yields a good approximation of front layers and guarantees current conservation. The corresponding stiffness matrix is an M-matrix. 'Standard' multigrid solvers, however, cannot be applied to the resulting system, as this is dominated by an unsymmetric part, which is due to the presence of strong convection in part of the domain. To overcome this difficulty, we explore the connection between Raviart-Thomas mixed methods and the nonconforming Crouzeix-Raviart finite element discretization. In this way we can construct nonstandard prolongation and restriction operators using easily computable weighted L(exp 2)-projections based on suitable quadrature rules and the upwind effects of the discretization. The resulting multigrid algorithm shows very good results, even for real-world problems and for locally refined grids.

Bachmann, Bernhard↗

Compressible turbulent flow simulation with a multigrid multiblock method

We describe a multigrid multiblock method for compressible turbulent flow simulations and present results obtained from calculations on a two-element airfoil. A vertex-based spatial discretization method and explicit multistage Runge-Kutta time-stepping are used. The slow convergence of a single grid method makes the multigrid method, which yields a speed factor of about 20, indispensable. The numerical predictions are in good agreement with experimental results. It is shown that the convergence of the multigrid process depends considerably on the ordering of the various loops. If the block loop is put inside the stage loop, the process converges more rapidly than if the block loop is situated outside the stage loop when a three-stage Runge-Kutta method is used. If a five-stage scheme is used, the process does not converge in the latter block ordering. Finally, the process based on the five-stage method is about 60 percent more efficient than with the three-stage method, if the block loop is inside the stage loop.

Kuerten, Hans↗

Multigrid convergence of an implicit symmetric relaxation scheme

The multigrid method has been applied to an existing three-dimensional compressible Euler solver to accelerate the convergence of the implicit symmetric relaxation scheme. This lower-upper symmetric Gauss-Seidel implicit scheme is shown to be an effective multigrid driver in three dimensions. A grid refinement study is performed including the effects of large cell aspect ratio meshes. Performance figures of the present multigrid code on Cray computers including the new C90 are presented. A reduction of three orders of magnitude in the residual for a three-dimensional transonic inviscid flow using 920 k grid points is obtained in less than 4 min on a Cray C90.

Yoon, Seokkwan↗

Multigrid Methods for EHL Problems

In many bearings and contacts, forces are transmitted through thin continuous fluid films which separate two contacting elements. Objects in contact are normally subjected to friction and wear which can be reduced effectively by using lubricants. If the lubricant film is sufficiently thin to prevent the opposing solids from coming into contact and carries the entire load, then we have hydrodynamic lubrication, where the lubricant film is determined by the motion and geometry of the solids. However, for loaded contacts of low geometrical conformity, such as gears, rolling contact bearings and cams, this is not the case due to high pressures and this is referred to as Elasto-Hydrodynamic Lubrication (EHL) In EHL, elastic deformation of the contacting elements and the increase in fluid viscosity with pressure are very significant and cannot be ignored. Since the deformation results in changing the geometry of the lubricating film, which in turn determines the pressure distribution, an EHL mathematical model must simultaneously satisfy the complex elasticity (integral) and the Reynolds lubrication (differential) equations. The nonlinear and coupled nature of the two equations makes numerical calculations computationally intensive. This is especially true for highly loaded problems found in practice. One novel feature of these problems is that the solution may exhibit sharp pressure spikes in the outlet region. To this date both finite element and finite difference methods have been used to solve EHL problems with perhaps greater emphasis on the use of the finite difference approach. In both cases, a major computational difficulty is ensuring convergence of the nonlinear equations solver to a steady state solution. Two successful methods for achieving this are direct iteration and multigrid methods. Direct iteration methods (e.g Gauss Seidel) have long been used in conjunction with finite difference discretizations on regular meshes. Perhaps one of the best examples of the application of such methods is the recent Effective Influence Method of Dowson and Wang. Multigrid methods have also been used with great success by Venner and Venner and Lubrecht with a good summary being given by Venner. As both these finite difference discretization based approaches appear to provide an efficient way of solving EHL problems, it is important to understand their relative merits. This paper is a first attempt at providing such an understanding in the context of EHL point contact problem, (contact of two spheres), in which the contact zone is a point and an ellipse or circle for unloaded and loaded dry contacts respectively. Since the film thickness and the contact width are generally small compared to the local radius of curvature of the two surfaces, the reduced geometry of the surfaces in the contact area can be accurately approximated to the contact between a paraboloid and a flat surface. The layout of the remainder of this paper is as follows. In section 2 we introduce the form of the equations to be solved. The Effective Influence Newton Method is described in Section 3 while Section 4 describes the Multigrid method to be used. Sections 5 and 6 describe the test problems to be used in the comparison between the two methods and compare the performance of the two methods. Section 7 concludes the paper with an argument of the two methods and suggests some future research directions.

Nurgat, Elyas↗