Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile

Authors:
Georg Heinig;Karla Rost
Affiliations:
Dept. of Math. and Comp. Sci., Kuwait University, P.O. Box 5969, Safat 13060, Kuwait;Dept. of Mathematics, Chemnitz University of Technology, D-09107 Chemnitz, Germany
Venue:
Theoretical Computer Science - Algebraic and numerical algorithm
Year:
2004

Citing 4
Cited 0

Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms
Existence and uniqueness of WZ factorization

Parallel Computing
Stability of fast algorithms for structured linear systems

Fast reliable algorithms for matrices with structure
Structured matrices and polynomials: unified superfast algorithms

Structured matrices and polynomials: unified superfast algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Split Levinson-type and Schur-type algorithms for the solutions of linear systems with a nonsingular skewsymmetric Toeplitz matrix are designed. In contrast to previous ones, the algorithms work for any nonsingular skewsymmetric Toeplitz matrix. Moreover, generalizations of ZW- and WZ-factorizations of skewsymmetric Toeplitz matrices related to the new split algorithms are presented.