A fast but unstable orthogonal triangularization...

A fast but unstable orthogonal triangularization technique for Toeplitz matrices

Abstract

D. Sweet's clever QR decomposition algorithm for Toeplitz matrices is considered. It requires only O(n2) flops to factor an n × n matrix. We analyze the algorithm to point out its deficiencies, and compare it against two other Toeplitz solvers.

Authors

Luk FT; Qiao S

Journal

Linear Algebra and its Applications, Vol. 88, , pp. 495–506

Publisher

Elsevier

Publication Date

January 1, 1987

DOI

10.1016/0024-3795(87)90122-4

ISSN

0024-3795

Associated Experts

Sanzheng Qiao

Professor Emeritus, Faculty of Engineering

Visit profile

Labels

Fields of Research (FoR)

4006 Communications Engineering 40 Engineering 49 Mathematical sciences

View published work (Non-McMaster Users)

View published work (McMaster Users)

Contact the Experts team

Get technical help

Provide website feedback