Fast algorithm for solving the Hankel/Toeplitz structured total least squares problem (Q1587018)
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 1534757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithm for solving the Hankel/Toeplitz structured total least squares problem |
scientific article; zbMATH DE number 1534757 |
Statements
Fast algorithm for solving the Hankel/Toeplitz structured total least squares problem (English)
0 references
22 November 2000
0 references
The authors consider the Toeplitz (Hankel) structured total least squares problem in which the Toeplitz (Hankel) structure has to be preserved. A fast implementation of an algorithm is given by exploiting the low displacement rank of the involved matrices and the sparsity of the associated generators. Comparisons are presented and computational complexity is examined.
0 references
Hankel/Toeplitz matrix
0 references
displacement rank
0 references
comparisons
0 references
structured total least squares problem
0 references
algorithm
0 references
computational complexity
0 references
0.8799672722816467
0 references
0.8619486689567566
0 references
0.8473738431930542
0 references
