DocumentCode
705473
Title
An algorithm for polynomial matrix SVD based on generalised Kogbetliantz transformations
Author
McWhirter, John G.
Author_Institution
Sch. of Eng., Cardiff Univ., Cardiff, UK
fYear
2010
fDate
23-27 Aug. 2010
Firstpage
457
Lastpage
461
Abstract
An algorithm is presented for computing the singular value decomposition (SVD) of a polynomial matrix. It takes the form of a sequential best rotation (SBR) algorithm and constitutes a generalisation of the Kogbetliantz technique for computing the SVD of conventional scalar matrices. It avoids “squaring” the matrix to be factorised, uses only unitary and paraunitary operations, and therefore exhibits a high degree of numerical stability.
Keywords
numerical stability; polynomial matrices; singular value decomposition; Kogbetliantz technique; generalised Kogbetliantz transformations; numerical stability; paraunitary operation; polynomial matrix SVD; scalar matrices; sequential best rotation algorithm; singular value decomposition; unitary operation; Jacobian matrices; MIMO; Matrix decomposition; Polynomials; Signal processing; Signal processing algorithms; Singular value decomposition;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Conference, 2010 18th European
Conference_Location
Aalborg
ISSN
2219-5491
Type
conf
Filename
7096746
Link To Document