Huda Ibeid

Learn More
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and re-laxable global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems(More)
Exascale systems are predicted to have approximately one billion cores, assuming Gigahertz cores. Limitations on affordable network topologies for distributed memory systems of such massive scale bring new challenges to the current parallel programing model. Currently, there are many efforts to evaluate the hardware and software bottlenecks of exascale(More)
There has been a large increase in the amount of work on hierarchical low-rank approximation methods, where the interest is shared by multiple communities that previously did not intersect. This objective of this article is twofold ; to provide a thorough review of the recent advancements in this field from both analytical and algebraic perspectives, and to(More)
Fast multipole methods (FMM) were originally developed for accelerating N-body problems for particle-based methods. FMM is more than an N-body solver, however. Recent efforts to view the FMM as an elliptic Partial Differential Equation (PDE) solver have opened the possibility to use it as a precondi-tioner for a broader range of applications. FMM can solve(More)
  • 1