Abstract
AbstractChan and Elman (1989) have recently shown that heuristic Fourier analysis can be used to determine approximate convergence rates of iterative methods. Here we present a simple procedure and useful relations that facilitate the practical application of this method. The procedure is based on the fact that the mesh spacing h is typically small, so that attention may be restricted to the asymptotic behaviour of the convergence rate R for small h. We accordingly derive simple expressions for the first few coefficients in a Taylor series expansion of R in powers of h. These coefficients are expressed in terms of derivatives with respect to h of the complex Fourier growth factor ξ rather than its modulus |ξ|. The required derivatives can then be obtained by implicit differentiation without explicitly solving for ξ, which further simplifies the analysis. The overall procedure is illustrated by applying it to the Jacobi, Gauss‐Seidel and successive overrelaxation methods, for which we obtain results asymptotically equivalent to those of Chan and Elman. We also analyse the effect of second‐order Richardson acceleration on the Jacobi method, for which we obtain an asymptotic convergence rate in precise agreement with classical analysis.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Communications in Numerical Methods in Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
