On parallelizable eigensolvers (Q1201930)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 98830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On parallelizable eigensolvers |
scientific article; zbMATH DE number 98830 |
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
0.8114209175109863
0 references
0.8032492399215698
0 references
0.7907798886299133
0 references
