In this paper we discuss multigrid methods for symmetric Toeplitz matrices. Then the restriction and prolongation operators can be seen as projected Toeplitz matrices. Because of the intimate connection between such matrices and trigonometric series we can express the multigrid algorithm in terms of the underlying functions with special zeros. This shows how to choose the prolongation/restriction operator in order to get fast convergence. We start considering Toeplitz matrices with generating functions having a single zero of finite order in $]-\pi,\pi]$ and extend previous results on multigrid for Toeplitz matrices, in particular by introducing a natural coarse grid operator. Afterwards we carry over our reasoning to cases with more than one zero and study how the previous cases relate to Toeplitz systems resulting from the discretization of Fredholm integral equations of the first kind as they arise from image processing. Finally, we take a short view on Block Toeplitz systems with Toeplitz Blocks: We show how the one-dimensional techniques can be carried over easily for positive definite problems with a single zero in $]-\pi,\pi]^2$ and we also present a multigrid algorithm for linear systems arising from practical image deblurring problems. Finally, we give a new characterization of the well known difficulties encountered in the indefinite case.     «

In this paper we discuss multigrid methods for symmetric Toeplitz matrices. Then the restriction and prolongation operators can be seen as projected Toeplitz matrices. Because of the intimate connection between such matrices and trigonometric series we can express the multigrid algorithm in terms of the underlying functions with special zeros. This shows how to choose the prolongation/restriction operator in order to get fast convergence. We start considering Toeplitz matrices with generating fu...     »