Picture of boy being examining by doctor at a tuberculosis sanatorium

Understanding our future through Open Access research about our past...

Strathprints makes available scholarly Open Access content by researchers in the Centre for the Social History of Health & Healthcare (CSHHH), based within the School of Humanities, and considered Scotland's leading centre for the history of health and medicine.

Research at CSHHH explores the modern world since 1800 in locations as diverse as the UK, Asia, Africa, North America, and Europe. Areas of specialism include contraception and sexuality; family health and medical services; occupational health and medicine; disability; the history of psychiatry; conflict and warfare; and, drugs, pharmaceuticals and intoxicants.

Explore the Open Access research of the Centre for the Social History of Health and Healthcare. Or explore all of Strathclyde's Open Access research...

Image: Heart of England NHS Foundation Trust. Wellcome Collection - CC-BY.

Multiple shift maximum element sequential matrix diagonalisation for parahermitian matrices

Corr, Jamie and Thompson, Keith and Weiss, Stephan and McWhirter, John G. and Redif, Soydan and Proudler, Ian K. (2014) Multiple shift maximum element sequential matrix diagonalisation for parahermitian matrices. In: 2014 IEEE Workshop on Statistical Signal Processing (SSP), 2014-06-29 - 2014-07-02, Australia.

[img]
Preview
PDF (Corr-etal-SSP2014-multiple-shift-maximum-element-sequential-matrix)
1569904845.pdf
Accepted Author Manuscript

Download (348kB) | Preview

Abstract

A polynomial eigenvalue decomposition of paraher-mitian matrices can be calculated approximately using iterative approaches such as the sequential matrix diagonalisation (SMD) algorithm. In this paper, we present an improved SMD algorithm which, compared to existing SMD approaches, eliminates more off-diagonal energy per step. This leads to faster convergence while incurring only a marginal increase in complexity. We motivate the approach, prove its convergence, and demonstrate some results that underline the algorithm's performance.