The Computer Realization of the QR Decomposition on Matrices with Full Column Rank

Author

Feng Tianxiang ; Liu Hongxia

Author_Institution

Dept. of Basic Courses, Dongguan Coll., Dongguan, China

Volume

2

fYear

2009

fDate

11-14 Dec. 2009

Firstpage

76

Lastpage

79

Abstract

The QR decomposition of matrix is an especial tool for matrix calculation, although its decomposition process is very complex. Some specified n-1 components of the n-dimensional nonzero vector x need to be transformed into zeros by using householder transformation many times. Or a special kind of given transformation would be used repeatedly to transform one specified component of the vector x into zero. In this paper, the elementary transformation method for solving the QR decomposition expression of matrix is presented; meanwhile, the QR decomposition expression of matrix is also obtained by using Doolittle decomposition method.

Keywords

matrix decomposition; Doolittle decomposition method; QR decomposition; elementary transformation method; full column rank; householder transformation; matrix calculation; matrix decomposition process; n-dimensional nonzero vector; Algebra; Computational intelligence; Computer security; Data mining; Educational institutions; Interference; Matrix decomposition; Narrowband; Signal detection; Symmetric matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Security, 2009. CIS '09. International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-5411-2

Type

conf

DOI

10.1109/CIS.2009.54

Filename

5375939