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

Nonlinear evolution of f(R) cosmologies. I. Methodology

We introduce the method and the implementation of a cosmological simulation of a class of metric-variation f(R) models that accelerate the cosmological expansion without a cosmological constant and evade solar-system bounds of small-field deviations to general relativity. Such simulations are shown to reduce to solving a nonlinear Poisson equation for the scalar degree of freedom introduced by the f(R) modifications. We detail the method to efficiently solve the nonlinear Poisson equation by using a Newton-Gauss-Seidel relaxation scheme coupled with the multigrid method to accelerate the convergence. The simulations are shown to satisfy tests comparing the simulated outcome to analytical solutions for simple situations, and the dynamics of the simulations are tested with orbital and Zeldovich collapse tests. Finally, we present several static and dynamical simulations using realistic cosmological parameters to highlight the differences between standard physics and f(R) physics. In general, we find that the f(R) modifications result in stronger gravitational attraction that enhances the dark matter power spectrum by {approx}20% for large but observationally allowed f(R) modifications. A more detailed study of the nonlinear f(R) effects on the power spectrum are presented in a companion paper.

79 ASTRONOMY AND ASTROPHYSICS↗

A multi-level solution algorithm for steady-state Markov chains

A new iterative algorithm, the multi-level algorithm, for the numerical solution of steady state Markov chains is presented. The method utilizes a set of recursively coarsened representations of the original system to achieve accelerated convergence. It is motivated by multigrid methods, which are widely used for fast solution of partial differential equations. Initial results of numerical experiments are reported, showing significant reductions in computation time, often an order of magnitude or more, relative to the Gauss-Seidel and optimal SOR algorithms for a variety of test problems. The multi-level method is compared and contrasted with the iterative aggregation-disaggregation algorithm of Takahashi.

Horton, Graham↗

Multigrid acceleration and turbulence models for computations of 3D turbulent jets in crossflow

A multigrid method is presented for the calculation of three-dimensional turbulent jets in crossflow. Turbulence closure is achieved with either the standard k-epsilon model or a Reynolds Stress Model (RSM). Multigrid acceleration enables convergence rates which are far superior to that for a single grid method. With the k-epsilon model the rate approaches that for laminar flow, but with RSM it is somewhat slower. The increased stiffness of the system of equations in the latter may be responsible. Computed results with both turbulence models are compared with experimental data for a pair of opposed jets in crossflow. Both models yield reasonable agreement with mean flow velocity but RSM yields better prediction of the Reynolds stresses.

Demuren, A. O.↗

Multigrid acceleration and turbulence models for computations of 3D turbulent jets in crossflow

A multigrid method is presented for the calculation of three-dimensional turbulent jets in crossflow. Turbulence closure is achieved with either the standard k-epsilon model or a Reynolds stress model (RSM). Multigrid acceleration enables convergence rates which are far superior to that for a single grid method to be obtained with both turbulence models. With the k-epsilon model the rate approaches that for laminar flow, but with RSM it is somewhat slower. The increased stiffness of the system of equation in the latter may be responsible. Computed results with both turbulence models are compared to experimental data for a pair of opposed jets in crossflow. Both models yield reasonable agreement for the mean flow velocity, but RSM yields better predictions of the Reynolds stresses.

Demuren, A. O.↗

Algebraic multigrid preconditioners for two-phase flow in porous media with phase transitions [Algebraic multigrid preconditioners for multiphase flow in porous media with phase transitions]

Multiphase flow is a critical process in a wide range of applications, including oil and gas recovery, carbon sequestration, and contaminant remediation. Numerical simulation of multiphase flow requires solving of a large, sparse linear system resulting from the discretization of the partial differential equations modeling the flow. In the case of multiphase multicomponent flow with miscible effect, this is a very challenging task. The problem becomes even more difficult if phase transitions are taken into account. A new approach to handle phase transitions is to formulate the system as a nonlinear complementarity problem (NCP). Unlike in the primary variable switching technique, the set of primary variables in this approach is fixed even when there is phase transition. Not only does this improve the robustness of the nonlinear solver, it opens up the possibility to use multigrid methods to solve the resulting linear system. The disadvantage of the complementarity approach, however, is that when a phase disappears, the linear system has the structure of a saddle point problem and becomes indefinite, and current algebraic multigrid (AMG) algorithms cannot be applied directly. In this study, we explore the effectiveness of a new multilevel strategy, based on the multigrid reduction technique, to deal with problems of this type. We demonstrate the effectiveness of the method through numerical results for the case of two-phase, two-component flow with phase appearance/disappearance. In conclusion, we also show that the strategy is efficient and scales optimally with problem size.

02 PETROLEUM↗

Scalable multilevel Monte Carlo methods exploiting parallel redistribution on coarse levels

