Search

In this paper, an iterative algorithm is constructed to improve the solution of a system of linear equations, of the form Ax = b, when it is solved using the Gauss-Jordan method and by using finite arithmetic. Understanding the functioning of the algorithm, showing its scope and analyzing how it is deduced, is achieved through the concept of matrix norm, together with some of its properties. The concept of the condition number of a matrix is introduced, and are found bounds for it by using the matrix norms. Finally, it is explained the iterative algorithm of the Refinement, showing the power of this one, when it is solved a system of linear equations ill conditioned. [ABSTRACT FROM AUTHOR]

Copyright of Revista Cubana de Ciencias Informáticas is the property of Universidad de las Ciencias Informaticas (UCI) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)