relaxation method

In numerical mathematics, relaxation methods are iterative methods for solving systems of equations, including nonlinear systems.

Relaxation methods were developed for solving large sparse linear systems, which arose as finite-difference discretizations of differential equations. They are also used for the solution of linear equations for linear least-squares problems and also for systems of linear inequalities, such as those arising in linear programming. They have also been developed for solving nonlinear systems of equations.

Relaxation methods are important especially in the solution of linear systems used to model elliptic partial differential equations, such as Laplace's equation and its generalization, Poisson's equation. These equations describe boundary-value problems, in which the solution-function's values are specified on boundary of a domain; the problem is to compute a solution also on its interior. Relaxation methods are used to solve the linear equations resulting from a discretization of the differential equation, for example by finite differences.Abraham Berman, Robert J. Plemmons, ''Nonnegative Matrices in the Mathematical Sciences'', 1994, SIAM. . David M. Young, Jr. ''Iterative Solution of Large Linear Systems'', Academic Press, 1971. (reprinted by Dover, 2003)Richard S. Varga 2002 ''Matrix Iterative Analysis'', Second ed. (of 1962 Prentice Hall edition), Springer-Verlag.

Iterative relaxation of solutions is commonly dubbed smoothing because with certain equations, such as Laplace's equation, it resembles repeated application of a local smoothing filter to the solution vector. These are not to be confused with relaxation methods in mathematical optimization, which approximate a difficult problem by a simpler problem whose "relaxed" solution provides information about the solution of the original problem.

Model problem of potential theory

When φ is a smooth real-valued function on the real numbers, its second derivative can be approximated by:
:$\frac = \frac\,+\,\mathcal(h^2)\,.$
Using this in both dimensions for a function φ of two arguments at the point (''x'', ''y''), and solving for φ(''x'', ''y''), results in:
:$\varphi(x, y) = \tfrac\left(\varphi(xh,y)+\varphi(x,yh)+\varphi(xh,y)+\varphi(x,yh) \,-\,h^2^2\varphi(x,y)\right)\,+\,\mathcal(h^4)\,.$
To approximate the solution of the Poisson equation:
:$^2 \varphi = f\,$
numerically on a two-dimensional grid with grid spacing ''h'', the relaxation method assigns the given values of function φ to the grid points near the boundary and arbitrary values to the interior grid points, and then repeatedly performs the assignment
φ := φ* on the interior points, where φ* is defined by:
:$\varphi^*(x, y) = \tfrac\left(\varphi(xh,y)+\varphi(x,yh)+\varphi(xh,y)+\varphi(x,yh) \,-\,h^2f(x,y)\right)\,,$
until convergence.

The method is easily generalized to other numbers of dimensions.

Convergence and acceleration

While the method converges under general conditions, it typically makes slower progress than competing methods. Nonetheless, the study of relaxation methods remains a core part of linear algebra, because the transformations of relaxation theory provide excellent preconditioners for new methods. Indeed, the choice of preconditioner is often more important than the choice of iterative method.Yousef Saad,
Iterative Methods for Sparse Linear Systems
', 1st edition, PWS, 1996.

Multigrid methods may be used to accelerate the methods. One can first compute an approximation on a coarser grid – usually the double spacing 2''h'' – and use that solution with interpolated values for the other grid points as the initial assignment. This can then also be done recursively for the coarser computation.William L. Briggs, Van Emden Henson, and Steve F. McCormick (2000),
A Multigrid Tutorial
'' (2nd ed.), Philadelphia: Society for Industrial and Applied Mathematics, .

See also

* In linear systems, the two main classes of relaxation methods are stationary iterative methods, and the more general Krylov subspace methods.
* The Jacobi method is a simple relaxation method.
* The Gauss–Seidel method is an improvement upon the Jacobi method.
* Successive over-relaxation can be applied to either of the Jacobi and Gauss–Seidel methods to speed convergence.
* Multigrid methods

Notes

References

* Abraham Berman, Robert J. Plemmons, ''Nonnegative Matrices in the Mathematical Sciences'', 1994, SIAM. .
*
*
* Yousef Saad,
Iterative Methods for Sparse Linear Systems
', 1st edition, PWS, 1996.
* Richard S. Varga 2002 ''Matrix Iterative Analysis'', Second ed. (of 1962 Prentice Hall edition), Springer-Verlag.
* David M. Young, Jr. ''Iterative Solution of Large Linear Systems'', Academic Press, 1971. (reprinted by Dover, 2003)

Further reading

* Southwell, R.V. (1940) ''Relaxation Methods in Engineering Science''. Oxford University Press, Oxford.
* Southwell, R.V. (1946) ''Relaxation Methods in Theoretical Physics''. Oxford University Press, Oxford.
*
*
* {{cite book , author= P.-B. Zhou , title=Numerical Analysis of Electromagnetic Fields , location=New York , publisher=Springer , year=1993

Iterative methods
Numerical linear algebra