We survey some of the recent research in developing multilevel algebraic solvers for elliptic problems. A key concept is the design of a hierarchy of coarse spaces and related interpolation operators which together satisfy certain approximation and stability properties to ensure the rapid convergence of the resulting multigrid algorithms. We will discuss smoothed agglomeration methods, harmonic extension methods, and global energy minimization methods for the construction of these coarse spaces and interpolation operators.
CITATION STYLE
Chan, T. F., & Vanĕk, P. (1999). Multilevel algebraic elliptic solvers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1593, pp. 1001–1014). Springer Verlag. https://doi.org/10.1007/bfb0100661
Mendeley helps you to discover research relevant for your work.