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 235 records · Page 13

All sources NASA NTRS DOE OSTI

NASA NTRS1987

Multigrid applied to singular perturbation problems

The solution of the singular perturbation problem by a multigrid algorithm is considered. Theoretical and experimental results for a number of different discretizations are presented. The theoretical and observed rates agree with the results developed in an earlier work of Kamowitz and Parter. In addition, the rate of convergence of the algorithm when the coarse grid operator is the natural finite difference analog of the fine grid operator is presented. This is in contrast to the case in the previous work where the Galerkin choice (I sup H sub h L sub h,I sup h sub H) was used for the coarse grid operators.

Kamowitz, David↗

NASA NTRS1987

Eigensystem analysis of classical relaxation techniques with applications to multigrid analysis

Classical relaxation techniques are related to numerical methods for solution of ordinary differential equations. Eigensystems for Point-Jacobi, Gauss-Seidel, and SOR methods are presented. Solution techniques such as eigenvector annihilation, eigensystem mixing, and multigrid methods are examined with regard to the eigenstructure.

Lomax, Harvard↗

NASA NTRS1987

Spectral multigrid methods for the solution of homogeneous turbulence problems

New three-dimensional spectral multigrid algorithms are analyzed and implemented to solve the variable coefficient Helmholtz equation. Periodicity is assumed in all three directions which leads to a Fourier collocation representation. Convergence rates are theoretically predicted and confirmed through numerical tests. Residual averaging results in a spectral radius of 0.2 for the variable coefficient Poisson equation. In general, non-stationary Richardson must be used for the Helmholtz equation. The algorithms developed are applied to the large-eddy simulation of incompressible isotropic turbulence.

Erlebacher, G.↗

NASA NTRS1986

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problem preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗

NASA NTRS1986

Unstructured multigrid methods for the compressible Euler equations

A two-step explicit finite element based solution procedure for the compressible Euler equations is described. Convergence to steady state can be accelerated by using a multigrid technique. The geometric flexibility of the finite element method is retained by using a sequence of unnested grids. The viability of this approach is demonstrated for elliptic problems and initial experiences with the technique applied to the Euler equations are reported.

Loehner, R.↗

NASA NTRS1986

Application of data flow concepts to a multigrid solver for the Euler equations

In this study a multigrid solver for Euler equations (FLO52R) was examined to determine its performance potential on a hypothetical computer using a data flow architecture. The proposed computer would require massive parallelism to realize its design performance. On the other hand this parallelism would be more easily realized than with a conventional vector processor such as the Cray-1S. Several changes to the proposed design substantially alleviated most of the remaining bottlenecks to parallel processing. Other changes allowed clearer definition of memory access and disk I/O. Finally, a portion of the algorithm was rewritten to improve parallel performance. With these changes, performance levels approaching that of a Cray-1S may be possible for a computer costing far less. Estimates are given for overall speed, memory, and network bandwidth, and for instruction memory requirements.

Merriam, M. L.↗

NASA NTRS1986

On spectral multigrid methods for the time-dependent Navier-Stokes equations

A splitting scheme is proposed for the numerical solution of the time-dependent, incompressible Navier-Stokes equations by spectral methods. A staggered grid is used for the pressure, improved intermediate boundary conditions are employed in the split step for the velocity, and spectral multigrid techniques are used for the solution of the implicit equations.

Zang, T. A.↗

NASA NTRS1987

A diagonal implicit multigrid algorithm for the Euler equations

A multigrid implementation of the Alternating Direction Implicit algorithm has been developed to solve the Euler equations of inviscid, compressible flow. The equations are approximated using a finite-volume spatial approximation with added dissipation provided by an adaptive blend of second and fourth differences. For computational efficiency, the equations are diagonalized by a local similariity transformation so that only a decoupled system of scalar pentadiagonal systems need be solved along each line. Results are computed for transonic flows past airfoils and include pressure distributions to verify the accuracy of the basic scheme and convergence histories to demonstrate the efficiency of the method.

Caughey, David A.↗

NASA NTRS1987

Multigrid acceleration of the isenthalpic form of the compressible flow equations

