The multilevel method introduced here is algebraic in the sense that it is defined in terms of the coefficient matrix only. In particular, the coarse level is just a subset of unknowns with no geometric interpretation, hence the name “multilevel” rather than “multigrid.” For diagonally dominant SPD problems, we derive an a posteriori upper-bound for the condition number of the V(0,0)-cycle. For diffusion problems, this upper-bound indicates that the condition number grows only polynomially with the number of levels, independent of the meshsize and the possible discontinuities in the diffusion coefficient. This indicates that the nearly singular eigenvectors of A are handled well by the coarse-level correction, so the V(1,1)-cycle that uses relaxation to handle the rest of the error modes as well should converge rapidly.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2008). The Algebraic Multilevel Method. In: Shapira, Y. (eds) Matrix-Based Multigrid. Numerical Methods and Algorithms, vol 2. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-49765-5_15
Download citation
DOI: https://doi.org/10.1007/978-0-387-49765-5_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-49764-8
Online ISBN: 978-0-387-49765-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)