(1) Computer Sciences Laboratory and Centre for Mathematical Analysis, Australian National University, 2601 Canberra, A.C.T., Australia;(2) Division of Mathematics and Statistics, GPO Box 1965, 2601 Canberra, A.C.T., Australia
Abstract:
Summary This paper presents a new algorithm for computing theQR factorization of anm×n Toeplitz matrix inO(mn) operations. The algorithm exploits the procedure for the rank-1 modification and the fact that both principal (m–1)×(n–1) submatrices of the Toeplitz matrix are identical. An efficient parallel implementation of the algorithm is possible.