Immittance- versus scattering-domain fast algorithms for non-Hermitian Toeplitz and quasi-Toeplitz matrices

DOI10.1016/0024-3795(89)90678-2zbMath0693.65018OpenAlexW2013974402MaRDI QIDQ908655

Hanoch Lev-Ari, Yuval Bistritz, Thomas Kailath

Publication date: 1989

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(89)90678-2

zbMATH Keywords

efficiencyLevinson algorithmSchur algorithmrecursionsimmittance algorithmnon- Hermitian Toeplitz and quasi-Toeplitz matricesQT algorithmscattering-domain algorithms

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (4)

Schur Analysis in the Quaternionic Setting: The Fueter Regular and the Slice Regular Case ⋮ A fraction-free unit-circle zero location test for a polynomial with any singularity profile ⋮ On linear combinations of positive functions, associated reproducing kernel spaces and a non Hermitian Schur algorithm ⋮ A theorem on reproducing kernel Hilbert spaces of pairs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic methods for Toeplitz-like matrices and operators
• A circular stability test for general polynomials
• Fast matrix factorizations via discrete transmission lines
• Inversion and factorization of non-Hermitian quasi-Toeplitz matrices
• A direct Routh stability method for discrete system modelling
• Lattice filter parameterization and modeling of nonstationary processes
• Linear Prediction of Speech
• Immitance-Type Three-Term Schur and Levinson Recursions for Quasi-Toeplitz Complex Hermitian Matrices
• An Algorithm for the Inversion of Finite Toeplitz Matrices
• Toeplitz Matrix Inversion: The Algorithm of W. F. Trench

This page was built for publication: Immittance- versus scattering-domain fast algorithms for non-Hermitian Toeplitz and quasi-Toeplitz matrices