Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices (Q4729243)
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: Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices |
scientific article; zbMATH DE number 4113859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices |
scientific article; zbMATH DE number 4113859 |
Statements
Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices (English)
0 references
1989
0 references
Szegö polynomial
0 references
Levinson polynomial
0 references
Levinson-Durbin algorithm
0 references
reflection coefficients
0 references
Hermitian, positive definite Toeplitz matrix
0 references
three-term recurrence relation
0 references
0.9231969
0 references
0.88885975
0 references
0.8821798
0 references
0.8765461
0 references
0.87653726
0 references
0.87608516
0 references
0.87530196
0 references
0.8727429
0 references
0.8693418
0 references
0.8677594
0 references
