QR-like algorithms for eigenvalue problems

[摘要] In the year 2000 the dominant method for solving matrix eigenvalue problems is still the QR algorithm. This paper discusses the family of GR algorithms, with emphasis on the QR algorithm. Included are historical remarks, an outline of what GR algorithms are and why they work, and descriptions of the latest, highly parallelizable, versions of the QR algorithm. Now that we know how to parallelize it, the QR algorithm seems likely to retain its dominance for many years to come. (C) 2000 Elsevier Science B.V. All rights reserved. MSC: 65F15.

[发布日期] 2000-11-01

[关键词] eigenvalue;QR algorithm;GR algorithm