RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 General information Latest issue Forthcoming papers Archive Impact factor Editorial staff Guidelines for authors License agreement Editorial policy Submit a manuscript Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Vestn. Samar. Gos. Tekhn. Univ., Ser. Fiz.-Mat. Nauki [J. Samara State Tech. Univ., Ser. Phys. Math. Sci.]: Year: Volume: Issue: Page: Find

 Vestn. Samar. Gos. Tekhn. Univ., Ser. Fiz.-Mat. Nauki [J. Samara State Tech. Univ., Ser. Phys. Math. Sci.], 2016, Volume 20, Number 4, Pages 730–738 (Mi vsgtu1496)

Mathematical Modeling, Numerical Methods and Software Complexes

On a computer implementation of the block Gauss–Seidel method for normal systems of equations

A. I. Zhdanov, E. Yu. Bogdanova

Samara State Technical University, Samara, 443100, Russian Federation

Abstract: This article focuses on the modification of the block option Gauss-Seidel method for normal systems of equations, which is a sufficiently effective method of solving generally overdetermined, systems of linear algebraic equations of high dimensionality. The main disadvantage of methods based on normal equations systems is the fact that the condition number of the normal system is equal to the square of the condition number of the original problem. This fact has a negative impact on the rate of convergence of iterative methods based on normal equations systems. To increase the speed of convergence of iterative methods based on normal equations systems, for solving ill-conditioned problems currently different preconditioners options are used that reduce the condition number of the original system of equations. However, universal preconditioner for all applications does not exist. One of the effective approaches that improve the speed of convergence of the iterative Gauss–Seidel method for normal systems of equations, is to use its version of the block. The disadvantage of the block Gauss–Seidel method for production systems is the fact that it is necessary to calculate the pseudoinverse matrix for each iteration. We know that finding the pseudoinverse is a difficult computational procedure. In this paper, we propose a procedure to replace the matrix pseudo-solutions to the problem of normal systems of equations by Cholesky. Normal equations arising at each iteration of Gauss–Seidel method, have a relatively low dimension compared to the original system. The results of numerical experimentation demonstrating the effectiveness of the proposed approach are given.

Keywords: normal equations, block Gauss–Seidel method, Cholesky method, linear algebraic systems of large dimension.

DOI: https://doi.org/10.14498/vsgtu1496

Full text: PDF file (852 kB) (published under the terms of the Creative Commons Attribution 4.0 International License)
References: PDF file   HTML file

Bibliographic databases:

Document Type: Article
UDC: 519.612
MSC: 65F10
Original article submitted 20/VI/2016
revision submitted – 02/IX/2016

Citation: A. I. Zhdanov, E. Yu. Bogdanova, “On a computer implementation of the block Gauss–Seidel method for normal systems of equations”, Vestn. Samar. Gos. Tekhn. Univ., Ser. Fiz.-Mat. Nauki [J. Samara State Tech. Univ., Ser. Phys. Math. Sci.], 20:4 (2016), 730–738

Citation in format AMSBIB
\Bibitem{ZhdBog16} \by A.~I.~Zhdanov, E.~Yu.~Bogdanova \paper On a computer implementation of the block Gauss--Seidel method for normal systems of equations \jour Vestn. Samar. Gos. Tekhn. Univ., Ser. Fiz.-Mat. Nauki [J. Samara State Tech. Univ., Ser. Phys. Math. Sci.] \yr 2016 \vol 20 \issue 4 \pages 730--738 \mathnet{http://mi.mathnet.ru/vsgtu1496} \crossref{https://doi.org/10.14498/vsgtu1496} \zmath{https://zbmath.org/?q=an:06964666} \elib{http://elibrary.ru/item.asp?id=28862965}