Here, we study an element agglomeration coarsening strategy that requires data redistribution at coarse levels when the number of coarse elements becomes smaller than the number of MPI processes used on the finest level. The overall procedure generates coarse elements (general unstructured unions of fine grid elements) within the framework of element-based algebraic multigrid methods (or AMGe) studied previously. The AMGe-generated coarse spaces have the ability to exhibit approximation properties of the same order as the fine-level spaces since by construction they contain the piecewise polynomials of the same order as on the fine level. These approximation properties are key for the successful use of AMGe in multilevel solvers for nonlinear partial differential equations as well as for multilevel Monte Carlo (MLMC) simulations. The ability to coarsen without being constrained by the number of MPI processes, as described in the present paper, allows to improve the scalability of these solvers as well as the overall MLMC method. The paper illustrates this latter fact with detailed scalability study of MLMC simulations applied to model Darcy equations with a stochastic log-normal permeability field.

AMGe↗

A Block-Asynchronous Relaxation Method for Graphics Processing Units

In this paper, we analyze the potential of asynchronous relaxation methods on Graphics Processing Units (GPUs). For this purpose, we developed a set of asynchronous iteration algorithms in CUDA and compared them with a parallel implementation of synchronous relaxation methods on CPU-based systems. For a set of test matrices taken from the University of Florida Matrix Collection we monitor the convergence behavior, the average iteration time and the total time-to-solution time. Analyzing the results, we observe that even for our most basic asynchronous relaxation scheme, despite its lower convergence rate compared to the Gauss-Seidel relaxation (that we expected), the asynchronous iteration running on GPUs is still able to provide solution approximations of certain accuracy in considerably shorter time then Gauss- Seidel running on CPUs. Hence, it overcompensates for the slower convergence by exploiting the scalability and the good fit of the asynchronous schemes for the highly parallel GPU architectures. Further, enhancing the most basic asynchronous approach with hybrid schemes – using multiple iterations within the ”subdomain” handled by a GPU thread block and Jacobi-like asynchronous updates across the ”boundaries”, subject to tuning various parameters – we manage to not only recover the loss of global convergence but often accelerate convergence of up to two times (compared to the effective but difficult to parallelize Gauss-Seidel type of schemes), while keeping the execution time of a global iteration practically the same. This shows the high potential of the asynchronous methods not only as a stand alone numerical solver for linear systems of equations fulfilling certain convergence conditions but more importantly as a smoother in multigrid methods. Due to the explosion of parallelism in todays architecture designs, the significance and the need for asynchronous methods, as the ones described in this work, is expected to grow.

97 MATHEMATICS AND COMPUTING↗

The adaptive mesh method based on HOC difference scheme for convection diffusion equations with boundary layers

In this paper, an adaptive mesh method is proposed to generate orthogonal nonuniform mesh for 2D rectangular computational domain. The algorithm adopts the dimension split idea which redistribute the mesh on each direction sequently. This approach efficiently decreases the difficultly of algorithm and enables the adapted mesh to be orthogonal. The adaptive mesh method can redistribute the mesh based on the solution without specifying the location of the boundary layer or the grid distribution function to generate the nonuniform mesh in advance. To verify the effectiveness and robustness of the algorithm, the presented method combined with the HOC difference scheme on nonuniform grid is used to solve the 1D and 2D convection diffusion problems with boundary layers. Besides, the multigrid method is used to accelerate the iterative convergence speed. The numerical solutions of adaptive mesh is more flexible than uniform or nonuniform grids methods if the location of the boundary layers is unknown in advance.

97 MATHEMATICS AND COMPUTING↗

A Two Colorable Fourth Order Compact Difference Scheme and Parallel Iterative Solution of the 3D Convection Diffusion Equation

A new fourth order compact difference scheme for the three dimensional convection diffusion equation with variable coefficients is presented. The novelty of this new difference scheme is that it Only requires 15 grid points and that it can be decoupled with two colors. The entire computational grid can be updated in two parallel subsweeps with the Gauss-Seidel type iterative method. This is compared with the known 19 point fourth order compact differenCe scheme which requires four colors to decouple the computational grid. Numerical results, with multigrid methods implemented on a shared memory parallel computer, are presented to compare the 15 point and the 19 point fourth order compact schemes.

Zhang, Jun↗

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

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

A multilevel adaptive projection method for unsteady incompressible flow

