Name
Abstract | ||
|---|---|---|
. We propose a fast iterative method to optimize coarse basis functions in algebraic multigrid by minimizing the sum of their
energies, subject to the condition that linear combinations of the basis functions equal to given zero energy modes, and subject
to restrictions on the supports of the coarse basis functions. For a particular selection of the supports, the first iteration
gives exactly the same basis functions as our earlier method using smoothed aggregation. The convergence rate of the minimization
algorithm is bounded independently of the mesh size under usual assumptions on finite elements. The construction is presented
for scalar problems as well as for linear elasticity. Computational results on difficult industrial problems demonstrate that
the use of energy minimal basis functions improves algebraic multigrid performance and yields a more robust multigrid algorithm
than smoothed aggregation. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/s006070050003 | Computing |
Keywords | DocType | Volume |
AMS Subject Classifications:65N55,65F10.,Key words.Algebraic multigrid,constrained optimization. | Journal | 62 |
Issue | ISSN | Citations |
3 | 0010-485X | 30 |
PageRank | References | Authors |
3.42 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan Mandel | 1 | 444 | 69.36 |
| M. Brezina | 2 | 236 | 31.44 |
| P. Vaněk | 3 | 30 | 3.42 |