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

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 norm...

Full description

Bibliographic Details
Main Authors: Alexander I. Zhdanov, Ekaterina Yu. Bogdanova
Format: Article
Language:English
Published: Samara State Technical University 2016-12-01
Series:Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki
Subjects:
Online Access:http://mi.mathnet.ru/eng/vsgtu1496
id doaj-50d4007e846c45c38d8ff05a158f0da8
record_format Article
spelling doaj-50d4007e846c45c38d8ff05a158f0da82020-11-24T21:48:36ZengSamara State Technical UniversityVestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki1991-86152310-70812016-12-0120473073810.14498/vsgtu1496On a computer implementation of the block Gauss–Seidel method for normal systems of equationsAlexander I. Zhdanov0Ekaterina Yu. Bogdanova1Samara State Technical University, Samara, 443100, Russian FederationSamara State Technical University, Samara, 443100, Russian FederationThis 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. http://mi.mathnet.ru/eng/vsgtu1496normal equationsblock Gauss–Seidel methodCholesky methodlinear algebraic systems of large dimension
collection DOAJ
language English
format Article
sources DOAJ
author Alexander I. Zhdanov
Ekaterina Yu. Bogdanova
spellingShingle Alexander I. Zhdanov
Ekaterina Yu. Bogdanova
On a computer implementation of the block Gauss–Seidel method for normal systems of equations
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki
normal equations
block Gauss–Seidel method
Cholesky method
linear algebraic systems of large dimension
author_facet Alexander I. Zhdanov
Ekaterina Yu. Bogdanova
author_sort Alexander I. Zhdanov
title On a computer implementation of the block Gauss–Seidel method for normal systems of equations
title_short On a computer implementation of the block Gauss–Seidel method for normal systems of equations
title_full On a computer implementation of the block Gauss–Seidel method for normal systems of equations
title_fullStr On a computer implementation of the block Gauss–Seidel method for normal systems of equations
title_full_unstemmed On a computer implementation of the block Gauss–Seidel method for normal systems of equations
title_sort on a computer implementation of the block gauss–seidel method for normal systems of equations
publisher Samara State Technical University
series Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki
issn 1991-8615
2310-7081
publishDate 2016-12-01
description 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.
topic normal equations
block Gauss–Seidel method
Cholesky method
linear algebraic systems of large dimension
url http://mi.mathnet.ru/eng/vsgtu1496
work_keys_str_mv AT alexanderizhdanov onacomputerimplementationoftheblockgaussseidelmethodfornormalsystemsofequations
AT ekaterinayubogdanova onacomputerimplementationoftheblockgaussseidelmethodfornormalsystemsofequations
_version_ 1725891327925682176