an:06521234
Zbl 1327.65058
Brousek, Jan; Frankov??, Pavla; Hanu??, Milan; Kopincov??, Hana; Ku??el, Roman; Tezaur, Radek; Van??k, Petr; Vastl, Zbyn??k
An overview of multilevel methods with aggressive coarsening and massive polynomial smoothing
EN
ETNA, Electron. Trans. Numer. Anal. 44, 401-442 (2015).
00343432
2015
j
65F10 65M55
multigrid; aggressive coarsening; optimal convergence result
Summary: We review our two-level and multilevel methods with aggressive coarsening and polynomial smoothing. These methods can be seen as a less expensive and more flexible (in the multilevel case) alternative to domain decomposition methods. The polynomial smoothers employed by the reviewed methods consist of a sequence of Richardson iterations and can be performed using up to \(n\) processors, where \(n\) is the size of the considered matrix, thereby allowing for a higher level of parallelism than domain decomposition methods.