This paper deals with the development of a fast algorithm of QR decomposition based on the Householder transform. This paper also shows the correspondence between the recursive QR decomposition based on the proposed algorithm and one based on the Givens rotational matrix. This fact implies a ratinale of the proposed method on the theory of orthogonal linear transform.
