Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing

Petr Vaněk; Marian Brezina

Applications of Mathematics (2013)

  • Volume: 58, Issue: 4, page 369-388
  • ISSN: 0862-7940

Abstract

top
We analyze a general multigrid method with aggressive coarsening and polynomial smoothing. We use a special polynomial smoother that originates in the context of the smoothed aggregation method. Assuming the degree of the smoothing polynomial is, on each level k , at least C h k + 1 / h k , we prove a convergence result independent of h k + 1 / h k . The suggested smoother is cheaper than the overlapping Schwarz method that allows to prove the same result. Moreover, unlike in the case of the overlapping Schwarz method, analysis of our smoother is completely algebraic and independent of geometry of the problem and prolongators (the geometry of coarse spaces).

How to cite

top

Vaněk, Petr, and Brezina, Marian. "Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing." Applications of Mathematics 58.4 (2013): 369-388. <http://eudml.org/doc/260638>.

@article{Vaněk2013,
abstract = {We analyze a general multigrid method with aggressive coarsening and polynomial smoothing. We use a special polynomial smoother that originates in the context of the smoothed aggregation method. Assuming the degree of the smoothing polynomial is, on each level $k$, at least $C h_\{k+1\}/h_k$, we prove a convergence result independent of $h_\{k+1\}/h_k$. The suggested smoother is cheaper than the overlapping Schwarz method that allows to prove the same result. Moreover, unlike in the case of the overlapping Schwarz method, analysis of our smoother is completely algebraic and independent of geometry of the problem and prolongators (the geometry of coarse spaces).},
author = {Vaněk, Petr, Brezina, Marian},
journal = {Applications of Mathematics},
keywords = {multigrid; aggressive coarsening; optimal convergence result; multigrid; aggressive coarsening; optimal convergence result; polynomial smoothing; algorithm; Richardson iteration},
language = {eng},
number = {4},
pages = {369-388},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing},
url = {http://eudml.org/doc/260638},
volume = {58},
year = {2013},
}

TY - JOUR
AU - Vaněk, Petr
AU - Brezina, Marian
TI - Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing
JO - Applications of Mathematics
PY - 2013
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 58
IS - 4
SP - 369
EP - 388
AB - We analyze a general multigrid method with aggressive coarsening and polynomial smoothing. We use a special polynomial smoother that originates in the context of the smoothed aggregation method. Assuming the degree of the smoothing polynomial is, on each level $k$, at least $C h_{k+1}/h_k$, we prove a convergence result independent of $h_{k+1}/h_k$. The suggested smoother is cheaper than the overlapping Schwarz method that allows to prove the same result. Moreover, unlike in the case of the overlapping Schwarz method, analysis of our smoother is completely algebraic and independent of geometry of the problem and prolongators (the geometry of coarse spaces).
LA - eng
KW - multigrid; aggressive coarsening; optimal convergence result; multigrid; aggressive coarsening; optimal convergence result; polynomial smoothing; algorithm; Richardson iteration
UR - http://eudml.org/doc/260638
ER -

References

top
  1. Bornemann, F. A., Deuflhard, P., 10.1007/s002110050234, Numer. Math. 75 (1996), 135-152. (1996) Zbl0873.65107MR1421984DOI10.1007/s002110050234
  2. Bramble, J. H., Pasciak, J. E., Wang, J., Xu, J., 10.1090/S0025-5718-1991-1079008-4, Math. Comput. 57 (1991), 23-45. (1991) Zbl0727.65101MR1079008DOI10.1090/S0025-5718-1991-1079008-4
  3. Brezina, M., Heberton, C., Mandel, J., Vaněk, P., An iterative method with convergence rate chosen a priori, Center for Computational Mathematics, University of Colorado at Denver (UCD/CCM) Report 140 (1999), http://ccm.ucdenver.edu/reports/rep140.pdf. (1999) 
  4. Brezina, M., Vaněk, P., Vassilevski, P. S., 10.1002/nla.775, Numer. Linear Algebra Appl. 19 (2012), 441-469. (2012) Zbl1274.65315MR2911383DOI10.1002/nla.775
  5. Ciarlet, P. G., The Finite Element Method for Elliptic Problems. Studies in Mathematics and its Applications, North-Holland Amsterdam (1978). (1978) MR0520174
  6. Křížková, J., Vaněk, P., 10.1002/(SICI)1099-1506(199607/08)3:4<255::AID-NLA77>3.0.CO;2-2, Numer. Linear Algebra Appl. 3 (1996), 255-274. (1996) Zbl0906.65114MR1399492DOI10.1002/(SICI)1099-1506(199607/08)3:4<255::AID-NLA77>3.0.CO;2-2
  7. Vaněk, P., 10.1007/s10492-012-0001-3, Appl. Math., Praha 57 (2012), 1-10. (2012) Zbl1249.65272MR2891302DOI10.1007/s10492-012-0001-3
  8. Vaněk, P., Brezina, M., Mandel, J., 10.1007/s211-001-8015-y, Numer. Math. 88 (2001), 559-579. (2001) Zbl0992.65139MR1835471DOI10.1007/s211-001-8015-y
  9. Vaněk, P., Brezina, M., Tezaur, R., 10.1137/S1064827596297112, SIAM J. Sci. Comput. 21 (1999), 900-923. (1999) MR1755171DOI10.1137/S1064827596297112
  10. Vassilevski, P. S., Multilevel Block Factorization Preconditioners. Matrix-Based Analysis and Algorithms for Solving Finite Element Equations, Springer New York (2008). (2008) Zbl1170.65001MR2427040
  11. Xu, J., Zikatanov, L., 10.1090/S0894-0347-02-00398-3, J. Am. Math. Soc. 15 (2002), 573-597. (2002) Zbl0999.47015MR1896233DOI10.1090/S0894-0347-02-00398-3

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.