A method for separating nearly multiple eigenvalues for Hermitian matrix (Q861925): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4949347 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational error bounds for multiple or nearly multiple eigenvalues / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5674306 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple method for error bounds of eigenvalues of symmetric matrices / rank | |||
Normal rank | |||
Latest revision as of 12:40, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A method for separating nearly multiple eigenvalues for Hermitian matrix |
scientific article |
Statements
A method for separating nearly multiple eigenvalues for Hermitian matrix (English)
0 references
2 February 2007
0 references
The following problem is discussed: Given a symmetric matrix and assume that by one of the methods of verified computation a small interval has been determined which encloses \(k\) of its eigenvalues. Verify that they are not a k-fold eigenvalue. An algorithm using verified computation, e.g. using INTLAB, is given, which can decide this question. Two examples with \(k=2\) (the infamous Wilkinson matrix) and \(k=3\) illustrate the method.
0 references
multiple eigenvalue
0 references
symmetric matrix
0 references
verified computation
0 references
numerical examples
0 references
eigenvalue enclosure
0 references
algorithm
0 references
Wilkinson matrix
0 references
