|
Assessment Of Some Acceleration Schemes In The Solution Of Systems Of Linear Equations.
[Full Text]
AUTHOR(S)
S. Azizu, S.B. Twum
KEYWORDS
Index Terms: Acceleration methods, Convergence, Spectral radius, Systems of linear equations, Acceleration scheme.
ABSTRACT
Abstract: In this paper, assessment of acceleration schemes in the solution of systems of linear equations has been studied. The iterative methods: Jacobi, Gauss-Seidel and SOR methods were incorporated into the acceleration scheme (Chebyshev extrapolation, Residual smoothing, Accelerated gradient and Richardson Extrapolation) to speed up their convergence. The Conjugate gradient methods of GMRES, BICGSTAB and QMR were also assessed. The research focused on Banded systems, Tridiagonal systems and Dense Symmetric positive definite systems of linear equations for numerical experiments. The experiments were based on the following performance criteria: convergence, number of iterations, speed of convergence and relative residual of each method. Matlab version 7.0.1 was used for the computation of the resulting algorithms. Assessment of the numerical results showed that the accelerated schemes improved the performance of Jacobi, Gauss-Seidel and SOR methods. The Chebyshev and Richardson acceleration methods converged faster than the conjugate gradient methods of GMRES, MINRES, QMR and BICGSTAB in general.
REFERENCES
[1] Fink, K.D and Mathews, J.H. (2004). Numerical Methods Using Matlab 4th Edition. Person Education Inc, Upper Saddle River. New Jessey
[2] Iqbal J, Arif M, Ayaz M, (2013). Preconditioned Iterative methods for Linear Systems. Life Science Journal 10(3s): 467-470
[3] Santos, R. and Linhares (1986). Convergence of Chebyshev Semi-Iterative methods.Journal of Applied Mathematics 16(59-68).North-Holland.
[4] Wrigley, H.E. (1963). Accelerating the Jacobi method for solving simultaneous equations When the eigenvalue of iterative methods are complex.www.ams.org/mcom/1984-42-166/S0025-5718-1984-0736453-8
[5] Varga, R.S. (1962). Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, N.J
[6] Hadjidimos A, (1978). Accelerated Overrelaxation Method. Mathematics of Computation. 32(141): 149-157
[7] Brezinski, C. (1996).Variations of Richardson’s methods and acceleration. Mathematics Subject Classification. 33-44
[8] Young D.M, Iterative Solution of Large Linear Systems, Academic Press, New York, NY, USA, 1971.
[9] Bai, Y. Xiao, Y. and Ma, W. (2013). The Preconditioned SOR Iterative methods for Positive Definite Matrices. A journal of Applied Mathematics.
www.hindawi.com/journals/jam/2013/732834.pdf
[10] Gutknecht, M.H. and Rolin, S. (2002) . Chebyshev iterative Revisited. Parallel Computing. 26 (263 – 283).
[11] Duan, L. and Zheng, B. (2008). Chebyshev polynomial acceleration of SOR solving the rank of Deficient linear system.. Department of Mathematics, Lanzhou University
a. Lanzhou 730000, PR China. 1-16
[12] Kelley, C.T. (1995). Iterative methods for linear and Nonlinear Equations. Society for Industrial and Applied Mathematics. http://www4.ncsu.edu/~ctk/fr16_book.pdf
[13] Burden, R.L. and Faires, J.D. (2012). Direct Methods for solving Systems. Numerical Methods 4th Edition. Dublin City University.
|