There are two main requirements for practical simulation of unsteady flow at high Reynolds number: the algorithm must accurately propagate discontinuous flow fields without excessive artificial viscosity, and it must have some adaptive capability to concentrate computational effort where it is most needed. We satisfy the first of these requirements with a second-order Godunov method similar to those used for high-speed flows with shocks, and the second with a grid-based refinement scheme which avoids some of the drawbacks associated with unstructured meshes. These two features of our algorithm place certain constraints on the projection method used to enforce incompressibility. Velocities are cell-based, leading to a Laplacian stencil for the projection which decouples adjacent grid points. We discuss features of the multigrid and multilevel iteration schemes required for solution of the resulting decoupled problem. Variable-density flows require use of a modified projection operator--we have found a multigrid method for this modified projection that successfully handles density jumps of thousands to one. Numerical results are shown for the 2D adaptive and 3D variable-density algorithms.

Howell, Louis H.↗

Application of multigrid and adaptive grid embedding to the two-dimensional flux-split 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 a NACA 0012 aerofoil in a free stream with a Mach number of 0.85 and an angle of attack of 1.0 degree. 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.↗

Multigrid Solution of the Navier-Stokes Equations at Low Speeds with Large Temperature Variations

Multigrid methods for the Navier-Stokes equations at low speeds and large temperature variations are investigated. The compressible equations with time-derivative preconditioning and preconditioned flux-difference splitting of the inviscid terms are used. Three implicit smoothers have been incorporated into a common multigrid procedure. Both full coarsening and semi-coarsening with directional fine-grid defect correction have been studied. The resulting methods have been tested on four 2D laminar problems over a range of Reynolds numbers on both uniform and highly stretched grids. Two of the three methods show efficient and robust performance over the entire range of conditions. In addition none of the methods have any difficulty with the large temperature variations.

Sockol, Peter M.↗

A coupled ordinates method for solution acceleration of rarefied gas dynamics simulations

Non-equilibrium rarefied flows are frequently encountered in a wide range of applications, including atmospheric re-entry vehicles, vacuum technology, and microscale devices. Rarefied flows at the microscale can be effectively modeled using the ellipsoidal statistical Bhatnagar–Gross–Krook (ESBGK) form of the Boltzmann kinetic equation. Numerical solutions of these equations are often based on the finite volume method (FVM) in physical space and the discrete ordinates method in velocity space. However, existing solvers use a sequential solution procedure wherein the velocity distribution functions are implicitly coupled in physical space, but are solved sequentially in velocity space. This leads to explicit coupling of the distribution function values in velocity space and slows down convergence in systems with low Knudsen numbers. Furthermore, this also makes it difficult to solve multiscale problems or problems in which there is a large range of Knudsen numbers. In this paper, we extend the coupled ordinates method (COMET), previously developed to study participating radiative heat transfer, to solve the ESBGK equations. In this method, at each cell in the physical domain, distribution function values for all velocity ordinates are solved simultaneously. This coupled solution is used as a relaxation sweep in a geometric multigrid method in the spatial domain. Enhancements to COMET to account for the non-linearity of the ESBGK equations, as well as the coupled implementation of boundary conditions, are presented. The methodology works well with arbitrary convex polyhedral meshes, and is shown to give significantly faster solutions than the conventional sequential solution procedure. Acceleration factors of 5–9 are obtained for low to moderate Knudsen numbers on single processor platforms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Implementation and Optimization of miniGMG - a Compact Geometric Multigrid Benchmark

Multigrid methods are widely used to accelerate the convergence of iterative solvers for linear systems used in a number of different application areas. In this report, we describe miniGMG, our compact geometric multigrid benchmark designed to proxy the multigrid solves found in AMR applications. We explore optimization techniques for geometric multigrid on existing and emerging multicore systems including the Opteron-based Cray XE6, Intel Sandy Bridge and Nehalem-based Infiniband clusters, as well as manycore-based architectures including NVIDIA's Fermi and Kepler GPUs and Intel's Knights Corner (KNC) co-processor. This report examines a variety of novel techniques including communication-aggregation, threaded wavefront-based DRAM communication-avoiding, dynamic threading decisions, SIMDization, and fusion of operators. We quantify performance through each phase of the V-cycle for both single-node and distributed-memory experiments and provide detailed analysis for each class of optimization. Results show our optimizations yield significant speedups across a variety of subdomain sizes while simultaneously demonstrating the potential of multi- and manycore processors to dramatically accelerate single-node performance. However, our analysis also indicates that improvements in networks and communication will be essential to reap the potential of manycore processors in large-scale multigrid calculations.

97 MATHEMATICS AND COMPUTING↗

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↗

State-of-the-art surveys on computational mechanics

Topics considered include advances in finite difference techniques for computational fluid dynamics, the spectral element methods for the incompressible Navier-Stokes equations, a review of recent developments in time integration, and advances and trends in element-by-element techniques. Also examined are the algebraic multigrid methods applied to problems in computational structural mechanics, grid generation for the solution of partial differential equations, advances in adaptive improvements, and new computing systems and their impact on computational mechanics.

Noor, Ahmed K.↗