This paper introduces bootstrap multigrid methods for solving eigenvalue problems arising from the discretization of partial differential equations. Inspired by the full bootstrap algebraic multigrid setup algorithm that includes an AMG eigensolver, we illustrate how the algorithm can be simplified for the case of a discretized partial differential equation, thereby developing a bootstrap geometric multigrid (BMG) approach. We illustrate numerically the efficacy of the BMG method for (1) recovering eigenvalues having large multiplicity, (2) computing interior eigenvalues, and (3) approximating shifted indefinite eigenvalue problems. Numerical experiments are presented to illustrate the basic components and ideas behind the success of the overall bootstrap multigrid approach. For completeness, we present a simplified error analysis of a two-grid bootstrap algorithm for the Laplace–Beltrami eigenvalue problem.
|Original language||English (US)|
|Number of pages||31|
|Journal||SIAM Journal on Matrix Analysis and Applications|
|State||Published - 2022|
All Science Journal Classification (ASJC) codes