4,006 research outputs found
An efficient multigrid Poisson solver
In this paper, we introduce an efficient technique known as a quarter sweeps multigrid method for solving two dimensional Poisson equation with the Dirichlet boundary condition. The method with the red black Gauss-Seidel smoothing scheme is shown to be the most superior than the half- and full-sweeps multigrid methods due to Othman et at. [8] and Gupta et al. [5], respectively. Some numerical experiments are included to confirm our recommendation
Solving the Poisson equation on small aspect ratio domains using unstructured meshes
We discuss the ill conditioning of the matrix for the discretised Poisson
equation in the small aspect ratio limit, and motivate this problem in the
context of nonhydrostatic ocean modelling. Efficient iterative solvers for the
Poisson equation in small aspect ratio domains are crucial for the successful
development of nonhydrostatic ocean models on unstructured meshes. We introduce
a new multigrid preconditioner for the Poisson problem which can be used with
finite element discretisations on general unstructured meshes; this
preconditioner is motivated by the fact that the Poisson problem has a
condition number which is independent of aspect ratio when Dirichlet boundary
conditions are imposed on the top surface of the domain. This leads to the
first level in an algebraic multigrid solver (which can be extended by further
conventional algebraic multigrid stages), and an additive smoother. We
illustrate the method with numerical tests on unstructured meshes, which show
that the preconditioner makes a dramatic improvement on a more standard
multigrid preconditioner approach, and also show that the additive smoother
produces better results than standard SOR smoothing. This new solver method
makes it feasible to run nonhydrostatic unstructured mesh ocean models in small
aspect ratio domains.Comment: submitted to Ocean Modellin
A geometric multigrid approach to solving the 2D inhomogeneous laplace equation with internal drichlet boundary conditions
Journal ArticleThe inhomogeneous Laplace (Poisson) equation with internal Dirichlet boundary conditions has recently appeared in several applications to image processing and analysis. Although these approaches have demonstrated quality results, the computational burden of solution demands an efficient solver. Design of an efficient multigrid solver is difficult for these problems due to unpredictable inhomogeneity in the equation coefficients and internal Dirichlet conditions with arbitrary location and value. We present a geometric multigrid approach to solving these systems designed around weighted prolongation/restriction operators and an appropriate system coarsening. This approach is compared against a modified incomplete Cholesky conjugate gradient solver for a range of image sizes. We note that this approach applies equally well to the anisotropic diffusion problem and offers an alternative method to the classic multigrid approach of Acton [1]
A simple multigrid scheme for solving the Poisson equation with arbitrary domain boundaries
We present a new multigrid scheme for solving the Poisson equation with
Dirichlet boundary conditions on a Cartesian grid with irregular domain
boundaries. This scheme was developed in the context of the Adaptive Mesh
Refinement (AMR) schemes based on a graded-octree data structure. The Poisson
equation is solved on a level-by-level basis, using a "one-way interface"
scheme in which boundary conditions are interpolated from the previous coarser
level solution. Such a scheme is particularly well suited for self-gravitating
astrophysical flows requiring an adaptive time stepping strategy. By
constructing a multigrid hierarchy covering the active cells of each AMR level,
we have designed a memory-efficient algorithm that can benefit fully from the
multigrid acceleration. We present a simple method for capturing the boundary
conditions across the multigrid hierarchy, based on a second-order accurate
reconstruction of the boundaries of the multigrid levels. In case of very
complex boundaries, small scale features become smaller than the discretization
cell size of coarse multigrid levels and convergence problems arise. We propose
a simple solution to address these issues. Using our scheme, the convergence
rate usually depends on the grid size for complex grids, but good linear
convergence is maintained. The proposed method was successfully implemented on
distributed memory architectures in the RAMSES code, for which we present and
discuss convergence and accuracy properties as well as timing performances.Comment: 33 pages, 15 figures, accepted for publication in Journal of
Computational Physic
A Full-Depth Amalgamated Parallel 3D Geometric Multigrid Solver for GPU Clusters
Numerical computations of incompressible flow equations with pressure-based algorithms necessitate the solution of an elliptic Poisson equation, for which multigrid methods are known to be very efficient. In our previous work we presented a dual-level (MPI-CUDA) parallel implementation of the Navier-Stokes equations to simulate buoyancy-driven incompressible fluid flows on GPU clusters with simple iterative methods while focusing on the scalability of the overall solver. In the present study we describe the implementation and performance of a multigrid method to solve the pressure Poisson equation within our MPI-CUDA parallel incompressible flow solver. Various design decisions and algorithmic choices for multigrid methods are explored in light of NVIDIA’s recent Fermi architecture. We discuss how unique aspects of an MPI-CUDA implementation for GPU clusters is related to the software choices made to implement the multigrid method. We propose a new coarse grid solution method of embedded multigrid with amalgamation and show that the parallel implementation retains the numerical efficiency of the multigrid method. Performance measurements on the NCSA Lincoln and TACC Longhorn clusters are presented for up to 64 GPUs
- …