Virual Oral Presentation Slide by Slide

IEEE/ICACT20210153 Slide.12        [Big Slide]	Oral Presentation
	The Francis-Kublanovskaya recursion, in which each iteration is a similarity transformation based on the QR decomposition, is used to calculate the eigenvalue decomposition of the Hermitian matrix Theta. At iteration k, the matrix Theta(k) is decomposed into the product of a unitary matrix Q(k) and an upper triangular matrix R(k). By multiplying R(k) by Q(k), a similarity transformation of the matrix Theta(k) is obtained. If k approaches infinity, then the matrix Theta(k) converges to a diagonal matrix, Lambda, whose elements are the eigenvalues of the initial Theta. The wordlength of Q is qwl, and the wordlength of Theta and Lambda is theta wl = lambda wl.

[Go to Next Slide]

Select Voice: Virtual Oral Presentation!!