Improved convergence estimate for a multiply polynomially smoothed two-level method with an aggressive coarsening.
DOI10.21136/AM.2018.0314-17OpenAlexW2901680861WikidataQ128890803 ScholiaQ128890803MaRDI QIDQ667903FDOQ667903
Authors: R. Tezaur, Petr Vaněk 
Publication date: 1 March 2019
Published in: Applications of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.21136/am.2018.0314-17
Recommendations
- Improved convergence bounds for two-level methods with an aggressive coarsening and massive polynomial smoothing
- Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing.
- An improved convergence analysis of smoothed aggregation algebraic multigrid.
- A short philosophical note on the origin of smoothed aggregations.
- Improved convergence bounds for smoothed aggregation method: Linear dependence of the convergence rate on the number of levels
Iterative numerical methods for linear systems (65F10) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55)
Cited In (6)
- Acceleration of convergence of a two-level algebraic algorithm by aggregation in smoothing process
- Aggregation-Based Aggressive Coarsening with Polynomial Smoothing
- Improved convergence bounds for smoothed aggregation method: Linear dependence of the convergence rate on the number of levels
- An overview of multilevel methods with aggressive coarsening and massive polynomial smoothing
- Improved convergence bounds for two-level methods with an aggressive coarsening and massive polynomial smoothing
- Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing.
This page was built for publication: Improved convergence estimate for a multiply polynomially smoothed two-level method with an aggressive coarsening.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q667903)
