Name
Abstract | ||
|---|---|---|
Algebraic multigrid methods continue to grow in robustness as effective solvers for the large and sparse linear systems of equations that arise in many applications. Unlike geometric multigrid approaches, however, the theoretical analysis of algebraic multigrid is less predictive of true performance. Multigrid convergence factors naturally depend on the properties of the relaxation, interpolation, and coarse-grid correction routines used, yet without the tools of Fourier analysis, optimal and practical bounds for algebraic multigrid are not easily quantified. In this paper, we survey bounds from existing literature, with particular focus on the predictive capabilities of the theory, and provide new results relating existing bounds. We highlight the impact of these theoretical observations through several model problems and discuss the role of theoretical bounds on practical performance. Copyright (c) 2014 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1002/nla.1930 | NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS |
Keywords | Field | DocType |
algebraic multigrid,convergence bounds,predictive theory | Mathematical optimization,Fourier analysis,Linear system,Interpolation,Multigrid convergence,Robustness (computer science),Multigrid method,Mathematics | Journal |
Volume | Issue | ISSN |
21.0 | SP2.0 | 1070-5325 |
Citations | PageRank | References |
2 | 0.40 | 24 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Scott MacLachlan | 1 | 78 | 8.09 |
| Luke Olson | 2 | 235 | 21.93 |