Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-27T21:33:09.613Z Has data issue: false hasContentIssue false
  • English
  • Français

An Acceleration Method for Stationary Iterative Solution to Linear System of Equations

Published online by Cambridge University Press:  03 June 2015

Qun Lin  and
Wujian Peng
Qun Lin*
Affiliation:
Academy of Math and System Sciences, Chinese Academy of Sciences, Institute Computational Mathematics, Beijing 100190, China
Wujian Peng*
Affiliation:
School of Mathematics and Information Sciences, Zhaoqing University, Zhaoqing, Guangdong 526061, China
*
Corresponding author. URL:http://lsec.cc.ac.cn/~linq/english_version.html, Email: linq@lsec.cc.ac.cn
Email: douglas_peng@yahoo.com
Get access

Abstract

An acceleration scheme based on stationary iterative methods is presented for solving linear system of equations. Unlike Chebyshev semi-iterative method which requires accurate estimation of the bounds for iterative matrix eigenvalues, we use a wide range of Chebyshev-like polynomials for the accelerating process without estimating the bounds of the iterative matrix. A detailed error analysis is presented and convergence rates are obtained. Numerical experiments are carried out and comparisons with classical Jacobi and Chebyshev semi-iterative methods are provided.

Keywords

65F1015A06Iterative methoderror analysisrecurrence
Type
Research Article
Information
Advances in Applied Mathematics and Mechanics , Volume 4 , Issue 4 , August 2012 , pp. 473 - 482
Copyright
Copyright © Global-Science Press 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Axelsson, O., Iterative Solution Methods, Cambridge University Press, 1994.Google Scholar
[2]Chandrasekaren, S. and Ipsen, I. C. F, On the sensitivity of solution components in linear systems of equations, SIAM J. Matrix. Appl., 16 (1995), pp. 93–112.CrossRefGoogle Scholar
[3]Datta, B. N., Numerical Linear Algebra and Applications, Brooks/Cole Publishing Company, Pacific Grove, California, 1995.Google Scholar
[4]Golub, G. H. and Van Loan, Charles F., Matrix Computation (Third edition), The John Hopkins University Press, Baltimore and London, 1996.Google Scholar
[5]Hageman, L. A. and Young, D. M., Applied Iterative Methods, Academic Press, New York, 1981.Google Scholar
[6]Hackbusch, W., Iterative Solution of Large Sparse System of Equations, Springer-Verlag, New York, 1994.CrossRefGoogle Scholar
[7]Golub, G. H. and Varga, R. S., Chebyshev semi-iterative methods, successive over-relaxation iterative methods, and second order Riechardson iterative methods, Parts I and II, Numer. Math., 3 (1961), pp. 147–156, 157–168.Google Scholar
[8]Varga, R.S, Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1962.Google Scholar
[9]Young, D. M., Iterative Solution of Large Linear Systems, Academic Press, New York, 1971.Google Scholar