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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17

All sources NASA NTRS DOE OSTI

NASA NTRS1993

Multigrid direct numerical simulation of the whole process of flow transition in 3-D boundary layers

A new technology was developed in this study which provides a successful numerical simulation of the whole process of flow transition in 3-D boundary layers, including linear growth, secondary instability, breakdown, and transition at relatively low CPU cost. Most other spatial numerical simulations require high CPU cost and blow up at the stage of flow breakdown. A fourth-order finite difference scheme on stretched and staggered grids, a fully implicit time marching technique, a semi-coarsening multigrid based on the so-called approximate line-box relaxation, and a buffer domain for the outflow boundary conditions were all used for high-order accuracy, good stability, and fast convergence. A new fine-coarse-fine grid mapping technique was developed to keep the code running after the laminar flow breaks down. The computational results are in good agreement with linear stability theory, secondary instability theory, and some experiments. The cost for a typical case with 162 x 34 x 34 grid is around 2 CRAY-YMP CPU hours for 10 T-S periods.

Liu, Chaoqun↗

NASA NTRS1993

Analysis of multigrid methods on massively parallel computers: Architectural implications

We study the potential performance of multigrid algorithms running on massively parallel computers with the intent of discovering whether presently envisioned machines will provide an efficient platform for such algorithms. We consider the domain parallel version of the standard V cycle algorithm on model problems, discretized using finite difference techniques in two and three dimensions on block structured grids of size 10(exp 6) and 10(exp 9), respectively. Our models of parallel computation were developed to reflect the computing characteristics of the current generation of massively parallel multicomputers. These models are based on an interconnection network of 256 to 16,384 message passing, 'workstation size' processors executing in an SPMD mode. The first model accomplishes interprocessor communications through a multistage permutation network. The communication cost is a logarithmic function which is similar to the costs in a variety of different topologies. The second model allows single stage communication costs only. Both models were designed with information provided by machine developers and utilize implementation derived parameters. With the medium grain parallelism of the current generation and the high fixed cost of an interprocessor communication, our analysis suggests an efficient implementation requires the machine to support the efficient transmission of long messages, (up to 1000 words) or the high initiation cost of a communication must be significantly reduced through an alternative optimization technique. Furthermore, with variable length message capability, our analysis suggests the low diameter multistage networks provide little or no advantage over a simple single stage communications network.

Matheson, Lesley R.↗

NASA NTRS1993

Time-accurate Navier-Stokes calculations with multigrid acceleration

A numerical scheme to solve the unsteady Navier-Stokes equations is described. The scheme is implemented by modifying the multigrid-multiblock version of the steady Navier-Stokes equations solver, TLNS3D. The scheme is fully implicit in time and uses TLNS3D to iteratively invert the equations at each physical time step. The design objective of the scheme is unconditional stability (at least for first- and second-order discretizations of the physical time derivatives). With unconditional stability, the choice of the time step is based on the physical phenomena to be resolved rather than limited by numerical stability which is especially important for high Reynolds number viscous flows, where the spatial variation of grid cell size can be as much as six orders of magnitude. An analysis of the iterative procedure and the implementation of this procedure in TLNS3D are discussed. Numerical results are presented to show both the capabilities of the scheme and its speed up relative to the use of global minimum time stepping. Reductions in computational times of an order of magnitude are demonstrated.

Melson, N. Duane↗

NASA NTRS1993

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↗

NASA NTRS1993

On the prediction of multigrid efficiency through local mode analysis

A single grid local mode analysis is used to predict the smoothing properties of numerical schemes for solving the Navier-Stokes equations with factorization based on Stone's Strongly Implicit Method. Four difference approximations for the convection terms are considered, namely, hybrid, central, second-order upwind, and third-order upwind. Smoothing factors from the analysis are compared with practical convergence factors in a multigrid method for flow over a backward facing step and it is found that the local mode analysis correctly predicts the effects of Reynolds number and higher-order schemes.

Wilson, R. V.↗

