On Graded QR Decompositions of Products of Matrices

Loading...
Thumbnail Image

Files

CS-TR-3263.ps (159.71 KB)
No. of downloads: 124
CS-TR-3263.pdf (177.59 KB)
No. of downloads: 499

Publication or External Link

Date

1998-10-15

Advisor

Citation

DRUM DOI

Abstract

This paper is concerned with the singular values and vectors of a product $M_{m}=A_{1}A_{2}\cdots A_{m}$ of matrices of order $n$. The chief difficulty with computing them from directly from $M_{m}$ is that with increasing $m$ the ratio of the small to the large singular values of $M_{m}$ may fall below the rounding unit, so that the former are computed inaccurately. The solution proposed here is to compute recursively the factorization $M_{m} = QRP\trp$, where $Q$ is orthogonal, $R$ is a graded upper triangular, and $P\trp$ is a permutation. (Also cross-referenced as UMIACS-TR-94-53)

Notes

Rights