A note on the accuracy of symmetric eigenreduction algorithms (Q1920183)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1920183 |
scientific article; zbMATH DE number 918319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the accuracy of symmetric eigenreduction algorithms |
scientific article; zbMATH DE number 918319 |
Statements
A note on the accuracy of symmetric eigenreduction algorithms (English)
0 references
7 April 1997
0 references
The aim of this paper is to call attention to the following phenomenon: on highly ill-conditioned Hermitian matrices the relative accuracy of small eigenvalues computed by QR eigenreduction may drastically depend on the initial permutation of the rows and columns. The author illustrates and discusses this phenomenon on a set of examples. Random matrices and some special matrices are considered. In the result of experimental investigation some practical conclusions are given.
0 references
symmetric eigenreduction algorithms
0 references
numerical examples
0 references
ill-conditioned Hermitian matrices
0 references
accuracy
0 references
small eigenvalues
0 references
QR eigenreduction
0 references
0.823839008808136
0 references
0.7830448150634766
0 references
