On parallelizable eigensolvers (Q1201930): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587874 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Axel Ruhe / rank | |||
Normal rank | |||
Revision as of 11:15, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On parallelizable eigensolvers |
scientific article |
Statements
On parallelizable eigensolvers (English)
0 references
17 January 1993
0 references
It is shown that, if one has a polynomial that is close to zero on a subset of the eigenvalues of a matrix, one can approximatively divide its eigenvalue problem into two. It is proposed that such a division should be the basis of a divide and conquer strategy for eigenvalue computation, but no way is devised to find such an annihilating polynomial.
0 references
parallel algorithms
0 references
invariant subspaces
0 references
block triangularization algorithm
0 references
eigenvalues
0 references
divide and conquer strategy
0 references
