Fast order-recursive generalized Hermitian Toeplitz eigenspace decomposition (Q808622)
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: Fast order-recursive generalized Hermitian Toeplitz eigenspace decomposition |
scientific article; zbMATH DE number 4211375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast order-recursive generalized Hermitian Toeplitz eigenspace decomposition |
scientific article; zbMATH DE number 4211375 |
Statements
Fast order-recursive generalized Hermitian Toeplitz eigenspace decomposition (English)
0 references
1991
0 references
A parallel algorithm for the computation of eigenspace decompositions of pencils of Hermitian Toeplitz matrices is given. Even multiple eigenvalues and/or clustered eigenvalues are treated. Performance measures are demonstrated. Eigenbased techniques for array processing are reviewed.
0 references
eigenspace decomposition
0 references
colored noise
0 references
parallel algorithm
0 references
pencils
0 references
Hermitian Toeplitz matrices
0 references
multiple eigenvalues
0 references
clustered eigenvalues
0 references
Performance measures
0 references
array processing
0 references
0.766132652759552
0 references
0.7597395777702332
0 references
0.7584911584854126
0 references
0.7556760907173157
0 references
