Structure and arithmetic complexity of products and inverses of Toeplitz matrices (Q755830): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59341876, #quickstatements; #temporary_batch_1706826133308 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:08, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Structure and arithmetic complexity of products and inverses of Toeplitz matrices |
scientific article |
Statements
Structure and arithmetic complexity of products and inverses of Toeplitz matrices (English)
0 references
1991
0 references
The authors derive a formula for the product of two Toeplitz matrices that is similar to the Trench formula for the inverse of a Toeplitz matrix. They then derive upper and lower bounds for the number of multiplications required to compute the inverse or the product of Toeplitz matrices and consider several special cases. The lower bounds for the general case are in agreement with earlier results. The specialized lower and all upper bounds are new. All bounds are \(O(n^ 2)\) and differ only in the lower order terms.
0 references
computational complexity
0 references
product
0 references
Toeplitz matrices
0 references
Trench formula
0 references
inverse
0 references
bounds
0 references
number of multiplications
0 references
