Skip navigation
Skip navigation

An efficient method for computing eigenvalues of a real normal matrix

Zhou, B. B.; Brent, Richard


Jacobi-based algorithms have attracted attention as they have a high degree of potential parallelism and may be more accurate than QR-based algorithms. In this paper we discuss how to design efficient Jacobi-like algorithms for eigenvalue decomposition of a real normal matrix. We introduce a block Jacobi-like method. This method uses only real arithmetic and orthogonal similarity transformations and achieves ultimate quadratic convergence. A theoretical analysis is conducted and some...[Show more]

CollectionsANU Research Publications
Date published: 2003
Type: Journal article
Source: Journal of Parallel and Distributed Computing
DOI: 10.1016/S0743-7315(03)00007-8


File Description SizeFormat Image
01_Zhou_An_efficient_method_for_2003.pdf221.25 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator