Beruflich Dokumente
Kultur Dokumente
In many engineering and physical problems we come across systems of linear equations, Ax = b,
comprising n linear equations in n unknowns x 1, x2, …,xn, where A = [aij] is an nxn coefficient
T T
matrix, and x = [x1 x2 . . .xn], b = [b1 b2 . . .bn] are the column vectors. The solutions of these
equations have many facets which help us in many regards. These solutions become
tremendously difficult if a linear system has a large number of equations containing a sizeable
number of unknowns. However, the use of computers for the purpose eases the task
considerably. LU-decomposition of the coefficient matrix of a system of equations is a plausible
means to find the solution of such a system, where L = [lij] is a lower triangular matrix and U = [uij]
is an upper triangular matrix. In this paper we present an efficient method for LU-decomposition
2
of the coefficient matrix, which requires evaluation of only (n – 1) number of unknown elements
of the L and U matrices. In contrast, the other methods available in the literature require us to find
2
n unknown terms of the L and U matrices. Thus, the computational time and effort required for
the purpose are substantially reduced.
(ii) The first row of the matrix U= [uij] is also Accordingly, we decompose the coefficient matrix
kept the same as that of the matrix A, i.e., A = LU as,
u1j = a1j, for all j.