ALGEBRAIC VERSIONS OF TWO GEOMETRIC METHODS FOR SOLVING SYSTEMS OF LINEAR EQUATIONS

Document Type : Original Article

Authors
Department of Mathematics, Lorestan University, Khorramabad, Iran.
10.22034/maco.5.2.10
Abstract
In this article, we obtain algebraic versions of algorithms NGHK and KL (two geometric methods for solving systems
of linear equations), that is, we show that in these two algorithms,
the vector sequences that converge to the solution of the system of
linear equations are located in the row space of the coefficients matrix of system. In the following, we will compare these algorithms
with the Gauss-Seidel method by providing a few examples.
In this article, we obtain algebraic versions of algorithms NGHK and KL (two geometric methods for solving systems
of linear equations), that is, we show that in these two algorithms,
the vector sequences that converge to the solution of the system of
linear equations are located in the row space of the coefficients matrix of system. In the following, we will compare these algorithms
with the Gauss-Seidel method by providing a few examples.

Keywords

Subjects


[1] M. Kryshchuk, J. Lavendels, Iterative method for solving a system of linear equations. Procedia Computer Science 104, 133–137, 2017.
[2] B. N. Datta, Numerical Linear Algebra and Applications, Second Edition. SIAM, 2010.
[3] J. Demmel, Applied numerical linear algebra. SIAM, Philadelphia, PA, 1997.
[4] N. Najafi, M. Ghasemi Kamalvand, A geometric method for solving systems of linear equations. J. Korean Soc. Ind. Appl. Math. Vol.29, No.1, 16–25, 2025.
[5] M. Ghasemi Kamalvand, B.Farazmandnia and M.Aliyari, A method for solving of linear system with normal coefficient matrices. J. Korean Soc. Ind. Appl. Math. Vol.24, No.3, 305–320, 2020.
[6] M. Ghasemi Kamalvand, Kh. D. Ikramov, A method of congruent type for linear systems with conjugatenormal coefficient matrices. Computational mathematic and physics, Vol. 49, No. 2, 203-216, 2009.
[7] M. Ghasemi Kamalvand, Kh. D. Ikramov, Low-rank perturbations of normal and conjugate-normal matrices and their condensed forms under unitary similarities and congruences. Computational mathematic and physics, Vol. 33, No. 3, 109-116, 2009.
[8] M. Ghasemi Kamalvand, M. Moradipour, K. Niazi Asil, A matrix reduction based algorithm to solve kalmost normal systems Filomat, Volume 38(26), 9143-9150, 2024, https://doi.org/10.2298/FIL2426143G.
[9] M. Ghasemi Kamalvand, K. Niazi Asil, Indefinite Ruhe’s Variant of the Block Lanczos Method for Solving the Systems of Linear Equations Advances in Mathematical Physics, Volume 2020, Article ID 2439801, 9 pages, https://doi.org/10.1155/2020/2439801.
[10] Y. Saad, Iterative Methods for Sparse Linear Systems, Second Edition. SIAM, 2003.