Uniform Convergence Estimates for Multigrid
نویسنده
چکیده
In this paper, we provide uniform estimates for V-cycle algorithms with one smoothing on each level. This theory is based on some elliptic regularity but does not require a smoother interaction hypothesis (sometimes referred to as a strengthened Cauchy Schwarz inequality) assumed in other theories. Thus, it is a natural extension of the full regularity V-cycle estimates provided by Braess and Hackbush in 2].
منابع مشابه
New Estimates for Multilevel Algorithms including the V-cycle
The purpose of this paper is to provide new estimates for certain multilevel algorithms. In particular, we are concerned with the simple additive multilevel algorithm discussed recently together with J. Xu and the standard V-cycle algorithm with one smoothing step per grid. We shall prove that these algorithms have a uniform reduction per iteration independent of the mesh sizes and number of le...
متن کاملMultigrid Method for Symmetric Toeplitz Block Tridiagonal Matrix: Convergence Analysis & Application
The V-cycle multigrid method can significantly lower the computational cost, yet their uniform convergence properties have not been systematically examined, even for the classical parabolic partial differential equations. The main contribution of this paper is that by improving the framework of convergence estimates for multigrid method [Math. Comp., 49 (1987), pp. 311–329], we derive the unifo...
متن کاملMultigrid Methods for the Pure Traction Problem of Linear Elasticity: Mixed Formulation
A multigrid method using conforming P -1 finite elements is developed for the twodimensional pure traction boundary value problem of linear elasticity. The convergence is uniform even as the material becomes nearly incompressible. A heuristic argument for acceleration of the multigrid method is discussed as well. Numerical results with and without this acceleration as well as performance estima...
متن کاملUniform convergence of multigrid V-cycle on adaptively refined finite element meshes for second order elliptic problems
Abstract In this paper we prove the uniform convergence of the standard multigrid V-cycle algorithm with Gauss-Seidel relaxation performed only on new nodes and their “immediate” neighbors for discrete elliptic problems on adaptively refined finite element meshes using the newest vertex bisection algorithm. The proof depends on sharp estimates on the relationship of local mesh sizes and a new s...
متن کاملGlobal and uniform convergence of subspace correction methods for some convex optimization problems
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.
متن کامل