Efficient implementation of wilson's algorithm for factorizing a self-reciprocal polynomial
From MaRDI portal
Publication:3862959
DOI10.1007/BF01933201zbMath0427.65033MaRDI QIDQ3862959
Publication date: 1980
Published in: BIT (Search for Journal in Brave)
Newton's methodCholesky factorizationToeplitz matrixnumerical stabilitySchur-Cohn algorithmWilson's algorithmBauer's algorithmfactorizing a self-reciprocal polynomial
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Sharp filters for short sequences ⋮ A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial ⋮ Improved frequency selective filters ⋮ Econometric methods of signal extraction ⋮ On the criterion function for ARMA estimation ⋮ A fast algorithm for solving banded Toeplitz systems
Cites Work
- Unnamed Item
- Unnamed Item
- Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
- Factorization of the Covariance Generating Function of a Pure Moving Average Process
- Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials
This page was built for publication: Efficient implementation of wilson's algorithm for factorizing a self-reciprocal polynomial