Effect on Spectral Properties by the Splitting Correction Preconditioning for Linear Systems that Arise from Periodic Boundary Problems

  • Shoji Itoh
  • Yoshio Oyanagi
  • Shao-Liang Zhang
  • Makoto Natori
Conference paper


In this paper, the spectral properties of the preconditioned systems by the “Splitting Correction (SC)”, proposed by the present authors, are studied and it is conjectured that the degeneracy not the clustering of the eiganvalues plays an important role in the convergence. The SC preconditioner is one of new pre-conditioners based on block factorization for solving linear systems that arise from periodic boundary problems. From the viewpoint of the convergence of residual norm, the behaviors of the residual norm of the conjugate gradient (CG) method preconditioned by the SC and the block incomplete Cholesky (block IC) are very peculiar. Generally, the convergence of the CG method depends on spectral properties, such as the clustering and the degeneracy of the eigenvalues, of the coefficient matrix. Some numerical results suggest that the fast convergence of the SC is due not to the clustering but to the degeneracy of the eigenvalues of the preconditioned coefficient matrix.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Axelsson O., Incomplete Block Matrix Factorization Preconditioning Methods. The Ultimate Answer?, J. Comp. Appl. Math., 12and13, pp. 3–18, 1985.Google Scholar
  2. 2.
    Barrett R., et al., Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia, USA, 1994.Google Scholar
  3. 3.
    Bruaset A. M., A Survey of Preconditioned Iterative Methods, Longman Scientific and Technical, 1995.Google Scholar
  4. 4.
    Concus P., Golub G. H. and Meurant G., Block Preconditioning for the Conjugate Gradient Method, SIAM J. Sci. Stat. Comput., 6, pp. 220–252, 1985.MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Eisenstat S. C., Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods, SIAM J. Sci. Stat. Comput., 2, pp. 1–4, 1981.MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Golub G. H. and O’Leary D. P., Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976,SIAM Review, 31, pp. 50–102, 1989.MathSciNetzbMATHGoogle Scholar
  7. 7.
    Golub G. H. and van Loan C. F., Matrix Computations, Johns Hopkins University Press, 1996.Google Scholar
  8. 8.
    Hestenes M. R. and Stiefel E., Methods of Conjugate Gradients for Solving Linear Systems, J. Res. Nat. Bur. Standards, 49, pp. 409–435, 1952.MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Itoh S., Zhang S. -L., Oyanagi Y. and Natori M., Splitting Correction Pre-conditioner for Linear Systems that Arise from Periodic Boundary Problems, ISE-Technical Report, ISE-TR-00–170, University of Tsukuba, June, 2000.Google Scholar
  10. 10.
    Kelley C. T., Iterative Methods for Linear and Nonlinear Equations, SIAM, Philadelphia, 1995.Google Scholar
  11. 11.
    Meijerink J. A. and van der Vorst H. A., An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix, Math. Comput., 31, pp. 148–162, 1977.MathSciNetzbMATHGoogle Scholar
  12. 12.
    Natori M., Numerical Analysis and its Applications, Corona Publishing, Tokyo, 1990 (in Japanese).Google Scholar

Copyright information

© Springer Japan 2002

Authors and Affiliations

  • Shoji Itoh
    • 1
  • Yoshio Oyanagi
    • 2
  • Shao-Liang Zhang
    • 3
  • Makoto Natori
    • 4
  1. 1.Science Information Processing Center, Inst. of Info. Sci. and Elec.University of TsukubaTsukuba, IbarakiJapan
  2. 2.Department of Computer ScienceUniversity of TokyoBunkyo, TokyoJapan
  3. 3.Department of Applied PhysicsUniversity of TokyoBunkyo, TokyoJapan
  4. 4.Institute of Information Sciences and ElectronicsUniversity of TsukubaTsukuba, IbarakiJapan

Personalised recommendations