Block Iterative Methods and Recycling for Improved Scalability of Linear Solvers
SessionNumerical Algorithms I
Session ChairHatem Ltaief
Event Type
Paper
Algorithms
Intermediate
Scientific Computing
TimeTuesday, November 15th2pm - 2:30pm
Location355-E
DescriptionContemporary large-scale partial differential equation simulations usually require the solution of large and sparse linear systems. Moreover, it is often needed to solve these linear systems with different or multiple right-hand sides. In this paper, various strategies will be presented to extend the scalability of existing multigrid or domain decomposition linear solvers using appropriate recycling strategies or block methods.
The scalability of this work is assessed by performing simulations on up to 8,192 cores for solving linear systems arising from various physical phenomena modeled by Poisson's equation, the system of linear elasticity, or Maxwell's equation. This work is shipped as part of on open-source software, readily available, and usable in any C/C++, Python, or Fortran code. In particular, some simulations are performed on top of a well established library, PETSc, and it is shown how our approaches can be used to decrease time to solution down by 30%.
The scalability of this work is assessed by performing simulations on up to 8,192 cores for solving linear systems arising from various physical phenomena modeled by Poisson's equation, the system of linear elasticity, or Maxwell's equation. This work is shipped as part of on open-source software, readily available, and usable in any C/C++, Python, or Fortran code. In particular, some simulations are performed on top of a well established library, PETSc, and it is shown how our approaches can be used to decrease time to solution down by 30%.
