Hybrid algorithm for fast Toeplitz orthogonalization
Abstract
New techniques for fast Toeplitz QR decomposition are presented. The methods are based on the shift invariance property of a Toeplitz matrix. The numerical properties of the algorithms are discussed and some comparisons are made with two other fast Toeplitz orthogonalization methods.
Authors
Qiao S
Journal
Numerische Mathematik, Vol. 53, No. 3, pp. 351–366