Improvement of the rate of convergence estimates for multigrid algorithm

摘要

In this paper, we present a new convergence rate for both symmetric and nonsymmetric positive definite problems. In our theory, “regularity and approximation” assumption is used. A new rate of convergence estimate with is used where α is a “regularity and approximation” parameter. Also, a new convergence rate is given by two-grid schemes.