Efficient algorithm for Toeplitz plus Hankel matrices
From MaRDI portal
Publication:1119333
DOI10.1007/BF01199761zbMath0671.65020OpenAlexW2088105597MaRDI QIDQ1119333
Israel Gohberg, Israel Koltracht
Publication date: 1989
Published in: Integral Equations and Operator Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01199761
algorithmsparse structured matricessum of a Toeplitz and a Hankel matrixToeplitz plus Hankel matrices
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Early termination in sparse interpolation algorithms ⋮ Fast direct solution methods for symmetric banded Toeplitz systems, based on the sine transform ⋮ Displacement-structure approach to polynomial Vandermonde and related matrices ⋮ A fast algorithm for generalized Hankel matrices arising in finite-moment problems ⋮ Spectral properties of Toeplitz-plus-Hankel matrices
Cites Work
- Unnamed Item
- Numerical solution of integral equations, fast algorithms and Krein- Sobolev equation
- A definiteness test for Hankel matrices and their lower submatrices
- Efficient solution of linear systems of equations with recursive structure
- Efficient solution of a Toeplitz-plus-Hankel coefficient matrix system of equations
