Search NASA⌕ Search

SEARCH · Search NASA

Results for “Multigrid methods”

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 73 records · Page 4

Multigrid method for the equilibrium equations of elasticity using a compact scheme

A compact difference scheme is derived for treating the equilibrium equations of elasticity. The scheme is inconsistent and unstable. A multigrid method which takes into account these properties is described. The solution of the discrete equations, up to the level of discretization errors, is obtained by this method in just two multigrid cycles.

Taasan, Shlomo↗

A multiblock multigrid method for the solution of the three-dimensional Euler equations

A general multiblock, multigrid method for the solution of the Euler equations has been developed. Two types of numerical methods were investigated, van Leer's flux-vector-splitting and Roe's flux-difference-splitting, with MUSCL type differencing used in both methods. An explicit two-step method and a multi-stage Runge-Kutta method have been tested. Results are presented for test cases of a channel flow, nozzle exhaust flow, and a transonic wing.

Cannizzaro, Frank E.↗

Layout optimization with algebraic multigrid methods

Finding the optimal position for the individual cells (also called functional modules) on the chip surface is an important and difficult step in the design of integrated circuits. This paper deals with the problem of relative placement, that is the minimization of a quadratic functional with a large, sparse, positive definite system matrix. The basic optimization problem must be augmented by constraints to inhibit solutions where cells overlap. Besides classical iterative methods, based on conjugate gradients (CG), we show that algebraic multigrid methods (AMG) provide an interesting alternative. For moderately sized examples with about 10000 cells, AMG is already competitive with CG and is expected to be superior for larger problems. Besides the classical 'multiplicative' AMG algorithm where the levels are visited sequentially, we propose an 'additive' variant of AMG where levels may be treated in parallel and that is suitable as a preconditioner in the CG algorithm.

Regler, Hans↗

A multiple-block multigrid method for the solution of the three-dimensional Euler and Navier-Stokes equations

A multiple block multigrid method for the solution of the three dimensional Euler and Navier-Stokes equations is presented. The basic flow solver is a cell vertex method which employs central difference spatial approximations and Runge-Kutta time stepping. The use of local time stepping, implicit residual smoothing, multigrid techniques and variable coefficient numerical dissipation results in an efficient and robust scheme is discussed. The multiblock strategy places the block loop within the Runge-Kutta Loop such that accuracy and convergence are not affected by block boundaries. This has been verified by comparing the results of one and two block calculations in which the two block grid is generated by splitting the one block grid. Results are presented for both Euler and Navier-Stokes computations of wing/fuselage combinations.

Atkins, Harold↗

Numerical study of a multigrid method with four smoothing methods for the incompressible Navier-Stokes equations in general coordinates

The performance of a linear multigrid method using four smoothing methods, called SCGS (Symmetrical Coupled GauBeta-Seidel), CLGS (Collective Line GauBeta-Seidel), SILU (Scalar ILU), and CILU (Collective ILU), is investigated for the incompressible Navier-Stokes equations in general coordinates, in association with Galerkin coarse grid approximation. Robustness and efficiency are measured and compared by application to test problems. The numerical results show that CILU is the most robust, SILU the least, with CLGS and SCGS in between. CLGS is the best in efficiency, SCGS and CILU follow, and SILU is the worst.

Zeng, S.↗

A nonconforming multigrid method using conforming subspaces

For second-order elliptic boundary value problems, we develop a nonconforming multigrid method using the coarser-grid correction on the conforming finite element subspaces. The convergence proof with an arbitrary number of smoothing steps for nu-cycle is presented.

Lee, Chang Ock↗

Multigrid methods for numerical simulation of laminar diffusion flames

This paper documents the result of a computational study of multigrid methods for numerical simulation of 2D diffusion flames. The focus is on a simplified combustion model, which is assumed to be a single step, infinitely fast and irreversible chemical reaction with five species (C3H8, O2, N2, CO2 and H2O). A fully-implicit second-order hybrid scheme is developed on a staggered grid, which is stretched in the streamwise coordinate direction. A full approximation multigrid scheme (FAS) based on line distributive relaxation is developed as a fast solver for the algebraic equations arising at each time step. Convergence of the process for the simplified model problem is more than two-orders of magnitude faster than other iterative methods, and the computational results show good grid convergence, with second-order accuracy, as well as qualitatively agreement with the results of other researchers.

Liu, C.↗

Some Aspects of Multigrid Methods on Non-Structured Meshes

To solve a given fine mesh problem, the design of a multigrid method requires the definition of coarse levels, associated coarse grid operators and inter-grid transfer operators. For non-structured simplified meshes, these definitions can rely on the use of non-nested triangulations. These definitions can also be founded on agglomeration/aggregation techniques in a purely algebraic manner. This paper analyzes these two options, shows the connections of the volume-agglomeration method with algebraic methods and proposes a new definition of prolongation operator suitable for the application of the volume-agglomeration method to elliptic problems.

Guillard, H.↗

A multigrid method for the transonic full potential equation discretized with finite elements on an arbitrary body fitted mesh

A multigrid method for the acceleration of transonic potential flow calculations based on a Galerkin finite element approach is described. In order to allow the use of arbitrary body fitted meshes it is necessary to introduce nonuniform interpolation and residual weighting. Emphasis is put on the construction of these operators consistent with the finite element approximation, while standard successive line overrelaxation is used as a smoothing step. Substantial convergence acceleration is obtained and results are presented for different transonic flow configurations including shocks.

Deconinck, H.↗

