Immittance- versus scattering-domain fast algorithms for non-Hermitian Toeplitz and quasi-Toeplitz matrices
From MaRDI portal
Publication:908655
DOI10.1016/0024-3795(89)90678-2zbMath0693.65018MaRDI QIDQ908655
Yuval Bistritz, Thomas Kailath, Hanoch Lev-Ari
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
efficiency; Levinson algorithm; Schur algorithm; recursions; immittance algorithm; non- Hermitian Toeplitz and quasi-Toeplitz matrices; QT algorithm; scattering-domain algorithms
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
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