An overview of multilevel methods with aggressive coarsening and massive polynomial smoothing

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43928435" target="_blank" >RIV/49777513:23520/15:43928435 - isvavai.cz</a>
Result on the web
<a href="http://etna.mcs.kent.edu/volumes/2011-2020/vol44/abstract.php?vol=44&pages=401-442" target="_blank" >http://etna.mcs.kent.edu/volumes/2011-2020/vol44/abstract.php?vol=44&pages=401-442</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
An overview of multilevel methods with aggressive coarsening and massive polynomial smoothing
Original language description
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 decompositionmethods.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)