Multiple shift second order sequential best rotation algorithm for polynomial matrix EVD

Zeliang Wang, John G. McWhirter, Jamie Corr, Stephan Weiss

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

20 Citations (Scopus)

Abstract

In this paper, we present an improved version of the second order sequential best rotation algorithm (SBR2) for polynomial matrix eigenvalue decomposition of para-Hermitian matrices. The improved algorithm is entitled multiple shift SBR2 (MS-SBR2) which is developed based on the original SBR2 algorithm. It can achieve faster convergence than the original SBR2 algorithm by means of transferring more off-diagonal energy onto the diagonal at each iteration. Its convergence is proved and also demonstrated by means of a numerical example. Furthermore, simulation results are included to compare its convergence characteristics and computational complexity with the original SBR2, sequential matrix diagonalization (SMD) and multiple shift maximum element SMD algorithms.
LanguageEnglish
Title of host publication23rd European Signal Processing Conference
PublisherIEEE
Pages844--848
Number of pages5
ISBN (Print)978-0-9928626-3-3
DOIs
Publication statusPublished - 2015

Fingerprint

Polynomials
Computational complexity
Decomposition

Keywords

  • second order sequential best rotation algorithm
  • SBR2
  • polynomial matrix eigen value decomposition

Cite this

Wang, Z., McWhirter, J. G., Corr, J., & Weiss, S. (2015). Multiple shift second order sequential best rotation algorithm for polynomial matrix EVD. In 23rd European Signal Processing Conference (pp. 844--848). IEEE. https://doi.org/10.1109/EUSIPCO.2015.7362502
Wang, Zeliang ; McWhirter, John G. ; Corr, Jamie ; Weiss, Stephan. / Multiple shift second order sequential best rotation algorithm for polynomial matrix EVD. 23rd European Signal Processing Conference. IEEE, 2015. pp. 844--848
@inproceedings{81cad1167c19474e9d86cc8c5a94e366,
title = "Multiple shift second order sequential best rotation algorithm for polynomial matrix EVD",
abstract = "In this paper, we present an improved version of the second order sequential best rotation algorithm (SBR2) for polynomial matrix eigenvalue decomposition of para-Hermitian matrices. The improved algorithm is entitled multiple shift SBR2 (MS-SBR2) which is developed based on the original SBR2 algorithm. It can achieve faster convergence than the original SBR2 algorithm by means of transferring more off-diagonal energy onto the diagonal at each iteration. Its convergence is proved and also demonstrated by means of a numerical example. Furthermore, simulation results are included to compare its convergence characteristics and computational complexity with the original SBR2, sequential matrix diagonalization (SMD) and multiple shift maximum element SMD algorithms.",
keywords = "second order sequential best rotation algorithm, SBR2, polynomial matrix eigen value decomposition",
author = "Zeliang Wang and McWhirter, {John G.} and Jamie Corr and Stephan Weiss",
year = "2015",
doi = "10.1109/EUSIPCO.2015.7362502",
language = "English",
isbn = "978-0-9928626-3-3",
pages = "844----848",
booktitle = "23rd European Signal Processing Conference",
publisher = "IEEE",

}

Wang, Z, McWhirter, JG, Corr, J & Weiss, S 2015, Multiple shift second order sequential best rotation algorithm for polynomial matrix EVD. in 23rd European Signal Processing Conference. IEEE, pp. 844--848. https://doi.org/10.1109/EUSIPCO.2015.7362502

Multiple shift second order sequential best rotation algorithm for polynomial matrix EVD. / Wang, Zeliang; McWhirter, John G. ; Corr, Jamie; Weiss, Stephan.

23rd European Signal Processing Conference. IEEE, 2015. p. 844--848.

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

TY - GEN

T1 - Multiple shift second order sequential best rotation algorithm for polynomial matrix EVD

AU - Wang, Zeliang

AU - McWhirter, John G.

AU - Corr, Jamie

AU - Weiss, Stephan

PY - 2015

Y1 - 2015

N2 - In this paper, we present an improved version of the second order sequential best rotation algorithm (SBR2) for polynomial matrix eigenvalue decomposition of para-Hermitian matrices. The improved algorithm is entitled multiple shift SBR2 (MS-SBR2) which is developed based on the original SBR2 algorithm. It can achieve faster convergence than the original SBR2 algorithm by means of transferring more off-diagonal energy onto the diagonal at each iteration. Its convergence is proved and also demonstrated by means of a numerical example. Furthermore, simulation results are included to compare its convergence characteristics and computational complexity with the original SBR2, sequential matrix diagonalization (SMD) and multiple shift maximum element SMD algorithms.

AB - In this paper, we present an improved version of the second order sequential best rotation algorithm (SBR2) for polynomial matrix eigenvalue decomposition of para-Hermitian matrices. The improved algorithm is entitled multiple shift SBR2 (MS-SBR2) which is developed based on the original SBR2 algorithm. It can achieve faster convergence than the original SBR2 algorithm by means of transferring more off-diagonal energy onto the diagonal at each iteration. Its convergence is proved and also demonstrated by means of a numerical example. Furthermore, simulation results are included to compare its convergence characteristics and computational complexity with the original SBR2, sequential matrix diagonalization (SMD) and multiple shift maximum element SMD algorithms.

KW - second order sequential best rotation algorithm

KW - SBR2

KW - polynomial matrix eigen value decomposition

UR - http://www.eusipco2015.org/

U2 - 10.1109/EUSIPCO.2015.7362502

DO - 10.1109/EUSIPCO.2015.7362502

M3 - Conference contribution book

SN - 978-0-9928626-3-3

SP - 844

EP - 848

BT - 23rd European Signal Processing Conference

PB - IEEE

ER -

Wang Z, McWhirter JG, Corr J, Weiss S. Multiple shift second order sequential best rotation algorithm for polynomial matrix EVD. In 23rd European Signal Processing Conference. IEEE. 2015. p. 844--848 https://doi.org/10.1109/EUSIPCO.2015.7362502