A multi-block multigrid method for the solution of the Euler and Navier-Stokes equations for three-dimensional flows

A multi-block multigrid method for the solution of the three-dimensional Euler and Navier-Stokes equations is presented. The basic flow solver is a cell-vertex method which employs central-difference spatial approximations and Runge-Kutta time stepping. The use of local time stepping, implicit residual smoothing, multigrid techniques, and variable-coefficient numerical smoothing results in an efficient and robust scheme. The multi-block strategy places the block loop within the Runge-Kutta loop such that accuracy and convergence are not affected by block boundaries. This has been verified by comparing the results of one- and two-block calculations in which the two-block grid is generated by splitting the one-block grid. Results are presented for both Euler and Navier-Stokes computations of wings and wing-fuselage combinations.

Atkins, H. L.↗

Numerical Study of Multigrid Methods with Various Smoothers for the Elliptical Grid Generation Equations

A robust solver for the elliptic grid generation equations is sought via a numerical study. The system of PDEs is discretized with finite differences, and multigrid methods are applied to the resulting nonlinear algebraic equations. Multigrid iterations are compared with respect to the robustness and efficiency. Different smoothers are tried to improve the convergence of iterations. The methods are applied to four 2D grid generation problems over a wide range of grid distortions. The results of the study help to select smoothing schemes and the overall multigrid procedures for elliptic grid generation.

Golik, W. L.↗

On Efficient Multigrid Methods for Materials Processing Flows with Small Particles

Multiscale modeling of materials requires simulations of multiple levels of structural hierarchy. The computational efficiency of numerical methods becomes a critical factor for simulating large physical systems with highly desperate length scales. Multigrid methods are known for their superior efficiency in representing/resolving different levels of physical details. The efficiency is achieved by employing interactively different discretizations on different scales (grids). To assist optimization of manufacturing conditions for materials processing with numerous particles (e.g., dispersion of particles, controlling flow viscosity and clusters), a new multigrid algorithm has been developed for a case of multiscale modeling of flows with small particles that have various length scales. The optimal efficiency of the algorithm is crucial for accurate predictions of the effect of processing conditions (e.g., pressure and velocity gradients) on the local flow fields that control the formation of various microstructures or clusters.

Thomas, James↗

Numerical solution of flame sheet problems with and without multigrid methods

Flame sheet problems are on the natural route to the numerical solution of multidimensional flames, which, in turn, are important in many engineering applications. In order to model the structure of flames more accurately, we use the vorticity-velocity formulation of the fluid flow equations, as opposed to the streamfunction-vorticity approach. The numerical solution of the resulting nonlinear coupled elliptic partial differential equations involves a pseudo transient process and a steady state Newton iteration. Rather than working with dimensionless variables, we introduce scale factors that can yield significant savings in the execution time. In this context, we also investigate the applicability and performance of several multigrid methods, focusing on nonlinear damped Newton multigrid, using either one way or correction schemes.

Douglas, Craig C.↗

Numerical boundary condition procedures and multigrid methods; Proceedings of the Symposium, NASA Ames Research Center, Moffett Field, CA, October 19-22, 1981

Papers presented in this volume provide an overview of recent work on numerical boundary condition procedures and multigrid methods. The topics discussed include implicit boundary conditions for the solution of the parabolized Navier-Stokes equations for supersonic flows; far field boundary conditions for compressible flows; and influence of boundary approximations and conditions on finite-difference solutions. Papers are also presented on fully implicit shock tracking and on the stability of two-dimensional hyperbolic initial boundary value problems for explicit and implicit schemes.

Source record↗

Multigrid method for a vortex breakdown simulation

An inviscid model for a steady axisymmetric flow with swirl was studied. The governing equation is a nonlinear elliptic equation which has more than one solution for a certain range of the swirl parameter. The physically interesting solutions have closed streamlines that look like vortex breakdown (bubble-like solutions). A multigrid method is used to find these solutions. Using an FMG algorithm (nested iteration), the problem is solved in just a few multigrid cycles.

Taasan, S.↗

An unstructured multigrid method for elliptic problems

A multigrid algorithm for implementation on unstructured meshes is proposed. The algorithm uses a sequence of unnested grids and requires the development of efficient inter-grid interpolation procedures. It is demonstrated how elliptic problems can be solved in this fashion by using Jacobi smoothers.

Lohner, R.↗

Unstructured multigrid methods

The use of the multigrid procedure with a sequence of unnested coarser grids is discussed. Validity of the procedure is assessed by considering the solution of a single linear elliptic equation. It is demonstrated how a scheme with the optimum order of operations can be constructed. Application to the solution of the Euler equations is considered.

Loehner, R.↗

Efficient computation of inviscid flow fields around complex configurations using a multiblock multigrid method

The applicability of a multigrid technique to block-structured, body-fitted meshes is examined focusing on three different strategies. In the first strategy data are exchanged between blocks in each stage of a five-stage Runge-Kutta time-stepping scheme which keeps a possible time lag between blocks to a minimum, but requires a large amount of I/O operations and storage. The second strategy is based on performing a complete Runge-Kutta cycle within a block before switching to the next. In the third strategy both a complete Runge-Kutta cycle and the residual evaluation for the restriction operator are done within a block, allowing a minimum of I/O and storage. The inviscid flow around a wing-body/engine-pylon configuration was computed on a mesh consisting of 11 computational blocks. It was found that both the first and the second strategies delivered converged results, but the third failed due to larger time lag between blocks.

Rossow, C.-C.↗