No abstract

No abstract

No abstract

We prove an abstract convergence estimate for the Algebraic Multigrid Method with prolongator defined by a disaggregation followed by a smoothing. The method input is the problem matrix and a matrix of the zero energy modes of the same problem but with natural boundary conditions. The construction is described in the case of a general elliptic system. The condition number bound increases only as a polynomial of the number of levels, and requires only a uniform weak approximation property for the aggregation operators. This property can be a-priori verified computationally once the aggregates are known. For illustration, it is also verified here for a uniformly elliptic diffusion equations discretized by linear conforming quasiuniform finite elements. Only very weak and natural assumptions on the hierarchy of aggregates are needed. Mathematics Subject Classification (1991): 65N55

SUMMARY We present an improved analysis of the smoothed aggregation algebraic multigrid method extending the original proof in [Numer. Math. 2001; 88:559–579] and its modification in [Multilevel Block Factorization Preconditioners. Matrix‐based Analysis and Algorithms for Solving Finite Element Equations. Springer: New York, 2008]. The new result imposes fewer restrictions on the aggregates that makes it easier to verify in practice. Also, we extend a result in [Appl. Math. 2011] that allows us to use aggressive coarsening at all levels. This is due to the properties of the special polynomial smoother that we use and analyze. In particular, we obtain bounds in the multilevel convergence estimates that are independent of the coarsening ratio. Numerical illustration is also provided. Copyright © 2011 John Wiley & Sons, Ltd.