NASA NTRS1993

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

NASA NTRS1993

Multigrid and cyclic reduction applied to the Helmholtz equation

We consider the Helmholtz equation with a discontinuous complex parameter and inhomogeneous Dirichlet boundary conditions in a rectangular domain. A variant of the direct method of cyclic reduction (CR) is employed to facilitate the design of improved multigrid (MG) components, resulting in the method of CR-MG. We demonstrate the improved convergence properties of this method.

Brackenridge, Kenneth↗

NASA NTRS1993

Multigrid methods for differential equations with highly oscillatory coefficients

New coarse grid multigrid operators for problems with highly oscillatory coefficients are developed. These types of operators are necessary when the characters of the differential equations on coarser grids or longer wavelengths are different from that on the fine grid. Elliptic problems for composite materials and different classes of hyperbolic problems are practical examples. The new coarse grid operators can be constructed directly based on the homogenized differential operators or hierarchically computed from the finest grid. Convergence analysis based on the homogenization theory is given for elliptic problems with periodic coefficients and some hyperbolic problems. These are classes of equations for which there exists a fairly complete theory for the interaction between shorter and longer wavelengths in the problems. Numerical examples are presented.

Engquist, Bjorn↗

NASA NTRS1993

Relaxation schemes for Chebyshev spectral multigrid methods

Two relaxation schemes for Chebyshev spectral multigrid methods are presented for elliptic equations with Dirichlet boundary conditions. The first scheme is a pointwise-preconditioned Richardson relaxation scheme and the second is a line relaxation scheme. The line relaxation scheme provides an efficient and relatively simple approach for solving two-dimensional spectral equations. Numerical examples and comparisons with other methods are given.

Kang, Yimin↗

NASA NTRS1993

Multigrid methods for a semilinear PDE in the theory of pseudoplastic fluids

We show that by certain transformations the boundary layer equations for the class of non-Newtonian fluids named pseudoplastic can be generalized in the form the vector differential operator(u) + p(x)u(exp -lambda) = 0, where x is a member of the set Omega and Omega is a subset of R(exp n), n is greater than or equal to 1 under the classical conditions for steady flow over a semi-infinite flat plate. We provide a survey of the existence, uniqueness, and analyticity of the solutions for this problem. We also establish numerical solutions in one- and two-dimensional regions using multigrid methods.

Henson, Van Emden↗

NASA NTRS1993

A comparison of locally adaptive multigrid methods: LDC, FAC and FIC

This study is devoted to a comparative analysis of three 'Adaptive ZOOM' (ZOom Overlapping Multi-level) methods based on similar concepts of hierarchical multigrid local refinement: LDC (Local Defect Correction), FAC (Fast Adaptive Composite), and FIC (Flux Interface Correction)--which we proposed recently. These methods are tested on two examples of a bidimensional elliptic problem. We compare, for V-cycle procedures, the asymptotic evolution of the global error evaluated by discrete norms, the corresponding local errors, and the convergence rates of these algorithms.

Khadra, Khodor↗

NASA NTRS1993

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↗

NASA NTRS1993

Multigrid method for integral equations and automatic programs

Several iterative algorithms based on multigrid methods are introduced for solving linear Fredholm integral equations of the second kind. Automatic programs based on these algorithms are introduced using Simpson's rule and the piecewise Gaussian rule for numerical integration.

Lee, Hosae↗

NASA NTRS1994

Canonical-variables multigrid method for steady-state Euler equations

A novel approach for the solution of inviscid flow problems for subsonic compressible flows is described. The approach is based on canonical forms of the equations, in which subsystems governed by hyperbolic operators are separated from those governed by elliptic ones. The discretizations used as well as the iterative techniques for the different subsystems are inherently different. Hyperbolic parts, which describe, in general, propagation phenomena, are discretized using upwind schemes and are solved by marching techniques. Elliptic parts, which are directionally unbiased, are discretized using h-elliptic central discretizations, and are solved by pointwise relaxations together with coarse grid acceleration. The resulting discretization schemes introduce artificial viscosity only for the hyperbolic parts of the system; thus a smaller total artificial viscosity is used, while the multigrid solvers used are much more efficient. Solutions of the subsonic compressible Euler equations are achieved at the same efficiency as the full potential equation.

