Fast algorithms for Toeplitz and Hankel matrices (Q2431168)
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 5877074
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for Toeplitz and Hankel matrices |
scientific article; zbMATH DE number 5877074 |
Statements
Fast algorithms for Toeplitz and Hankel matrices (English)
0 references
11 April 2011
0 references
The paper presents a self-contained survey of fast algorithms for solving linear systems of equations with Toeplitz or Hankel coefficient matrices. The authors discuss algorithms of Levinson-type and Schur-type. In the case in which the matrices have additional symmetry properties, the authors develop split algorithms.
0 references
Toeplitz matrix
0 references
Hankel matrix
0 references
Levinson algorithm
0 references
Schur algorithm
0 references
LU-factorization
0 references
ZW-factorization
0 references
0 references
0 references
0 references
0 references
0.97524154
0 references
0 references
0.95501184
0 references
0.9410986
0 references
0.93795687
0 references
0 references
0.9235952
0 references
