IMPLEMENTATION OF GRAM-SCHMIDT TRIANGULARIZATION METHOD USING SEQUENTIAL COLUMN POINTER DATA STRUCTURE

In this paper a sequential column pointer data structure is developed and used to implement the Gram-Schmidt triangularization method. This method is used to find the solution of linear equations arising from many surveying and structural problems where the original matrix is non-symmetric and highly sparse, that is, nonzero elements are greatly exceeded by zero elements. An algorithm is developed using the above data structure, and results are compared with the Choleski factorization. Also, a relationship is established between the Gram-Schmidt and the basic Choleski methods.