Taasan, Shlomo↗

NASA NTRS1994

A three dimensional multigrid Reynolds-averaged Navier-Stokes solver for unstructured meshes

A three-dimensional unstructured mesh Reynolds averaged Navier-Stokes solver is described. Turbulence is simulated using a single field-equation model. Computational overheads are minimized through the use of a single edge-based data-structure, and efficient multigrid solution technique, and the use of multi-tasking on shared memory multi-processors. The accuracy and efficiency of the code are evaluated by computing two-dimensional flows in three dimensions and comparing with results from a previously validated two-dimensional code which employs the same solution algorithm. The feasibility of computing three-dimensional flows on grids of several million points in less than two hours of wall clock time is demonstrated.

Mavriplis, D. J.↗

NASA NTRS1994

Multigrid one shot methods for optimal control problems: Infinite dimensional control

The multigrid one shot method for optimal control problems, governed by elliptic systems, is introduced for the infinite dimensional control space. ln this case, the control variable is a function whose discrete representation involves_an increasing number of variables with grid refinement. The minimization algorithm uses Lagrange multipliers to calculate sensitivity gradients. A preconditioned gradient descent algorithm is accelerated by a set of coarse grids. It optimizes for different scales in the representation of the control variable on different discretization levels. An analysis which reduces the problem to the boundary is introduced. It is used to approximate the two level asymptotic convergence rate, to determine the amplitude of the minimization steps, and the choice of a high pass filter to be used when necessary. The effectiveness of the method is demonstrated on a series of test problems. The new method enables the solutions of optimal control problems at the same cost of solving the corresponding analysis problems just a few times.

Arian, Eyal↗

NASA NTRS1994

Analysis and design of numerical schemes for gas dynamics 1: Artificial diffusion, upwind biasing, limiters and their effect on accuracy and multigrid convergence

The theory of non-oscillatory scalar schemes is developed in this paper in terms of the local extremum diminishing (LED) principle that maxima should not increase and minima should not decrease. This principle can be used for multi-dimensional problems on both structured and unstructured meshes, while it is equivalent to the total variation diminishing (TVD) principle for one-dimensional problems. A new formulation of symmetric limited positive (SLIP) schemes is presented, which can be generalized to produce schemes with arbitrary high order of accuracy in regions where the solution contains no extrema, and which can also be implemented on multi-dimensional unstructured meshes. Systems of equations lead to waves traveling with distinct speeds and possibly in opposite directions. Alternative treatments using characteristic splitting and scalar diffusive fluxes are examined, together with modification of the scalar diffusion through the addition of pressure differences to the momentum equations to produce full upwinding in supersonic flow. This convective upwind and split pressure (CUSP) scheme exhibits very rapid convergence in multigrid calculations of transonic flow, and provides excellent shock resolution at very high Mach numbers.

Jameson, Antony↗

NASA NTRS1994

Multigrid techniques for nonlinear eigenvalue probems: Solutions of a nonlinear Schroedinger eigenvalue problem in 2D and 3D

This paper presents multigrid (MG) techniques for nonlinear eigenvalue problems (EP) and emphasizes an MG algorithm for a nonlinear Schrodinger EP. The algorithm overcomes the mentioned difficulties combining the following techniques: an MG projection coupled with backrotations for separation of solutions and treatment of difficulties related to clusters of close and equal eigenvalues; MG subspace continuation techniques for treatment of the nonlinearity; an MG simultaneous treatment of the eigenvectors at the same time with the nonlinearity and with the global constraints. The simultaneous MG techniques reduce the large number of self consistent iterations to only a few or one MG simultaneous iteration and keep the solutions in a right neighborhood where the algorithm converges fast.

Costiner, Sorin↗