Acceleration of the Jacobi iterative method by factors exceeding 100 using scheduled relaxation

We present a methodology that accelerates the classical Jacobi iterative method by factors exceeding 100 when applied to the finite-difference approximation of elliptic equations on large grids. The method is based on a schedule of over- and under-relaxations that preserves the essential simplicity...

Full description

Saved in:
Bibliographic Details
Published inJournal of computational physics Vol. 274; pp. 695 - 708
Main Authors Yang, Xiyang I.A., Mittal, Rajat
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.10.2014
Subjects
Acceleration
Approximation
Computation
Convergence
Elliptic equations
Finite difference method
Iterative method
Iterative methods
Jacobi method
Mathematical analysis
Mathematical models
Jacobi method
Iterative method
Elliptic equations
Online AccessGet full text

Cover

More Information
Summary:We present a methodology that accelerates the classical Jacobi iterative method by factors exceeding 100 when applied to the finite-difference approximation of elliptic equations on large grids. The method is based on a schedule of over- and under-relaxations that preserves the essential simplicity of the Jacobi method. Mathematical conditions that maximize the convergence rate are derived and optimal schemes identified. The convergence rate predicted from the analysis is validated via numerical experiments. The substantial acceleration of the Jacobi method enabled by the current method has the potential to significantly accelerate large-scale simulations in computational mechanics, as well as other areas where elliptic equations are prominent.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0021-9991
1090-2716
DOI:10.1016/j.jcp.2014.06.010