A fast algorithm for solving a Toeplitz system of equations
From MaRDI portal
Publication:3757245
DOI10.1109/TASSP.1985.1164492zbMath0621.65015MaRDI QIDQ3757245
Publication date: 1985
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
fast Fourier transformfast algorithmblock Toeplitz matricesToeplitz systemTrench algorithmbanded Toeplitz matrices
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
GF(2n) Redundant Representation Using Matrix Embedding for Irreducible Trinomials ⋮ A stabilized superfast solver for indefinite Hankel systems ⋮ A finite elements approach for spread contract valuation via associated two-dimensional PIDE ⋮ A method for finding the zeros of polynomials using a companion matrix. ⋮ Derivation and Analysis of Fast Bilinear Algorithms for Convolution ⋮ Constrained maximum likelihood estimators for superimposed exponential signals ⋮ A fast, preconditioned conjugate gradient Toeplitz solver ⋮ Power series remainder sequences and Padé fractions over an integral domain