Skip to main content
Log in

A generalized SSOR method

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

To solve large sparse systems of linear equations with symmetric positive definite matrixA=D+L+L*,D=diag(A), with iteration, the SSOR method with one relaxation parameter ω has been applied, yielding a spectral condition number approximately equal to the square root of that ofA, if the condition\(S(\tilde L\tilde L*) \leqq \tfrac{1}{4}\), where\(\tilde L = D^{ - \tfrac{1}{2}} LD^{ - \tfrac{1}{2}} \), is satisfied and if 0<ω<2 is chosen optimally. The matrix arising from the differenced Dirichlet problem satisfies in general the spectral radius condition given above, only if the coefficients of the differential equation are constant and if the mesh-width is uniform.

However, using one relaxation parameter for each mesh-point, the main result for the SSOR method, that the spectral condition number varies with a parameterζ > 0 likeO([ζ −1 +ζ/λ 1]h −1),h → 0, whereλ 1 h 2 is the smallest eigenvalue ofD −1 A, carries over for variable smooth coefficients and even for certain kinds of discontinuities among the coefficients, if the mesh-width is adjusted properly in accordance with the discontinuity.

Since the resulting matrix of iteration has positive eigenvalues, a semi-iterative technique can be used. The necessary number of iterations is thus onlyO(h −1/2).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. W. Sheldon,On the numerical solution of elliptic equations, MTAC 9 (1955), 101–111.

    Google Scholar 

  2. G. J. Habelter and E. L. Wachspress,Symmetric successive overrelaxation in solving diffusion difference equations, Math. Comp. 15 (1961), 356–362.

    Google Scholar 

  3. L. W. Ehrlich,The block symmetric successive overrelaxation method, J. Soc. Indust. Appl. Math. 12 (1964), 807–826.

    Google Scholar 

  4. D. M. Young,Iterative solution of large linear systems, Academic Press, New York and London, 1971.

    Google Scholar 

  5. O. Axelsson,Generalized SSOR methods, DD/72/8, CERN, Geneva, 1972.

    Google Scholar 

  6. M. R. Hestenes and E. Stiefel,Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Standards 49 (1952), 409–436.

    Google Scholar 

  7. C. Lanczos,Solution of systems of linear equations by minimized iterations, J. Res. Nat. Bur. Standards 49 (1952), 33–53.

    Google Scholar 

  8. O. B. Widlung,On the effects of scaling of the Peaceman-Rachford method, Math. Comp. 25 (1971), 33–41.

    Google Scholar 

  9. T. Dupont,A factorization procedure for the solution of elliptic difference equations, SIAM J. Numer. Anal. 5 (1968), 753–782.

    Google Scholar 

  10. H. L. Stone,Iterative solution of implicit approximations of multi-dimensional partial differential equations, SIAM J. Numer. Anal. 5 (1968), 530–558.

    Google Scholar 

  11. J. E. Gunn,The solution of elliptic difference equations by semi-explicit iterative techniques, J. SIAM Numer. Anal. Ser B 2 (1964), 24–45.

    Google Scholar 

  12. O. B. Widlund,On the rate of convergence of an alternating direction implicit method in a noncommutative case, Math. Comp 20 (1965), 500–515.

    Google Scholar 

  13. J. A. George,The use of direct methods for the solution of the discrete Poisson equation on non-rectangular regions, Computer Science Rep. 70-159, Stanford Univ., Stanford, Calif., 1970.

    Google Scholar 

  14. B. L. Buzbee, F. W. Dorr, J. A. George, G. H. Golub,The direct solution of the discrete Poisson equation on irregular regions, SIAM J. Numer. Anal. 8 (1971), 722–736.

    Google Scholar 

  15. J. H. Bramble, B. E. Hubbard and V. Thomée,Convergence estimates for essentially positive type discrete Dirichlet problems, Math. Comp. 23 (1969), 695–709.

    Google Scholar 

  16. G. I. Marchuk,On the theory of the splitting up method, SYNSPADE, Maryland, U.S.A. 1970.

    Google Scholar 

  17. J. H. Bramble and B. E. Hubbard,On the formulation of finite difference analogues of the Dirichlet problem for Poisson's equation, Numer. Math. 4 (1962), 313–327.

    Google Scholar 

  18. D. Young,On Richardson's method for solving linear systems with positive definite matrices, Journal Math. and Physics 32 (1954), 243–255.

    Google Scholar 

  19. E. L. Stiefel,Kernel polynomials in linear algebra and their numerical applications, Nat. Bur. Stand. Appl. Math. Ser. 49 (1958), 1–22.

    Google Scholar 

  20. O. Axelsson,Lecture notes on iterative methods, Report 72.04. Department of Computer Sciences, Chalmers University of Technology, Göteborg.

  21. M. R. Hestenes,The conjugate-gradient method for solving linear systems, Proceedings of symposia in applied mathematics, vol VI, Mc Graw Hill, New York, 1956.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

On leave of absence from Chalmers University of Technology, Göteborg, Sweden.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Axelsson, O. A generalized SSOR method. BIT 12, 443–467 (1972). https://doi.org/10.1007/BF01932955

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01932955

Keywords

Navigation