Energy Optimization of Algebraic Multigrid Bases

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 b...

Full description

Saved in:
Bibliographic Details
Published in:Computing Vol. 62; no. 3; pp. 205 - 228
Main Authors: Mandel, J., Brezina, M., Vaněk, P.
Format: Journal Article
Language:English
Published: Wien Springer 01.01.1999
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Finite element method
Selection problem
Grid pattern
Multigrid
Algorithm complexity
Optimization method
Algebraic method
Convergence rate
Iterative method
Minimum energy
Computational complexity
ISSN:0010-485X, 1436-5057
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0010-485X
1436-5057
DOI:10.1007/s006070050022