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 415 records · Page 23

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Lifting MGARD: Construction of (pre)wavelets on the interval using polynomial predictors of arbitrary order

MGARD (MultiGrid Adaptive Reduction of Data) is an algorithm for compressing and refactoring scientific data, based on the theory of multigrid methods. The core algorithm is built around stable multilevel decompositions of conforming piecewise linear $C^0$ finite element spaces, enabling accurate error control in various norms and derived quantities of interest. In this work, we extend this construction to arbitrary order Lagrange finite elements $\mathbb{Q}_p$, $p \geq 0$, and propose a reformulation of the algorithm as a lifting scheme with polynomial predictors of arbitrary order. Additionally, a new formulation using a compactly supported wavelet basis is discussed, and an explicit construction of the proposed wavelet transform for uniform dyadic grids is described.

Reshniak, Viktor [Oak Ridge National Laboratory (O↗

NASA NTRS1981

Unigrid methods for boundary value problems with nonrectangular domains

Boundary value problems with nonrectangular domains were solved with unigrid methods. Unigrid was developed, its relationship to multigrid is described and some simple theory is presented. Its use is illustrated with a North Atlantic basin oceanographic model problem. It is demonstrated how unigrid (and, hence, multigrid) can be used efficiently with vector computers on problems with irregular domains.

Holland, W.↗

NASA NTRS1981

High order multi-grid methods to solve the Poisson equation

High order multigrid methods based on finite difference discretization of the model problem are examined. The following methods are described: (1) a fixed high order FMG-FAS multigrid algorithm; (2) the high order methods; and (3) results are presented on four problems using each method with the same underlying fixed FMG-FAS algorithm.

Schaffer, S.↗

NASA NTRS1983

Numerical solution of a coupled pair of elliptic equations from solid state electronics

Iterative methods are considered for the solution of a coupled pair of second order elliptic partial differential equations which arise in the field of solid state electronics. A finite difference scheme is used which retains the conservative form of the differential equations. Numerical solutions are obtained in two ways, by multigrid and dynamic alternating direction implicit methods. Numerical results are presented which show the multigrid method to be an efficient way of solving this problem.

Phillips, T. N.↗

NASA NTRS1984

Numerical solution of a coupled pair of elliptic equations from solid state electronics

Phillips, T. N.↗

NASA NTRS1985

Multi-grid calculation of transonic potential flows

The finite-volume method discussed by Jameson and Caughey (1977), and Caughey and Jameson (1979, 1980) has made it possible to calculate the transonic potential flow past any configuration for which a suitable boundary-conforming coordinate grid can be constructed. However, computations for practical three-dimensional problems have remained quite expensive in terms of the required computer time. The reason for this is primarily related to the large number of grid cells necessary for adequate resolution in these complex three-dimensional problems, taking into account the large number of iterations required to achieve even modest convergence on these fine grids. The present chapter provides a description of work directed at removing this latter difficulty by making use of the multigrid method. Attention is given to finite-volume formulation, multigrid iteration, geometrical aspects, and computed results.

Caughey, D. A.↗

NASA NTRS1987

Artificial dissipation and central difference schemes for the Euler and Navier-Stokes equations

An artificial dissipation model, including boundary treatment, that is employed in many central difference schemes for solving the Euler and Navier-Stokes equations is discussed. Modifications of this model such as the eigenvalue scaling suggested by upwind differencing are examined. Multistage time stepping schemes with and without a multigrid method are used to investigate the effects of changes in the dissipation model on accuracy and convergence. Improved accuracy for inviscid and viscous airfoil flow is obtained with the modified eigenvalue scaling. Slower convergence rates are experienced with the multigrid method using such scaling. The rate of convergence is improved by applying a dissipation scaling function that depends on mesh cell aspect ratio.

Swanson, R. C.↗

NASA NTRS1987

Artificial dissipation and central difference schemes for the Euler and Navier-Stokes equations

An artificial dissipation model, including boundary treatment, that is employed in many central difference schemes for solving the Euler and Navier-Stokes equations is discussed. Modifications of this model such as the eigenvalue scaling suggested by upwind differencing are examined.Multistage time stepping schemes with and without a multigrid method are used to investigate the effects of changes in the dissipation model on accuracy and convergence. Improved accuracy for inviscid and viscous airfoil flows is obtained with the modified eigenvalue scaling. Slower convergence rates are experienced with the multigrid method using such scaling. The rate of convergence is improved by applying a dissipation scaling function that depends on mesh cell aspect ratio.

Swanson, R. C.↗

NASA NTRS1988

A Navier-Stokes solver for cascade flows

A computer code for solving the Reynolds averaged full Navier-Stokes equations has been developed and applied using sheared H-type grids. The Baldwin-Lomax eddy-viscosity model is used for turbulence closure. The integration in time is based on an explicit four-stage Runge-Kutta scheme. Local time stepping, variable coefficient implicit residual smoothing, and a full multigrid method have been implemented to accelerate steady state calculations. Comparisons with experimental data show that the code is an accurate viscous solver and can give very good blade-to-blade predictions for engineering applications in less than 100 multigrid cycles on the finest mesh.

Arnone, A.↗

NASA NTRS1988

Totally parallel multilevel algorithms

Four totally parallel algorithms for the solution of a sparse linear system have common characteristics which become quite apparent when they are implemented on a highly parallel hypercube such as the CM2. These four algorithms are Parallel Superconvergent Multigrid (PSMG) of Frederickson and McBryan, Robust Multigrid (RMG) of Hackbusch, the FFT based Spectral Algorithm, and Parallel Cyclic Reduction. In fact, all four can be formulated as particular cases of the same totally parallel multilevel algorithm, which are referred to as TPMA. In certain cases the spectral radius of TPMA is zero, and it is recognized to be a direct algorithm. In many other cases the spectral radius, although not zero, is small enough that a single iteration per timestep keeps the local error within the required tolerance.

Frederickson, Paul O.↗

NASA NTRS1989

International Conference on Numerical Methods in Fluid Dynamics, 11th, Williamsburg, VA, June 27-July 1, 1988, Proceedings

Recent advances in computational fluid dynamics (CFD) are discussed in reviews and reports. Topics addressed include CFD models in plasma dynamics, parallel computation for simulation studies, CFD for hypersonic airbreathing aircraft, multigrid methods for the steady incompressible Navier-Stokes equations, upwind differencing techniques, TV stable schemes for shock-interacting flows, Euler models of hypersonic vortex flows, parallel multilevel adaptive methods, and vortex methods for slightly viscous three-dimensional flows. Consideration is given to the accuracy of node-based solutions on irregular meshes, multigrid calculations for cascades, a finite-volume-element method for planar cavity flow, parallel heterogeneous mesh refinement for advection-diffusion equations, the convergence of the spectral-viscosity method for nonlinear conservation laws, and numerical simulations of Taylor vortices in a spherical gap.

Dwoyer, D. L.↗

NASA NTRS1990

Adaptive grid embedding for the two-dimensional flux-split Euler equations

A numerical algorithm is presented for solving the 2-D flux-split Euler equations using a multigrid method with adaptive grid embedding. The method uses an unstructured data set along with a system of pointers for communication on the irregularly shaped grid topologies. An explicit two-stage time advancement scheme is implemented. A multigrid algorithm is used to provide grid level communication and to accelerate the convergence of the solution to steady state. Results are presented for a subcritical airfoil and a transonic airfoil with 3 levels of adaptation. Comparisons are made with a structured upwind Euler code which uses the same flux integration techniques of the present algorithm. Good agreement is obtained with converged surface pressure coefficients. The lift coefficients of the adaptive code are within 2 1/2 percent of the structured code for the sub-critical case and within 4 1/2 percent of the structured code for the transonic case using approximately one-third the number of grid points.

Warren, Gary Patrick↗

NASA NTRS1990

Adaptive grid embedding for the two-dimensional Euler equations

A numerical algorithm is presented for solving the two-dimensional flux-split Euler equations using a multigrid method with adaptive grid embedding. The method uses an unstructured data set along with a system of pointers for communication on the irregularly shaped grid topologies. An explicit two-stage time advancement scheme is implemented. A multigrid algorithm is used to provide grid level communication and to accelerate the convergence of the solution to steady state. Results are presented for an NACA 0012 airfoil in a freestream with Mach numbers of 0.95 and 1.054. Excellent resolution of the shock structures is obtained with the adaptive grid embedding method with significantly fewer grid points than the comparable structured grid.

Warren, Gary P.↗

NASA NTRS1989

Navier-Stokes solutions for flows related to store separation

The objective is developing CFD capabilities to obtain solutions for viscous flows about generic configurations of internally and externally carried stores. The emphasis is placed on the supersonic flow regime with extensions being made to the transonic regime. The project is broken into four steps: (1) Cavity flows for internal carriage configurations; (2) High angle of attack flows, which may be experienced during the separation of the stores: (3) Flows about a body near a flat plate for external carriage configurations; and (4) Flows about a body inside or in the proximity of a cavity. Three-dimensional unsteady cavity flow solutions are obtained by an explicit, MacCormack algorithm, EMCAV3, for open, close, and transitional cavities. High angle of attack flows past cylinders are solved by an implicit, upwind algorithm. All the results compare favorably with the experimental data. For flows about multiple body configurations, the Chimera embedding scheme is modified for finite-volume and multigrid algorithms, MaGGiE. Then a finite volume, implicit, upwind, multigrid Navier-Stokes solver which uses on overlapped/embedded and zonal grids, VUMXZ3, is developed from the CFL3D code. Supersonic flows past a cylinder near a flat plate are computed using this code. The results are compared with the experimental data. Currently the VUMXZ3 code is being modified to accomplish step 4 of this project. Wind tunnel experiments are also being conducted for validation purposes.

Baysal, Oktay↗

NASA NTRS1991

One shot methods for optimal control of distributed parameter systems 1: Finite dimensional control

The efficient numerical treatment of optimal control problems governed by elliptic partial differential equations (PDEs) and systems of elliptic PDEs, where the control is finite dimensional is discussed. Distributed control as well as boundary control cases are discussed. The main characteristic of the new methods is that they are designed to solve the full optimization problem directly, rather than accelerating a descent method by an efficient multigrid solver for the equations involved. The methods use the adjoint state in order to achieve efficient smoother and a robust coarsening strategy. The main idea is the treatment of the control variables on appropriate scales, i.e., control variables that correspond to smooth functions are solved for on coarse grids depending on the smoothness of these functions. Solution of the control problems is achieved with the cost of solving the constraint equations about two to three times (by a multigrid solver). Numerical examples demonstrate the effectiveness of the method proposed in distributed control case, pointwise control and boundary control problems.

Taasan, Shlomo↗

NASA NTRS1989

Totally parallel multilevel algorithms for sparse elliptic systems

The fastest known algorithms for the solution of a large elliptic boundary value problem on a massively parallel hypercube all require O(log(n)) floating point operations and O(log(n)) distance-1 communications, if massively parallel is defined to mean a number of processors proportional to the size n of the problem. The Totally Parallel Multilevel Algorithm (TPMA) that has, as special cases, four of these fast algorithms is described. These four algorithms are Parallel Superconvergent Multigrid (PSMG), Robust Multigrid, the Fast Fourier Transformation (FFT) based Spectral Algorithm, and Parallel Cyclic Reduction. The algorithm TPMA, when described recursively, has four steps: (1) project to a collection of interlaced, coarser problems at the next lower level; (2) apply TPMA, recursively, to each of these lower level problems, solving directly at the lowest level; (3) interpolate these approximate solutions to the finer grid, and to verage them to form an approximate solution on this grid; and (4) refine this approximate solution with a defect-correction step, using a local approximate inverse. Choice of the projection operator (P), the interpolation operator (Q), and the smoother (S) determines the class of problems on which TPMA is most effective. There are special cases in which the first three steps produce an exact solution, and the smoother is not needed (e.g., constant coefficient operators).

Frederickson, Paul O.↗

NASA NTRS1992

Design of optimally smoothing multistage schemes for the Euler equations

A recently derived local preconditioning of the Euler equations is shown to be useful in developing multistage schemes suited for multigrid use. The effect of the preconditioning matrix on the spatial Euler operator is to equalize the characteristic speeds. When applied to the discretized Euler equations, the preconditioning has the effect of strongly clustering the operator's eigenvalues in the complex plane. This makes possible the development of explicit marching schemes that effectively damp most high-frequency Fourier modes, as desired in multigrid applications. The technique is the same as developed earlier for scalar convection schemes: placement of the zeros of the amplification factor of the multistage scheme in locations where eigenvalues corresponding to high-frequency modes abound.

Van Leer, Bram↗

NASA NTRS1993

Looking for O(N) Navier-Stokes solutions on non-structured meshes

Multigrid methods are good candidates for the resolution of the system arising in numerical fluid dynamics. However, the question is to know if those algorithms which are efficient for the Poisson equation on structured meshes will still apply well to the Euler and Navier-Stokes equations on unstructured meshes. The study of elliptic problems leads us to define the conditions where a full multigrid strategy has O(N) complexity. The aim of this paper is to build a comparison between the elliptic theory and practical CFD problems. First, as an introduction, we will recall some basic definitions and theorems applied to a model problem. The goal of this section is to point out the different properties that we need to produce an FMG algorithm with O(N) complexity. Then, we will show how we can apply this theory to the fluid dynamics equations such as Euler and Navier-Stokes equations. At last, we present some results which are 2nd-order accurate and some explanations about the behavior of the FMG process.

Morano, Eric↗