Fast algorithms for skewsymmetric Toeplitz matrices (Q4801260)
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 1893698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for skewsymmetric Toeplitz matrices |
scientific article; zbMATH DE number 1893698 |
Statements
19 October 2003
0 references
Levinson algorithm
0 references
Schur algorithm
0 references
LU factorization
0 references
ZW factorization
0 references
skewsymmetric Toeplitz matrices
0 references
Gohberg-Semencul type inversion formulas
0 references
0.901539385318756
0 references
0.8406194448471069
0 references
0.8363471031188965
0 references
Fast algorithms for skewsymmetric Toeplitz matrices (English)
0 references
Like the split Levinson and Schur algorithms [cf. \textit{A. Melman}, Linear Algebra Appl. 301, 145-152 (1999; Zbl 0964.65026); \textit{A. Melman}, SIAM J. Matrix Anal. Appl. 23, 256-270 (2001; Zbl 0992.65015); Linear Algebra Appl. 338, 219-237 (2001; Zbl 0991.65031)], this paper derives corresponding algorithms for skewsymmetric Toeplitz matrices. These algorithms require about half the number of operations of the algorithms for general Toeplitz matrices. They can be used to derive Gohberg-Semencul type inversion formulas, LU and bowtie (ZW) factorizations of the matrix and its inverse and of course to solve linear systems. A numerical error analysis is not included. For the entire collection see [Zbl 1005.00052].
0 references