Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Fast Algorithms for Centro-Symmetric and Centro-Skewsymmetric Toeplitz-Plus-Hankel Matrices
| |
|
Fast Algorithms for Centro-Symmetric and Centro-Skewsymmetric Toeplitz-Plus-Hankel Matrices Georg Heinig1 and Karla Rost2  | (1) | Department of Mathematics and Computer Science, Kuwait University, P.O. Box 5969, Safat, 13060, Kuwait |
| (2) | Department of Mathematics, University of Chemnitz, D-09107 Chemnitz, Germany |
Abstract Subject of the paper are centro-symmetric and centro-skewsymmetric Toeplitz-plus-Hankel matrices with the property that all central submatrices are nonsingular. Fast algorithms are presented that solve an n× n system of equations with O( n
2) operations in sequential and O( n) operations in parallel processing and compute the ZW-factorization with the same computational complexity. These algorithms are more efficient than existing algorithms because they fully exploit the symmetry properties of the matrices. Toeplitz-plus-Hankel matrix - fast algorithm - ZW-factorization - WZ-factorization - centro-symmetric matrix
Fulltext Preview (Small, Large)
|
|
|
|
|
|