Back
 JAMP  Vol.7 No.9 , September 2019
The LA = U Decomposition Method for Solving Systems of Linear Equations
Abstract: A method for solving systems of linear equations is presented based on direct decomposition of the coefficient matrix using the form LAX = LB = B’ . Elements of the reducing lower triangular matrix L can be determined using either row wise or column wise operations and are demonstrated to be sums of permutation products of the Gauss pivot row multipliers. These sums of permutation products can be constructed using a tree structure that can be easily memorized or alternatively computed using matrix products. The method requires only storage of the L matrix which is half in size compared to storage of the elements in the LU decomposition. Equivalence of the proposed method with both the Gauss elimination and LU decomposition is also shown in this paper.
Cite this paper: Tiruneh, A. , Debessai, T. , Bwembya, G. and Nkambule, S. (2019) The LA = U Decomposition Method for Solving Systems of Linear Equations. Journal of Applied Mathematics and Physics, 7, 2031-2051. doi: 10.4236/jamp.2019.79140.
References

[1]   Knott, G.D. (2013) Gaussian Elimination and LU-Decomposition. Civilized Software Inc., Silver Spring.

[2]   Matani, D. (2005) A Distributed Approach for Solving a System of Linear Equations. The Journal of American Science, 1, 1-8.

[3]   Smiley, J. (2010) The Man Who Invented the Computer: The Biography of John Atanasoff. Doubleday, New York.

[4]   Grcar, J.F. (2011) How Ordinary Elimination Became Gaussian Elimination. Historia Mathematica, 38, 163-218.
https://doi.org/10.1016/j.hm.2010.06.003

[5]   Mon, Y. and Kyi, L.L.W. (2014) Performance Comparison of Gauss Elimination and Gauss-Jordan Elimination. International Journal of Computer & Communication Engineering Research, 2, 67-71.

[6]   Kreyszig, E. (2011) Advanced Engineering Mathematics. John Wiley, Hoboken.

[7]   Burden, R.L. and Faires, J.D. (2015) Numerical Analysis. 10th Edition, Cengage Learning, Boston, 285-340.

[8]   Turing, A.M. (1948) Rounding-Off Errors in Matrix Processes. The Quarterly Journal of Mechanics and Applied Mathematics, 1, 287-308.
https://doi.org/10.1093/qjmam/1.1.287

[9]   Computational Sciences (2013) LU Decomposition.
https://computationalsciences.wordpress.com/2013/06/06/lu-decomposition

[10]   Rafique, M. and Ayub, S. (2015) Some Convalescent of Linear Equations. Applied and Computational Mathematics, 4, 207-213.
https://doi.org/10.11648/j.acm.20150403.23

[11]   Wilkinson, J.H. (1988) The Algebraic Eigenvalue Problem. Oxford University Press, Oxford.

[12]   Pascal, F. (2019) Solving Linear Systems. Laboratoire Jacques Louis Lions, UFR de Mathematiques, Sorbonne Université, Paris.
https://www.ljll.math.upmc.fr/frey/ftp/linear%20systems.pdf

[13]   Layton, W. and Sussman, M. (2014) Numerical Linear Algebra. University of Pittsburgh, Pittsburgh, 28-39.

[14]   Nguyen, D. (2010) Cholesky and LDLT Decomposition. University of South Florida, Tampa.
http://nm.mathforcollege.com/#sthash.RljP1TrJ.dpbs

[15]   The GNU Scientific Library, GSL (2019) Linear Algebra: QR Decomposition with Column Pivoting.
https://www.gnu.org/software/gsl/doc/html/_sources/intro.rst.txt

[16]   Čížek, P. and Čížková, L. (2004) Numerical Linear Algebra. Papers/Humboldt-Universität Berlin, Center for Applied Statistics and Economics (CASE), No. 2004, 23, 5-13.

 
 
Top