Multigrid solvers in reconfigurable hardware

DOI10.1016/J.CAM.2006.12.031MaRDI QIDQ2469613zbMATH OpenOpenAlexFDO

Authors Safaa J. Kasbah, Issam W. Damaj, Ramzi A. Haraty

Publication date 6 February 2008

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.00629

2D-Poisson equation convergence field programmable gate arrays finite difference method iterative methods numerical examples parallelization reconfigurable computing successive over relaxation V-cycle multigrid method

Mathematics Subject Classification ID

Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Iterative numerical methods for linear systems (65F10) Finite difference methods for boundary value problems involving PDEs (65N06) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15)

Abstract: The problem of finding the solution of Partial Differential Equations (PDEs) plays a central role in modeling real world problems. Over the past years, Multigrid solvers have showed their robustness over other techniques, due to its high convergence rate which is independent of the problem size. For this reason, many attempts for exploiting the inherent parallelism of Multigrid have been made to achieve the desired efficiency and scalability of the method. Yet, most efforts fail in this respect due to many factors (time, resources) governed by software implementations. In this paper, we present a hardware implementation of the V-cycle Multigrid method for finding the solution of a 2D-Poisson equation. We use Handel-C to implement our hardware design, which we map onto available Field Programmable Gate Arrays (FPGAs). We analyze the implementation performance using the FPGA vendor's tools. We demonstrate the robustness of Multigrid over other iterative solvers, such as Jacobi and Successive Over Relaxation (SOR), in both hardware and software. We compare our findings with a C++ version of each algorithm. The obtained results show better performance when compared to existing software versions.

Recommendations

Cites work

Describes a project that uses

Uses Software

This page was built for publication: Multigrid solvers in reconfigurable hardware

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469613)