Spectral Factorization and Nevanlinna–Pick Interpolation
- 1 May 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 25 (3) , 754-766
Abstract
We develop a spectral factorization algorithm based on linear fractional transformations and on the Nevanlinna–Pick interpolation theory. The algorithm is recursive and depends on a choice of points $(z_k ,k = 1,2, \cdots )$ inside the unit disk. Under a mild condition on the distribution of the $z_k $ ’s, the convergence of the algorithm is established. The algorithm is flexible and convergence can be influenced by the selection of $z_k $’s.
Keywords
This publication has 14 references indexed in Scilit:
- Linear fractional transformations and spectral factorizationIEEE Transactions on Automatic Control, 1986
- Non-Euclidian metrics and the robust stabilization of systems with parameter uncertaintyIEEE Transactions on Automatic Control, 1985
- On polynomial matrix spectral factorization by symmetric extractionIEEE Transactions on Automatic Control, 1985
- Schur recursions, error formulas, and convergence of rational estimators for stationary stochastic sequencesIEEE Transactions on Information Theory, 1981
- Lossless chain scattering matrices and optimum linear prediction: The vector caseInternational Journal of Circuit Theory and Applications, 1981
- On the role of the Nevanlinna–Pick problem in circuit and system theoryInternational Journal of Circuit Theory and Applications, 1981
- A simple approach to spectral factorizationIEEE Transactions on Circuits and Systems, 1978
- On a generalized Szegö- Levinson realization algorithm for optimal linear predictors based on a network synthesis approachIEEE Transactions on Circuits and Systems, 1978
- Recursive algorithm for spectral factorizationIEEE Transactions on Circuits and Systems, 1974
- A view of three decades of linear filtering theoryIEEE Transactions on Information Theory, 1974