Fast O(n) complexity algorithms for diagonal innovation matrices (Q3698157)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast O(n) complexity algorithms for diagonal innovation matrices |
scientific article |
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
