635 research outputs found
Aggregation-based aggressive coarsening with polynomial smoothing
This paper develops an algebraic multigrid preconditioner for the graph
Laplacian. The proposed approach uses aggressive coarsening based on the
aggregation framework in the setup phase and a polynomial smoother with
sufficiently large degree within a (nonlinear) Algebraic Multilevel Iteration
as a preconditioner to the flexible Conjugate Gradient iteration in the solve
phase. We show that by combining these techniques it is possible to design a
simple and scalable algorithm. Results of the algorithm applied to graph
Laplacian systems arising from the standard linear finite element
discretization of the scalar Poisson problem are reported
Bootstrap Multigrid for the Laplace-Beltrami Eigenvalue Problem
This paper introduces bootstrap two-grid and multigrid finite element
approximations to the Laplace-Beltrami (surface Laplacian) eigen-problem on a
closed surface. The proposed multigrid method is suitable for recovering
eigenvalues having large multiplicity, computing interior eigenvalues, and
approximating the shifted indefinite eigen-problem. Convergence analysis is
carried out for a simplified two-grid algorithm and numerical experiments are
presented to illustrate the basic components and ideas behind the overall
bootstrap multigrid approach
Adaptive Multigrid Algorithm for Lattice QCD
We present a new multigrid solver that is suitable for the Dirac operator in
the presence of disordered gauge fields. The key behind the success of the
algorithm is an adaptive projection onto the coarse grids that preserves the
near null space. The resulting algorithm has weak dependence on the gauge
coupling and exhibits very little critical slowing down in the chiral limit.
Results are presented for the Wilson Dirac operator of the 2d U(1) Schwinger
model.Comment: 4 pages, 2 figure
- …