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

DOI10.1016/J.JCP.2016.12.020MaRDI QIDQ680126zbMATH OpenOpenAlexWikidataFDO

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)

Full work available at URL https://arxiv.org/abs/1607.03712, http://hdl.handle.net/10550/58357

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)

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)

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

Cites work

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

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

Describes a project that uses

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)