A numerical method for solving the isenthalpic form of the governing equations for compressible inviscid flows was developed. The method is based on the concept of flux vector splitting in its implicit form and was tested on several demanding configurations. Time marching to steady state was accelerated by the implementation of the multigrid procedure which very effectively increased the rate of convergence. High quality steady-state results were obtained for various test cases and required only short computational times due to the relative efficiency of the basic method.

Melson, N. Duane↗

NASA NTRS1987

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

NASA NTRS1987

Comparison of three explicit multigrid methods for the Euler and Navier-Stokes equations

Three explicit multigrid methods, Ni's method, Jameson's finite-volume method, and a finite-difference method based on Brandt's work, are described and compared for two model problems. All three methods use an explicit multistage Runge-Kutta scheme on the fine grid, and this scheme is also described. Convergence histories for inviscid flow over a bump in a channel for the fine-grid scheme alone show that convergence rate is proportional to Courant number and that implicit residual smoothing can significantly accelerate the scheme. Ni's method was slightly slower than the implicitly-smoothed scheme alone. Brandt's and Jameson's methods are shown to be equivalent in form but differ in their node versus cell-centered implementations. They are about 8.5 times faster than Ni's method in terms of CPU time. Results for an oblique shock/boundary layer interaction problem verify the accuracy of the finite-difference code. All methods slowed considerably on the stretched viscous grid but Brandt's method was still 2.1 times faster than Ni's method.

Chima, Rodrick V.↗

NASA NTRS1988

The use of multigrid techniques in the solution of the Elrod algorithm for a dynamically loaded journal bearing

A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed, utilizing a multigrid iterative technique. The code is compared with a presently existing direct solution in terms of computational time and accuracy. The model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobssen-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via liquid striations. The mixed nature of the equations (elliptic in the full film zone and nonelliptic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.

Woods, Claudia M.↗

NASA NTRS1987

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

NASA NTRS1988

Accurate multigrid solution of the Euler equations on unstructured and adaptive meshes

A method for accurately solving inviscid compressible flow in the subcritical and supercritical regimes about complex configurations is presented. The method is based on the use of unstructured triangular meshes in two dimensions, and special emphasis is placed on the accuracy and efficiency of the solutions. High accuracy is achieved by careful scaling of the artificial dissipation terms, and by reformulating the inner and outer boundary conditions for both the convective and dissipative operators. An adaptive grid refinement strategy is presented which enhances the solution accuracy for complex flows. When coupled with an unstructured multigrid algorithm, this method is shown to produce an efficient solver for flows about arbitrary configurations.

Mavriplis, Dimitri J.↗

NASA NTRS1988

The solution of the Elrod algorithm for a dynamically loaded journal bearing using multigrid techniques

A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed utilizing a multigrid iteration technique. The method is compared with a noniterative approach in terms of computational time and accuracy. The computational model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobsson-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via a smeared mass or striated flow extending to both surfaces in the film gap. The mixed nature of the equations (parabolic in the full film zone and hyperbolic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.

Woods, Claudia M.↗

NASA NTRS1988

A diagonally inverted LU implicit multigrid scheme

A new Diagonally Inverted LU Implicit scheme is developed within the framework of the multigrid method for the 3-D unsteady Euler equations. The matrix systems that are to be inverted in the LU scheme are treated by local diagonalizing transformations that decouple them into systems of scalar equations. Unlike the Diagonalized ADI method, the time accuracy of the LU scheme is not reduced since the diagonalization procedure does not destroy time conservation. Even more importantly, this diagonalization significantly reduces the computational effort required to solve the LU approximation and therefore transforms it into a more efficient method of numerically solving the 3-D Euler equations.

Yokota, Jeffrey W.↗

NASA NTRS1987

Multigrid acceleration of the isenthalpic form of the compressible flow equations

Melson, N. Duane↗

NASA NTRS1988

Design and implementation of parallel multigrid algorithms

Techniques for mapping multigrid algorithms to solve elliptic PDEs on hypercube parallel computers are described and demonstrated. The need for proper data mapping to minimize communication distances is stressed, and an execution-time model is developed to show how algorithm efficiency is affected by changes in the machine and algorithm parameters. Particular attention is then given to the case of coarse computational grids, which can lead to idle processors, load imbalances, and inefficient performance. It is shown that convergence can be improved by using idle processors to solve a new problem concurrently on the fine grid defined by a splitting.

Chan, Tony F.↗