Improved convergence bounds for two-level methods with an aggressive coarsening and massive polynomial smoothing

DOI10.1553/etna_vol48s264zbMath1398.65051OpenAlexW2811313439WikidataQ129608045 ScholiaQ129608045MaRDI QIDQ1670236

Petr Vaněk, Radek Tezaur

Publication date: 5 September 2018

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://etna.mcs.kent.edu/volumes/2011-2020/vol48/abstract.php?vol=48&pages=264-285

zbMATH Keywords

smoothed aggregationpolynomial smoothingcoarse-space size independent convergencetwo-level method with aggressive coarsening

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10)

Cites Work

• Unnamed Item
• Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing.
• An overview of multilevel methods with aggressive coarsening and massive polynomial smoothing
• Acceleration of convergence of a two-level algorithm by smoothing transfer operators
• Algebraic multigrid theory: The symmetric case
• Fast multigrid solver
• Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
• Convergence Estimates for Multigrid Algorithms without Regularity Assumptions
• The method of alternating projections and the method of subspace corrections in Hilbert space
• Two-grid Method for Linear Elasticity on Unstructured Meshes
• An improved convergence analysis of smoothed aggregation algebraic multigrid
• Convergence of algebraic multigrid based on smoothed aggregation