Skip to main content
Log in

High-efficiency improved symmetric successive over-relaxation preconditioned conjugate gradient method for solving large-scale finite element linear equations

  • Published:
Applied Mathematics and Mechanics Aims and scope Submit manuscript

Abstract

Fast solving large-scale linear equations in the finite element analysis is a classical subject in computational mechanics. It is a key technique in computer aided engineering (CAE) and computer aided manufacturing (CAM). This paper presents a high-efficiency improved symmetric successive over-relaxation (ISSOR) preconditioned conjugate gradient (PCG) method, which maintains the convergence and inherent parallelism consistent with the original form. Ideally, the computation can be reduced nearly by 50% as compared with the original algorithm. It is suitable for high-performance computing with its inherent basic high-efficiency operations. By comparing with the numerical results, it is shown that the proposed method has the best performance.

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. Editorial Department of Advances in Mechanics. Top 10 progress of theoretical and applied mechanics in the 20th century (in Chinese). Advances in Mechanics, 31(3), 322–326 (2001)

    Google Scholar 

  2. Zienkiewicz, O. C. and Taylor, L. The Finite Element Method for Solid and Structural Mechanics, 6th ed., Elsevier Butterworth-Heinemann, Oxford (2005)

    MATH  Google Scholar 

  3. Chen, X. and Phoon, K. K. Some numerical experiences on convergence criteria for iterative finite element solvers. Computers and Geotechnics, 36, 1272–1284 (2009)

    Article  Google Scholar 

  4. Hestenes, M. R. and Stiefel, E. Methods of conjugate gradients for solving linear systems. Journal of Research of the National Bureau of Standards, 49, 409–436 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lei, G. Y. Preconditioner with PCG algorithm (in Chinese). Advances in Mathematics, 21(2), 129–139 (1992)

    MathSciNet  MATH  Google Scholar 

  6. Saad, Y. Iterative Methods for Sparse Linear Systems, SIAM, Philadelphia (2003)

    Book  MATH  Google Scholar 

  7. Concus, P., Golub, G. H., and Leary, D. P. Sparse Matrix Computations (eds. Bunch, J. R. and Rose, D. J.), Academic Press, New York (1976)

  8. Kershaw, D. S. The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations. Journal of Computational Physics, 26, 43–65 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  9. Saad, Y. and van der Vorst, H. A. Iterative solution of linear systems in the 20th century. Journal of Computational and Applied Mathematics, 123, 1–33 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Meijerink, J. A. and van der Vorst, H. A. An iterative method for linear systems of which the coefficient matrix is a symmetric M-matrix. Mathematics of Computation, 31(137), 148–162 (1977)

    MathSciNet  MATH  Google Scholar 

  11. Axelsson, O. A generalized SSOR method. BIT Numerical Mathematics, 12, 443–467 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  12. Sami, A. K., Faisal, S., and Ahmed, S. Efficient iterative solvers for structural dynamics problems. Computers and Structures, 82, 2363–2375 (2004)

    Article  Google Scholar 

  13. Eisenstat, S. Efficient implementation of a class of CG methods. SIAM Journal on Scientific and Statistical Computing, 2, 1–4 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lin, S. Z. Improved iterative format of symmetric successive over relaxation-preconditioned conjugated gradient method (in Chinese). Journal of Numerical Methods and Computer Applications, 4, 266–270 (1997)

    Google Scholar 

  15. Rudi, H. and Jonas, K. Parallel preconditioned conjugate gradient algorithm on GPU. Journal of Computational and Applied Mathematics, 236(15), 3584–3590 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  16. Boguslaw, B., Marek, T., and Lukasz, M. Parallel SSOR preconditioning implemented on dynamic SMP clusters with communication on the fly. Future Generation Computer Systems, 26, 491–497 (2010)

    Article  Google Scholar 

  17. Chen, P., Sun, S. L., and Yuan, M. W. Fast solution algorithm in finite element analysis (in Chinese). Chinese Journal of Theoretical and Applied Mechanics, 34(2), 216–222 (2002)

    MathSciNet  Google Scholar 

  18. Duff, I., Heroux, M., and Pozo, R. An overview of the sparse basic linear algebra subprograms: the new standard from the blas technical forum. ACM TOMS, 28(2), 239–267 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lawson, C. L., Hanson, R. J., Kincaid, D., and Krogh, F. T. Basic linear algebra basic linear algebra subprograms for FORTRAN usage. ACM Transactions on Mathematical Software, 5, 308–323 (1979)

    Article  MATH  Google Scholar 

  20. Bramley, R. and Sameh, A. Row projections methods for large nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing, 13(1), 168–193 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  21. Hida, Y., Li, X. S., and Bailey, D. H. Algorithms for quad-double precision floating point arithmetic. 15th IEEE Symposium on Computer Arithmetic, IEEE Computer Society, LBNL-48597, 155–162 (2001)

    Google Scholar 

  22. Bailey, D. H. Automatic Translation of Fortran Programs to Multiprecision, NASA RNR Technical Report, RNR-91-025, California (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gen Li  (李 根).

Additional information

Project supported by the National Natural Science Foundation of China (Nos. 51309261, 41030747, 41102181, and 51121005), the National Basic Research Program of China (973 Program) (No. 2011CB013503), and the Young Teachers’ Initial Funding Scheme of Sun Yat-sen University (No. 39000-1188140)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, G., Tang, Ca. & Li, Lc. High-efficiency improved symmetric successive over-relaxation preconditioned conjugate gradient method for solving large-scale finite element linear equations. Appl. Math. Mech.-Engl. Ed. 34, 1225–1236 (2013). https://doi.org/10.1007/s10483-013-1740-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10483-013-1740-x

Key words

Chinese Library Classification

2010 Mathematics Subject Classification

Navigation