### 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 language | English |
---|---|

Title of host publication | 2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012 |

Pages | 561-565 |

Number of pages | 5 |

Publication status | Published - 1 Dec 2012 |

Event | 2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012 - Wroclaw, Poland Duration: 9 Sep 2012 → 12 Sep 2012 |

### Publication series

Name | 2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012 |
---|

### Conference

Conference | 2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012 |
---|---|

Country | Poland |

City | Wroclaw |

Period | 9/09/12 → 12/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

*2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012*(pp. 561-565). [6354470] (2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012).