Please use this identifier to cite or link to this item:
https://doi.org/10.1007/s00211-002-0431-z
DC Field | Value | |
---|---|---|
dc.title | A QR-type reduction for computing the SVD of a general matrix product/quotient | |
dc.contributor.author | Chu, D. | |
dc.contributor.author | De Lathauwer, L. | |
dc.contributor.author | De Moor, B. | |
dc.date.accessioned | 2014-10-28T02:29:09Z | |
dc.date.available | 2014-10-28T02:29:09Z | |
dc.date.issued | 2003-07 | |
dc.identifier.citation | Chu, D., De Lathauwer, L., De Moor, B. (2003-07). A QR-type reduction for computing the SVD of a general matrix product/quotient. Numerische Mathematik 95 (1) : 101-121. ScholarBank@NUS Repository. https://doi.org/10.1007/s00211-002-0431-z | |
dc.identifier.issn | 0029599X | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/102740 | |
dc.description.abstract | In this paper, a QR-type reduction technique is developed for the computation of the SVD of a general matrix product/quotient A = A1 s1 A2 s2 ⋯ Am sm with Ai ∈ Rn×n and si = 1 or si = -1. First the matrix A is reduced by at most m QR-factoizations to the form Q11 (1) (Q21 (1))-1, where Q11 (1), Q21 (1) ∈ Rn×n and (Q11 (1)T Q11 (1) + (Q21 (1))T Q21 (1) = I. Then the SVD of A is obtained by computing the CSD (Cosine-Sine Decomposition) of Q11 (1) and Q21 (1) using the Matlab command gsvd. The performance of the proposed method is verified by some numerical examples. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/s00211-002-0431-z | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | MATHEMATICS | |
dc.description.doi | 10.1007/s00211-002-0431-z | |
dc.description.sourcetitle | Numerische Mathematik | |
dc.description.volume | 95 | |
dc.description.issue | 1 | |
dc.description.page | 101-121 | |
dc.identifier.isiut | 000184088500005 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.