Preliminary Remarks on Multigrid Methods for Circulant Matrices
NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
How to prove that a preconditioner cannot be superlinear
Mathematics of Computation
A Nonlinear Multigrid Method for Total Variation Minimization from Image Restoration
Journal of Scientific Computing
Multigrid solution techniques for anisotropic structured linear systems
Applied Numerical Mathematics
A note on algebraic multigrid methods for the discrete weighted Laplacian
Computers & Mathematics with Applications
A Multilevel Algorithm for Simultaneously Denoising and Deblurring Images
SIAM Journal on Scientific Computing
Multigrid method for fractional diffusion equations
Journal of Computational Physics
Compact Fourier Analysis for Multigrid Methods based on Block Symbols
SIAM Journal on Matrix Analysis and Applications
Preconditioned iterative methods for fractional diffusion equation
Journal of Computational Physics
| Hi-index | 0.01 |
In this paper, we consider solutions of Toeplitz systems Anu = b where the Toeplitz matrices An are generated by nonnegative functions with zeros. Since the matrices An are ill conditioned, the convergence factor of classical iterative methods, such as the damped Jacobi method, will approach one as the size n of the matrices becomes large. Here we propose to solve the systems by the multigrid method. The cost per iteration for the method is of O(n log n) operations. For a class of Toeplitz matrices which includes weakly diagonally dominant Toeplitz matrices, we show that the convergence factor of the two-grid method is uniformly bounded below one independent of n, and the full multigrid method has convergence factor depending only on the number of levels. Numerical results are given to illustrate the rate of convergence.