On reduced polynomial-based split algorithms
From MaRDI portal
Publication:1320122
DOI10.1007/BF01187546zbMath0803.65051MaRDI QIDQ1320122
Publication date: 2 January 1995
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
computational complexitySchur algorithmToeplitz matricesthree-term recurrence relationLevinson-Durbin algorithmlattice algorithmssplit algorithms
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- An inverse problem for Toeplitz matrices
- Some matrix factorization identities for discrete inverse scattering
- An inverse problem for Toeplitz matrices and the synthesis of discrete transmission lines
- The Fitting of Time-Series Models
- The One-Dimensional Inverse Problem of Reflection Seismology
- The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of Equations
- A fixed point computation of partial correlation coefficients
- Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
- Immittance-domain Levinson algorithms
This page was built for publication: On reduced polynomial-based split algorithms
