Fast algorithms for computing QR and Cholesky factors of Toeplitz operators
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 36 (11) , 1740-1748
- https://doi.org/10.1109/29.9011
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Vector algorithms for computing QR and Cholesky factors of close-to-Toeplitz matricesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Cellular architectures for implementing projection operatorsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- The numerical stability of the lattice algorithm for least squares linear prediction problemsBIT Numerical Mathematics, 1984
- A highly concurrent algorithm and pipeleined architecture for solving Toeplitz systemsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983
- A general orthogonalization technique with applications to time series analysis and signal processingMathematics of Computation, 1983
- The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of EquationsSIAM Journal on Scientific and Statistical Computing, 1980
- A fixed point computation of partial correlation coefficientsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- A method for least squares solution of systems with a cyclic rectangular coefficient matrixJournal of Computational and Applied Mathematics, 1975
- Fixed-point truncation arithmetic implementation of a linear prediction autocorrelation vocoderIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- The Fitting of Time-Series ModelsRevue de l'Institut International de Statistique / Review of the International Statistical Institute, 1960