Symmetric centrosymmetric matrix-vector multiplication (Q1593669)
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 1556782
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Symmetric centrosymmetric matrix-vector multiplication |
scientific article; zbMATH DE number 1556782 |
Statements
Symmetric centrosymmetric matrix-vector multiplication (English)
0 references
6 November 2001
0 references
The multiplication of an arbitary vector by a symmetric matrix on a sequential machine requires, in general, \(2n^2\) floating-point operations. In this paper, a method for the multiplication of an arbitrary vector by a symmetric centrosymmetric matrix with \(\frac 54n^2+O(n)\) flops is presented. As the inverse of a symmetric Toeplitz matrix is symmetric centrosymmetric, combining this method with \textit{W. F. Trench}'s algorithm [J. SIAM 12, 515-522 (1964; Zbl 0131.36002)] yields a method for solving Toeplitz systems with the same complexity as \textit{N. Levinson}'s algorithm [J. Math. Phys. 25, 261-278 (1947)].
0 references
Levinson algorithm
0 references
centrosymmetric matrix
0 references
Toeplitz systems
0 references
complexity
0 references
0.7930204272270203
0 references
0.7930204272270203
0 references
0.7831010818481445
0 references
0.7774678468704224
0 references
0.7712205648422241
0 references
