Fast QR Factorization Algorithms of Toeplitz Matrices based on Stabilized / Hyperbolic Householder Transformations


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 4, pp. 959-966, Apr. 1998
10.3745/KIPSTE.1998.5.4.959,   PDF Download:

Abstract

We present fast QR factorization algorithms for an m?n (m%u2265n) Toeplitz matrix. These QT factorization algorithms are determined from the shift-invariance properties of underlying matrices. The major transformation tool is a stabilized/hyperbolic Householder transformation. The algorithms require O(mm) operations, and can be easily implemented on distributed-memory multiprocessors.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
C. J. Young, "Fast QR Factorization Algorithms of Toeplitz Matrices based on Stabilized / Hyperbolic Householder Transformations," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 4, pp. 959-966, 1998. DOI: 10.3745/KIPSTE.1998.5.4.959.

[ACM Style]
Choi Jae Young. 1998. Fast QR Factorization Algorithms of Toeplitz Matrices based on Stabilized / Hyperbolic Householder Transformations. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 4, (1998), 959-966. DOI: 10.3745/KIPSTE.1998.5.4.959.