The Covergence Rate of a Multigrid Method with Gauss-Seidel Relaxation for the Poisson Equation

DOI10.2307/2007598zbMath0539.65075OpenAlexW4241786026MaRDI QIDQ3326779

Dietrich Braess

Publication date: 1984

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

Full work available at URL: https://doi.org/10.2307/2007598

zbMATH Keywords

multigrid methodconvergence ratePoisson equationuniform gridGauss-Seidel relaxation

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items

The contraction number of a multigrid method with mesh ratio two for solving model problems ⋮ Remarks on multigrid convergence theorems ⋮ Estimates for multigrid methods based on red-black Gauss-Seidel smoothings ⋮ Two-level hierarchically preconditioned conjugate gradient methods for solving linear elasticity finite element equations ⋮ Additive multilevel preconditioners based on bilinear interpolation, matrix-dependent geometric coarsening and algebraic multigrid coarsening for second-order elliptic PDEs ⋮ Efficient relaxed-Jacobi smoothers for multigrid on parallel computers ⋮ Multiquadrics -- a scattered data approximation scheme with applications to computational fluid-dynamics. II: Solutions to parabolic, hyperbolic and elliptic partial differential equations ⋮ Multigrid convergence for nonsymmetric, indefinite variational problems and one smoothing step ⋮ Optimized sparse approximate inverse smoothers for solving Laplacian linear systems