On the equivalence between the scheduled relaxation Jacobi method and Richardson's non-stationary method

DOI10.1016/J.JCP.2016.12.020zbMATH Open1378.65081arXiv1607.03712OpenAlexW2466537650WikidataQ57693153 ScholiaQ57693153MaRDI QIDQ680126FDOQ680126

Authors: J. E. Adsuara, V. Mewes, M. A. Aloy, Isabel Cordero-Carrión, Pablo Cerdá-Durán 

Publication date: 22 January 2018

Published in: Journal of Computational Physics (Search for Journal in Brave)

Abstract: The Scheduled Relaxation Jacobi (SRJ) method is an extension of the classical Jacobi iterative method to solve linear systems of equations ($Au=b$) associated with elliptic problems. It inherits its robustness and accelerates its convergence rate computing a set of $P$ relaxation factors that result from a minimization problem. In a typical SRJ scheme, the former set of factors is employed in cycles of $M$ consecutive iterations until a prescribed tolerance is reached. We present the analytic form for the optimal set of relaxation factors for the case in which all of them are different, and find that the resulting algorithm is equivalent to a non-stationary generalized Richardson's method. Our method to estimate the weights has the advantage that the explicit computation of the maximum and minimum eigenvalues of the matrix $A$ is replaced by the (much easier) calculation of the maximum and minimum frequencies derived from a von Neumann analysis. This set of weights is also optimal for the general problem, resulting in the fastest convergence of all possible SRJ schemes for a given grid structure. We also show that with the set of weights computed for the optimal SRJ scheme for a fixed cycle size it is possible to estimate numerically the optimal value of the parameter $omega$ in the Successive Overtaxation (SOR) method in some cases. Finally, we demonstrate with practical examples that our method also works very well for Poisson-like problems in which a high-order discretization of the Laplacian operator is employed. This is of interest since the former discretizations do not yield consistently ordered $A$ matrices. Furthermore, the optimal SRJ schemes here deduced, are advantageous over existing SOR implementations for high-order discretizations of the Laplacian operator in as much as they do not need to resort to multi-coloring schemes for their parallel implementation. (abridged)

Full work available at URL: https://arxiv.org/abs/1607.03712

Recommendations

• Determination of the optimal relaxation parameters for the solution of the Neumann-Poisson problem on uniform and non-uniform meshes using the scheduled relaxation Jacobi method
• Scheduled relaxation Jacobi method: improvements and applications
• Acceleration of the scheduled relaxation Jacobi method: promising strategies for solving large, sparse linear systems
• The optimal relaxation parameter for the SOR method applied to the Poisson equation in any space dimensions
• Optimum iterative methods for the solution of singular linear systems arising from the discretization of elliptic P.D.E.'s

zbMATH Keywords

iterative methods for linear systemselliptic equationsfinite difference methodsRichardson methodJacobi methodscheduled relaxation Jacobi method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Finite difference methods for boundary value problems involving PDEs (65N06)

Cites Work

• The Einstein toolkit: a community computational infrastructure for relativistic astrophysics
• Parallel iterative methods for sparse linear systems
• Numerical Solution of the Navier-Stokes Equations
• Title not available (Why is that?)
• A second-order projection method for the incompressible Navier-Stokes equations
• The \(\nabla \cdot B=0\) constraint in shock-capturing magnetohydrodynamics codes
• A Flexible Inner-Outer Preconditioned GMRES Algorithm
• Title not available (Why is that?)
• The effect of nonzero \(\bigtriangledown\cdot B\) on the numerical solution of the magnetohydrodynamic equations
• Solution of Linear Systems by Richardson's Method
• A Numerical Method for the Incompressible Navier-Stokes Equations Based on an Approximate Projection
• The Chebyshev iteration revisited
• On Richardson's Method for Solving Linear Systems with Positive Definite Matrices
• Initial data for numerical relativity
• Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
• Improving preconditioned SOR-type iterative methods for L-matrices
• Richardson's iteration for nonsymmetric matrices
• Black-hole binaries, gravitational waves, and numerical relativity
• Evolution of three-dimensional gravitational waves: harmonic slicing case
• Numerical integration of Einstein's field equations
• Title not available (Why is that?)
• Fourier Analysis of the SOR Iteration
• Analysis of the SOR Iteration for the 9-Point Laplacian
• On construction of the stable permutations of parameters for the Chebyshev iterative methods. Part I
• Title not available (Why is that?)
• On the Use of Higher-Order Projection Methods for Incompressible Turbulent Flow
• Title not available (Why is that?)
• Use of Tschebyscheff-Polynomial Operators in the Numerical Solution of Boundary-Value Problems
• Scheduled relaxation Jacobi method: improvements and applications
• Delayed over-relaxation for iterative methods
• Acceleration of the Jacobi iterative method by factors exceeding 100 using scheduled relaxation

Cited In (6)

• Extensions and analysis of worst-case parameter in weighted Jacobi's method for solving second order implicit PDEs
• Determination of the optimal relaxation parameters for the solution of the Neumann-Poisson problem on uniform and non-uniform meshes using the scheduled relaxation Jacobi method
• Unifying relations between iterative linear equation solvers and explicit Euler approximations for associated parabolic regularized equations
• Acceleration of the scheduled relaxation Jacobi method: promising strategies for solving large, sparse linear systems
• Acceleration of the Jacobi iterative method by factors exceeding 100 using scheduled relaxation
• Scheduled relaxation Jacobi method: improvements and applications

Uses Software

• Einstein Toolkit

This page was built for publication: On the equivalence between the scheduled relaxation Jacobi method and Richardson's non-stationary method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680126)