Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices (Q2501234): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:45, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices |
scientific article |
Statements
Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices (English)
0 references
4 September 2006
0 references
The authors propose, test and compare three fast and stable divide and conquer algorithms for computing all the eigenvalues and eigenvectors of real matrices of the form \(D+U+U^T\), where \(D\) is diagonal and \(U\) is the upper triangular part of a rank-one matrix.
0 references
semiseparable matrix
0 references
eigenvalues
0 references
eigenvectors
0 references
