Fast algorithms for centro-symmetric and centro-skewsymmetric Toeplitz-plus-Hankel matrices
From MaRDI portal
Publication:1410480
DOI10.1023/A:1025584509948zbMath1030.65017MaRDI QIDQ1410480
Publication date: 14 October 2003
Published in: Numerical Algorithms (Search for Journal in Brave)
computational complexityparallel computationfast algorithmToeplitz-plus-Hankel matrixcentro-symmetric matrixWZ-factorizationZW-factorization
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (5)
Matrix representations of split Bezoutians ⋮ Incomplete double-cone factorizations of centrosymmetric matrices arising in spectral methods ⋮ Fast algorithms for Toeplitz and Hankel matrices ⋮ Backward errors for eigenproblem of two kinds of structured matrices ⋮ Topics in the numerical linear algebra of Toeplitz and Hankel matrices
This page was built for publication: Fast algorithms for centro-symmetric and centro-skewsymmetric Toeplitz-plus-Hankel matrices