Analysis and comparison of QR decomposition algorithm in some types of matrix

A. S. Nugraha, T. Basaruddin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

QR decomposition of matrix is one of the important problems in the field of matrix theory. Besides, there are also so many extensive applications that using QR decomposition. Because of that, there are many researchers have been studying about algorithm for this decomposition. Two of those researchers are Feng Tianxiang and Liu Hongxia. In their paper, they proposed new algorithm to make QR decomposition with the elementary operation that is elementary row operations. This paper gives review of their paper, the analysis and numerical experiment using their algorithm, comparison with other existing algorithms and also suggestion for using other existing better algorithm that also has same features with theirs. Beside of them, we also compare all of these algorithms for some types of matrix. The result can be seen at this paper also.

Original languageEnglish
Title of host publication2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012
Pages561-565
Number of pages5
Publication statusPublished - 2012
Event2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012 - Wroclaw, Poland
Duration: 9 Sept 201212 Sept 2012

Publication series

Name2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012

Conference

Conference2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012
Country/TerritoryPoland
CityWroclaw
Period9/09/1212/09/12

Fingerprint

Dive into the research topics of 'Analysis and comparison of QR decomposition algorithm in some types of matrix'. Together they form a unique fingerprint.

Cite this