Fast O(n) complexity algorithms for diagonal innovation matrices (Q3698157)
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 3923960
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast O(n) complexity algorithms for diagonal innovation matrices |
scientific article; zbMATH DE number 3923960 |
Statements
Fast O(n) complexity algorithms for diagonal innovation matrices (English)
0 references
1984
0 references
signal processing
0 references
Toeplitz matrix
0 references
Hankel matrix
0 references
arithmetic complexity
0 references
diagonal innovation matrices
0 references
0.8978918
0 references
0.88876843
0 references
0.8728634
0 references
0.8705262
0 references
0.86724687
0 references
0.8662111
0 references
0 references
0.8651433
0 references
0.86453456
0 references
