Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices

DOI10.1137/0149076zbMath0679.65030OpenAlexW2053956289MaRDI QIDQ4729243

Bal Krishna, Hari Krishna

Publication date: 1989

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0149076

zbMATH Keywords

reflection coefficientsthree-term recurrence relationLevinson polynomialLevinson-Durbin algorithmSzegö polynomialHermitian, positive definite Toeplitz matrix

Mathematics Subject Classification ID

Related Items (3)

Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile ⋮ Topics in the numerical linear algebra of Toeplitz and Hankel matrices ⋮ On reduced polynomial-based split algorithms

This page was built for publication: Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices