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

DOI10.1007/s10492-013-0018-2zbMath1289.65064OpenAlexW1963871257MaRDI QIDQ375441

Petr Vaněk, Marian Brezina

Publication date: 30 October 2013

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/143335

zbMATH Keywords

algorithmmultigridRichardson iterationaggressive coarseningoptimal convergence resultpolynomial smoothing

Mathematics Subject Classification ID

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

Related Items (5)

Improved convergence bounds for two-level methods with an aggressive coarsening and massive polynomial smoothing ⋮ The image-based multiscale multigrid solver, preconditioner, and reduced order model ⋮ Model analysis of BPX preconditioner based on smoothed aggregation. ⋮ Exact interpolation scheme with approximation vector used as a column of the prolongator ⋮ Improved convergence bounds for smoothed aggregation method: Linear dependence of the convergence rate on the number of levels

Cites Work

• Unnamed Item
• Smoothed prolongation multigrid with rapid coarsening and massive smoothing.
• The cascadic multigrid method for elliptic problems
• Convergence Estimates for Multigrid Algorithms without Regularity Assumptions
• Multilevel Block Factorization Preconditioners
• Two-level Preconditioner with Small Coarse Grid Appropriate for Unstructured Meshes
• 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

This page was built for publication: Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing.